विधियों की तुलना करें

	Lattice-Based Cryptography	आरएसए क्रिप्टोसिसटम
क्षेत्र	क्रिप्टोग्राफी	क्रिप्टोग्राफी
परिवार	Machine learning	Machine learning
उद्भव वर्ष	1996	1978
प्रवर्तक	Miklós Ajtai	Ronald Rivest
प्रकार	public-key cryptosystem based on lattice hardness	asymmetric encryption algorithm
मौलिक स्रोत	Ajtai, M. (1996). Generating hard instances of the short basis problem. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pp. 99-108.	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.
उपनाम	lattice cryptography, post-quantum lattice cryptography	RSA encryption, RSA public-key cryptography
संबंधित	3	4
सारांश	Lattice-based cryptography is a class of cryptosystems whose security is derived from the computational hardness of lattice problems, particularly the shortest vector problem (SVP) and learning with errors (LWE). First proposed by Miklós Ajtai in 1996, lattice-based approaches have gained prominence as the leading candidates for post-quantum cryptography. Unlike RSA and ECC, which are vulnerable to quantum computers, lattice problems are believed to remain hard even against quantum algorithms.	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.