H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science H-index 34 Citations 4,953 120 World Ranking 6259 National Ranking 110

Overview

What is he best known for?

The fields of study he is best known for:

  • Cryptography
  • Block cipher
  • Topology

The scientist’s investigation covers issues in Block cipher, Algorithm, Computer security, Theoretical computer science and Boomerang attack. Many of his studies on Block cipher apply to Cryptanalysis as well. His work on Impossible differential cryptanalysis and Hamming distance as part of general Algorithm research is frequently linked to Quadratic equation, thereby connecting diverse disciplines of science.

The study incorporates disciplines such as Artificial intelligence and Brute-force search in addition to Computer security. His work deals with themes such as Artificial neural network, Meet-in-the-middle attack, Metric and Advanced Encryption Standard, which intersect with Theoretical computer science. He works mostly in the field of Related-key attack, limiting it down to topics relating to Slide attack and, in certain cases, Chosen-ciphertext attack, as a part of the same area of interest.

His most cited work include:

  • KATAN and KTANTAN -- A Family of Small and Efficient Hardware-Oriented Block Ciphers (498 citations)
  • The Rectangle Attack - Rectangling the Serpent (199 citations)
  • A Framework for Iterative Hash Functions — HAIFA ? (179 citations)

What are the main themes of his work throughout his whole career to date?

His scientific interests lie mostly in Block cipher, Theoretical computer science, Algorithm, Computer security and Cryptanalysis. Block cipher and Cipher are frequently intertwined in his study. His research investigates the connection between Theoretical computer science and topics such as Hash function that intersect with problems in Function.

In his study, which falls under the umbrella issue of Cryptanalysis, Plaintext is strongly linked to Ciphertext. His Differential cryptanalysis study combines topics from a wide range of disciplines, such as Correlation attack and Linear cryptanalysis. His studies in Slide attack integrate themes in fields like Related-key attack, Meet-in-the-middle attack, Chosen-ciphertext attack and Fluhrer, Mantin and Shamir attack.

He most often published in these fields:

  • Block cipher (55.96%)
  • Theoretical computer science (29.82%)
  • Algorithm (27.98%)

What were the highlights of his more recent work (between 2016-2021)?

  • Block cipher (55.96%)
  • Computer security (24.77%)
  • Discrete mathematics (12.39%)

In recent papers he was focusing on the following fields of study:

His primary areas of investigation include Block cipher, Computer security, Discrete mathematics, Cryptanalysis and Cryptosystem. His study in Block cipher focuses on Slide attack and Differential cryptanalysis. Orr Dunkelman focuses mostly in the field of Differential cryptanalysis, narrowing it down to matters related to Linear cryptanalysis and, in some cases, S-box and Relation.

His work carried out in the field of Discrete mathematics brings together such families of science as Multiple encryption and Hash function. In Hash function, Orr Dunkelman works on issues like Function, which are connected to Cryptography. His Cryptanalysis research is multidisciplinary, incorporating perspectives in Structure, Type, Format-preserving encryption and Theoretical computer science.

Between 2016 and 2021, his most popular works were:

  • No Bot Expects the DeepCAPTCHA! Introducing Immutable Adversarial Examples, With Applications to CAPTCHA Generation (72 citations)
  • A Simple Explanation for the Existence of Adversarial Examples with Small Hamming Distance. (48 citations)
  • Techniques for Cryptanalysis of Block Ciphers (16 citations)

In his most recent research, the most cited papers focused on:

  • Cryptography
  • Topology
  • Artificial intelligence

Orr Dunkelman mainly investigates Computer security, Block cipher, Cryptanalysis, Differential cryptanalysis and Arithmetic. His Computer security research includes themes of Adversarial system and Deep learning. His studies deal with areas such as Cryptosystem and Cipher as well as Block cipher.

Orr Dunkelman works mostly in the field of Differential cryptanalysis, limiting it down to topics relating to Linear cryptanalysis and, in certain cases, COCONUT98, Serpent and Discrete mathematics. As part of the same scientific family, Orr Dunkelman usually focuses on Arithmetic, concentrating on Impossible differential cryptanalysis and intersecting with S-box. His Boomerang attack study incorporates themes from GOST, Fluhrer, Mantin and Shamir attack, Meet-in-the-middle attack and Related-key attack.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Top Publications

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

Christophe Cannière;Orr Dunkelman;Miroslav Knežević.
cryptographic hardware and embedded systems (2009)

787 Citations

The Rectangle Attack - Rectangling the Serpent

Eli Biham;Orr Dunkelman;Nathan Keller.
theory and application of cryptographic techniques (2001)

290 Citations

A Framework for Iterative Hash Functions — HAIFA ?

Eli Biham;Orr Dunkelman.
IACR Cryptology ePrint Archive (2007)

268 Citations

Related-Key boomerang and rectangle attacks

Eli Biham;Orr Dunkelman;Nathan Keller.
theory and application of cryptographic techniques (2005)

260 Citations

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

Alex Biryukov;Orr Dunkelman;Nathan Keller;Dmitry Khovratovich.
theory and application of cryptographic techniques (2010)

240 Citations

Cryptanalysis of the A5/1 GSM Stream Cipher

Eli Biham;Orr Dunkelman.
international conference on progress in cryptology (2000)

201 Citations

New Impossible Differential Attacks on AES

Jiqiang Lu;Orr Dunkelman;Nathan Keller;Jongsung Kim.
international conference on cryptology in india (2008)

173 Citations

A Practical Attack on KeeLoq

Sebastiaan Indesteege;Nathan Keller;Eli Biham;Orr Dunkelman.
Lecture Notes in Computer Science (2008)

156 Citations

A practical attack on KeeLoq

Sebastiaan Indesteege;Nathan Keller;Orr Dunkelman;Eli Biham.
international cryptology conference (2008)

148 Citations

Minimalism in cryptography: the even-mansour scheme revisited

Orr Dunkelman;Nathan Keller;Adi Shamir.
theory and application of cryptographic techniques (2012)

146 Citations

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.

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

Contact us

Top Scientists Citing Orr Dunkelman

Alex Biryukov

Alex Biryukov

University of Luxembourg

Publications: 44

Andrey Bogdanov

Andrey Bogdanov

CYBERCRYPT

Publications: 42

Bart Preneel

Bart Preneel

KU Leuven

Publications: 40

Christian Rechberger

Christian Rechberger

Graz University of Technology

Publications: 34

Vincent Rijmen

Vincent Rijmen

KU Leuven

Publications: 34

Lei Wang

Lei Wang

Shanghai Jiao Tong University

Publications: 32

Gregor Leander

Gregor Leander

Ruhr University Bochum

Publications: 31

Pierre-Alain Fouque

Pierre-Alain Fouque

University of Rennes 1

Publications: 24

Christof Paar

Christof Paar

Max Planck Society

Publications: 24

Willi Meier

Willi Meier

University of Applied Sciences and Arts Northwestern Switzerland

Publications: 22

François-Xavier Standaert

François-Xavier Standaert

Université Catholique de Louvain

Publications: 21

Guang Gong

Guang Gong

University of Waterloo

Publications: 20

Raphael C.-W. Phan

Raphael C.-W. Phan

Monash University Malaysia

Publications: 19

Lars R. Knudsen

Lars R. Knudsen

Technical University of Denmark

Publications: 18

Marek R. Ogiela

Marek R. Ogiela

AGH University of Science and Technology

Publications: 17

Something went wrong. Please try again later.