2026 Orr Dunkelman: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	47	6558	6369	103	98	183	7893

Overview

Orr Dunkelman is affiliated with the University of Haifa in Israel and specializes primarily in the field of Computer Science. Their research output spans various subfields, including Artificial Intelligence, Computer Vision and Pattern Recognition, Signal Processing, Hardware and Architecture, and Computer Networks and Communications. The work concentrates notably on cryptographic implementations and security, coding theory, chaos-based image and signal encryption, physical unclonable functions (PUFs) and hardware security, biometric identification and security, cryptography and data security, as well as face recognition and analysis.

Among recent publications authored or co-authored by Orr Dunkelman are the following papers:

"The QARMAv2 Family of Tweakable Block Ciphers," 2023, IACR Transactions on Symmetric Cryptology
"Inverting Binarizations of Facial Templates Produced by Deep Learning (and Its Implications)," 2021, IEEE Transactions on Information Forensics and Security
"Finding Collisions against 4-Round SHA-3-384 in Practical Time," 2022, IACR Transactions on Symmetric Cryptology
"Practical Related-Key Forgery Attacks on Full-Round TinyJAMBU-192/256," 2023, IACR Transactions on Symmetric Cryptology
"Collaboration between Government and Research Community to Respond to COVID-19: Israel's Case," 2021, Journal of Open Innovation Technology Market and Complexity

Dunkelman's frequent co-authors include:

Nathan Keller
Adi Shamir
Eyal Ronen
Shibam Ghosh
Eran Lambooij

The most common publication venues where Dunkelman's research appears include:

IACR Transactions on Symmetric Cryptology
arXiv (Cornell University)
Designs Codes and Cryptography
Lecture Notes in Computer Science
IEEE Transactions on Information Forensics and Security

In terms of book publications, they have contributed to works published by Springer Science+Business Media, specifically "Advances in Cryptology - EUROCRYPT 2022" and "Selected Areas in Cryptography."

Best Publications

KATAN and KTANTAN -- A Family of Small and Efficient Hardware-Oriented Block Ciphers

Christophe Cannière;Orr Dunkelman;Miroslav Knežević

924
Citations
The Rectangle Attack - Rectangling the Serpent.

Eli Biham;Orr Dunkelman;Nathan Keller

359
Citations
Related-Key boomerang and rectangle attacks

Eli Biham;Orr Dunkelman;Nathan Keller

294
Citations
A Framework for Iterative Hash Functions — HAIFA ?

Eli Biham;Orr Dunkelman

281
Citations
Key recovery attacks of practical complexity on AES-256 variants with up to 10 rounds

Alex Biryukov;Orr Dunkelman;Nathan Keller;Dmitry Khovratovich

268
Citations
Cryptanalysis of the A5/1 GSM Stream Cipher

Eli Biham;Orr Dunkelman

229
Citations
New Impossible Differential Attacks on AES

Jiqiang Lu;Orr Dunkelman;Nathan Keller;Jongsung Kim

208
Citations
A related-key rectangle attack on the full KASUMI

Eli Biham;Orr Dunkelman;Nathan Keller

205
Citations
No Bot Expects the DeepCAPTCHA! Introducing Immutable Adversarial Examples, With Applications to CAPTCHA Generation

Margarita Osadchy;Julio Hernandez-Castro;Stuart Gibson;Orr Dunkelman

189
Citations
Minimalism in cryptography: the even-mansour scheme revisited

Orr Dunkelman;Nathan Keller;Adi Shamir

181
Citations
Improved Single-Key Attacks on 8-Round AES-192 and AES-256

Orr Dunkelman;Nathan Keller;Adi Shamir

180
Citations
A practical-time related-key attack on the KASUMI cryptosystem used in GSM and 3G telephony

Orr Dunkelman;Nathan Keller;Adi Shamir

176
Citations
A practical attack on KeeLoq

Sebastiaan Indesteege;Nathan Keller;Orr Dunkelman;Eli Biham

168
Citations
A Practical Attack on KeeLoq

Sebastiaan Indesteege;Nathan Keller;Eli Biham;Orr Dunkelman

161
Citations
New results on boomerang and rectangle attacks

Eli Biham;Orr Dunkelman;Nathan Keller

157
Citations
Enhancing differential-linear cryptanalysis

Eli Biham;Orr Dunkelman;Nathan Keller

156
Citations
Improving the efficiency of impossible differential cryptanalysis of reduced Camellia and MISTY1

Jiqiang Lu;Jongsung Kim;Nathan Keller;Orr Dunkelman

145
Citations
KATAN & KTANTAN - A Family of Small and Efficient Hardware-Oriented Block Ciphers

Christophe De Cannière;Orr Dunkelman;Miroslav Knezevic

134
Citations
Related-Key impossible differential attacks on 8-round AES-192

Eli Biham;Orr Dunkelman;Nathan Keller

119
Citations
New attacks on keccak-224 and keccak-256

Itai Dinur;Orr Dunkelman;Adi Shamir

109
Citations
ECRYPT yearly report on algorithms and keysizes

Steve Babbage;Dario Catalano;Carlos Cid;Benne de Weger

46
Citations
A Practical Attack on KeeLoq

Wim Aerts;Eli Biham;Dieter De Moitié;Elke De Mulder

36
Citations
Improved Single-Key Attacks on 8-Round AES-192 and AES-256

Orr Dunkelman;Nathan Keller;Adi Shamir

33
Citations
Related-Key Boomerang and Rectangle Attacks.

Jongsung Kim;Seokhie Hong;Bart Preneel;Eli Biham

8
Citations

Frequent Co-Authors

Nathan Keller Bar-Ilan University

Adi Shamir Weizmann Institute of Science

Eli Biham Technion – Israel Institute of Technology

Bart Preneel KU Leuven

Pierre-Alain Fouque University of Rennes

Alex Biryukov University of Luxembourg

Christian Rechberger Graz University of Technology

Vincent Rijmen KU Leuven

John Kelsey National Institute of Standards and Technology

Ingrid Verbauwhede KU Leuven

External Links

Personal website of Orr Dunkelman Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Exploring online degrees can open up new educational and career pathways in computer science and related fields. Many students seek flexible options, such as online associate degrees, which offer a quick and cost-effective entry point into tech careers or further study. For those aiming higher, pursuing a cheap doctorate degree online can minimize educational costs while maximizing long-term academic and professional opportunities.

Time is also a major consideration for busy professionals. Choosing the fastest online edd programs is a smart way to achieve advanced qualifications without years of full-time study. For students deciding between tech and business, understanding online business degree cost can help weigh the return on investment when planning future steps.

Each of these pathways–from associate to doctorate and beyond–allows students to tailor their education to their schedule, budget, and career aspirations, making it easier to succeed in today’s fast-changing job market.