Vertaile menetelmiä

	Elliptinen käyräsalakirjoitus	Verkkopohjainen kryptografia
Tieteenala	Kryptografia	Kryptografia
Menetelmäperhe	Machine learning	Machine learning
Syntyvuosi	1985	1996
Kehittäjä	Neal Koblitz	Miklós Ajtai
Tyyppi	asymmetric encryption and key agreement	public-key cryptosystem based on lattice hardness
Alkuperäislähde	Miller, V. S. (1985). Use of Elliptic Curves in Cryptography. In Proceedings of the Advances in Cryptology - CRYPTO 1985, LNCS 218, pp. 417-426.	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.
Rinnakkaisnimet	ECC, elliptic curve cryptosystem	lattice cryptography, post-quantum lattice cryptography
Liittyvät	3	3
Tiivistelmä	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.	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.