Linganisha mbinu

	Mfumo wa Usimbaji fiche wa RSA	Uchambuzi wa Tofauti	Usanifu wa Kielektroniki wa Curve (ECC)
Nyanja	Kriptografia	Kriptografia	Kriptografia
Familia	Machine learning	Machine learning	Machine learning
Mwaka wa asili	1978	1990	1985
Mwanzilishi	Ronald Rivest	Eli Biham	Neal Koblitz
Aina	asymmetric encryption algorithm	statistical attack on block ciphers	asymmetric encryption and key agreement
Chanzo asilia	Rivest, R. L., Shamir, A., & Adleman, L. (1978). A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2), 120-126.	Biham, E., & Shamir, A. (1990). Differential cryptanalysis of DES-like cryptosystems. In Advances in Cryptology - CRYPTO 1990, LNCS 537, pp. 2-21.	Miller, V. S. (1985). Use of Elliptic Curves in Cryptography. In Proceedings of the Advances in Cryptology - CRYPTO 1985, LNCS 218, pp. 417-426.
Majina mbadala	RSA encryption, RSA public-key cryptography	differential attack, differential path, differential probability	ECC, elliptic curve cryptosystem
Zinazohusiana	4	3	3
Muhtasari	RSA is a foundational public-key cryptosystem developed by Rivest, Shamir, and Adleman in 1978. It enables secure encryption and digital signatures by using a pair of mathematically linked keys: a public key for encryption and a private key for decryption. RSA's security relies on the computational difficulty of factoring large composite numbers into their prime factors.	Differential cryptanalysis is a statistical attack technique on symmetric block ciphers that analyzes differences in inputs and outputs to recover secret keys. Introduced by Eli Biham and Adi Shamir in 1990, differential cryptanalysis was the first practical attack on DES that outperformed brute force search. The technique exploits non-random properties of cipher transformations by studying how small changes in plaintext propagate through the cipher rounds. Differential cryptanalysis has shaped cipher design for three decades.	Elliptic Curve Cryptography (ECC) is a public-key cryptosystem based on the algebraic structure of elliptic curves over finite fields. Proposed independently by Neal Koblitz and Victor Miller in 1985, ECC offers equivalent security to RSA with much smaller key sizes. Modern cryptography increasingly favors ECC for its efficiency: a 256-bit ECC key provides security comparable to a 2048-bit RSA key, making it ideal for constrained environments and high-performance systems.