השוואת שיטות

	קריפטוגרפיה מבוססת עקומים אליפטיים	HMAC	zk-SNARK
תחום	קריפטוגרפיה	קריפטוגרפיה	קריפטוגרפיה
משפחה	Machine learning	Machine learning	Machine learning
שנת המקור	1985	1997	2014
הוגה השיטה	Neal Koblitz	Hugo Krawczyk	Eli Ben-Sasson
סוג	asymmetric encryption and key agreement	cryptographic authentication mechanism	zero-knowledge argument of knowledge
מקור מכונן	Miller, V. S. (1985). Use of Elliptic Curves in Cryptography. In Proceedings of the Advances in Cryptology - CRYPTO 1985, LNCS 218, pp. 417-426.	Krawczyk, H., Bellare, M., & Crechanko, R. (1997). HMAC: Keyed-Hashing for Message Authentication. RFC 2104.	Ben-Sasson, E., Chiesa, A., Garman, C., Green, M., Miers, I., Tromer, E., & Virza, M. (2014). Zerocash: Decentralized Anonymous Payments from Bitcoin. In IEEE Symposium on Security and Privacy (SP), pp. 459-474.
כינויים	ECC, elliptic curve cryptosystem	HMAC, keyed hash function	zk-SNARK, zero-knowledge proof, SNARK
קשורות	3	3	3
תקציר	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.	HMAC (Hash-Based Message Authentication Code) is a cryptographic algorithm for authenticating messages using a secret key and a hash function. Standardized in RFC 2104 (1997), HMAC can be combined with any cryptographic hash function (SHA-256, SHA-3, etc.) to create a message authentication code (MAC). HMAC provides both data integrity and authentication, detecting both accidental corruption and deliberate tampering, and is widely used in web security (TLS/SSL), API authentication, and network protocols.	A zk-SNARK (Zero-Knowledge Succinct Non-Interactive Argument of Knowledge) is a cryptographic proof system that allows a prover to convince a verifier that a statement is true without revealing any information beyond the statement's validity. The acronym describes its key properties: it requires no interaction, proofs are short (succinct), and verification is efficient. zk-SNARKs were popularized by their application in the Zcash cryptocurrency but have since found use in blockchain scaling solutions, privacy-preserving computations, and verifiable computing.