השוואת שיטות

	ניתוח ערוץ צדדי	AES (Rijndael)	קריפטוגרפיה מבוססת עקומים אליפטיים
תחום	קריפטוגרפיה	קריפטוגרפיה	קריפטוגרפיה
משפחה	Machine learning	Machine learning	Machine learning
שנת המקור	1996	2001	1985
הוגה השיטה	Paul Kocher	Joan Daemen	Neal Koblitz
סוג	physical side-channel exploitation	symmetric encryption algorithm	asymmetric encryption and key agreement
מקור מכונן	Kocher, P. C. (1996). Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems. In Advances in Cryptology - CRYPTO 1996, LNCS 1109, pp. 104-113.	Daemen, J., & Rijmen, V. (2002). The Design of Rijndael: AES - The Advanced Encryption Standard. Springer-Verlag. ISBN: 978-3540425809	Miller, V. S. (1985). Use of Elliptic Curves in Cryptography. In Proceedings of the Advances in Cryptology - CRYPTO 1985, LNCS 218, pp. 417-426.
כינויים	SCA, timing attack, power analysis, cache attack	Rijndael, AES encryption, FIPS 197	ECC, elliptic curve cryptosystem
קשורות	3	4	3
תקציר	Side-channel analysis is a family of attacks that exploit physical properties of cryptographic implementations (timing, power consumption, electromagnetic emissions, cache behavior) to recover secret keys. Introduced by Paul Kocher in 1996, side-channel attacks have repeatedly broken implementations of theoretically secure cryptosystems by leveraging unintended information leakage. Side-channel analysis has become a critical concern in cryptographic system design, requiring constant-time implementations and physical countermeasures.	The Advanced Encryption Standard (AES), also known as Rijndael, is a symmetric block cipher adopted as the official encryption standard by the U.S. government in 2001. It processes data in 128-bit blocks using 128, 192, or 256-bit keys and performs multiple rounds of substitution, permutation, and mixing operations. AES is the most widely used symmetric encryption algorithm today, securing everything from government communications to everyday internet traffic.	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.