Jämför metoder

	Gitterbaserad kryptografi	Elliptisk kurvkryptografi
Ämnesområde	Kryptografi	Kryptografi
Familj	Machine learning	Machine learning
Ursprungsår	1996	1985
Upphovsperson	Miklós Ajtai	Neal Koblitz
Typ	public-key cryptosystem based on lattice hardness	asymmetric encryption and key agreement
Ursprungskälla	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.	Miller, V. S. (1985). Use of Elliptic Curves in Cryptography. In Proceedings of the Advances in Cryptology - CRYPTO 1985, LNCS 218, pp. 417-426.
Alias	lattice cryptography, post-quantum lattice cryptography	ECC, elliptic curve cryptosystem
Närliggande	3	3
Sammanfattning	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.	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.