Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Elliptisk kurvkryptografi× | zk-STARK× | |
|---|---|---|
| Ämnesområde | Kryptografi | Kryptografi |
| Familj | Machine learning | Machine learning |
| Ursprungsår≠ | 1985 | 2018 |
| Upphovsperson≠ | Neal Koblitz | Eli Ben-Sasson |
| Typ≠ | asymmetric encryption and key agreement | transparent zero-knowledge argument of knowledge |
| Ursprungskälla≠ | Miller, V. S. (1985). Use of Elliptic Curves in Cryptography. In Proceedings of the Advances in Cryptology - CRYPTO 1985, LNCS 218, pp. 417-426. DOI ↗ | Ben-Sasson, E., Bentov, I., Horesh, Y., & Riabzev, M. (2019). Scalable, transparent, and post-quantum secure computational integrity. In IACR Cryptology ePrint Archive, Report 2018/046. link ↗ |
| Alias≠ | ECC, elliptic curve cryptosystem | zk-STARK, transparent argument of knowledge, STARK |
| Närliggande | 3 | 3 |
| Sammanfattning≠ | 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. | A zk-STARK (Zero-Knowledge Scalable Transparent Argument of Knowledge) is a cryptographic proof system allowing a prover to convince a verifier of a computation's correctness without trusted setup or revealing computational details. Introduced by Ben-Sasson and colleagues in 2018, zk-STARKs address a key limitation of zk-SNARKs: they require no preprocessing phase vulnerable to corruption. Instead, STARKs rely only on cryptographic hash functions, making them simpler, more transparent, and believed to be post-quantum secure. |
| ScholarGateDatamängd ↗ |
|
|