Eli Biham
{{Short description|Israeli cryptographer and cryptanalyst (born 1960) |bot=PearBOT 5}}
{{BLP more sources|date=January 2008}}
{{Infobox scientist
|name = Eli Biham
|native_name = אלי ביהם
|image_size =
|image = Eli Biham.jpg
|caption = Eli Biham in 2009.
|birth_date = {{birth year and age|1960}}
|birth_place =
|death_date =
|death_place =
|nationality = Israeli
|alma_mater = Tel Aviv University,
Weizmann Institute
|doctoral_advisor = Adi Shamir
|doctoral_students =
|known_for = Studies in cryptography and cryptanalysis (invention and breaking of Encryption functions), specifically Differential cryptanalysis
|field = Computer science
|work_institutions = Technion – Israel Institute of Technology
}}
Eli Biham ({{langx|he|אלי ביהם}}) 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,{{Cite web|url=https://www.iacr.org/fellows/2012/biham.html|title=Eli Biham, 2012 IACR Fellow|website=www.iacr.org}} for which he received his Ph.D., while working under Adi Shamir.
Contributions to cryptanalysis
{{prose|section|date=December 2023}}
- 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 PerleBiham, 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
- Efficient slide attacks with reduced time complexityBar-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
=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
{{Reflist}}
External links
- [https://www.cs.technion.ac.il/~biham/ Eli Biham's homepage at Technion]
{{Authority control}}
{{DEFAULTSORT:Biham, Eli}}
Category:International Association for Cryptologic Research fellows