Eli Biham
Template:Short description Template:BLP more sources
Script error: No such module "Template wrapper".Script error: No such module "Check for clobbered parameters". Eli Biham (Template:Langx) is an Israeli cryptographer and cryptanalyst who is a professor at the Technion - Israel Institute of Technology Computer Science department. From 2008 to 2013, Biham was the dean of the Technion Computer Science department, after serving for two years as chief of CS graduate school. Biham invented (publicly) differential cryptanalysis,[1] for which he received his Ph.D., while working under Adi Shamir.
Contributions to cryptanalysis
Script error: No such module "Unsubst".
- Differential cryptanalysis - publicly invented during his Ph.D. studies under Adi Shamir
- Attacking all triple modes of operation.
- Impossible differential cryptanalysis - joint work with Adi Shamir and Alex Biryukov
- Breaking (together with Lars Knudsen) the ANSI X9.52 CBCM mode (few days before the final standardization)
- Breaking the GSM security mechanisms (with Elad Barkan and Nathan Keller)
- Co-invention of related-key attacks.
- Differential Fault Analysis - joint work with Adi Shamir
- Conditional Linear Cryptanalysis - joint work with Stav Perle[2]
- Efficient slide attacks with reduced time complexity[3]
New cryptographic primitives
Biham has taken part in the design of several new cryptographic primitives:
- Serpent (with Ross Anderson and Lars Knudsen), a block cipher which was one of the final five contenders to become the Advanced Encryption Standard
- Tiger (with Ross Anderson), a hash function fast on 64-bit machines, and
- Py (with Jennifer Seberry), one of a family of fast stream ciphers (see article for more detail on their cryptanalytic status).
- SHAvite-3 (with Orr Dunkelman), a hash function which was one of the 14 semifinalists in the NIST hash function competition.
References
<templatestyles src="Reflist/styles.css" />
- ↑ Script error: No such module "citation/CS1".
- ↑ Biham, E., & Perle, S. (2018). Conditional Linear Cryptanalysis – Cryptanalysis of DES with Less Than 242 Complexity. IACR Transactions on Symmetric Cryptology, 2018(3). https://doi.org/10.13154/tosc.v2018.i3.215-264
- ↑ Bar-On, A., Biham, E., Dunkelman, O., & Keller, N. (2018). Efficient Slide Attacks. Journal of Cryptology, 31(3), 641–670. https://doi.org/10.1007/s00145-017-9266-8
Script error: No such module "Check for unknown parameters".