Adi Shamir
Adi Shamir

Wikipedia Entry
Adi.Shamiratweizmann.ac.il

  Affiliation history
· Massachusetts Institute of Technology
· Weizmann Institute of Science Israel
· Ecole Normale Superieure
Bibliometrics: publication history
Average citations per article75.99
Citation Count11,095
Publication count146
Publication years1975-2016
Available for download23
Average downloads per article3,882.00
Downloads (cumulative)89,286
Downloads (12 Months)50,745
Downloads (6 Weeks)586
A. M. Turing Award Winner Professional ACM Member
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


147 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 147
Result page: 1 2 3 4 5 6 7 8

Sort by:

1
Acoustic Cryptanalysis
Daniel Genkin, Adi Shamir, Eran Tromer
March 2017 Journal of Cryptology: Volume 30 Issue 2, April 2017
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

Many computers emit a high-pitched noise during operation, due to vibration in some of their electronic components. These acoustic emanations are more than a nuisance: They can convey information about the software running on the computer and, in particular, leak sensitive information about security-related computations. In a preliminary presentation (Eurocrypt'04 ...
Keywords: Side channel attacks, Acoustic emanations, Cryptanalysis, RSA

2
Bug Attacks
Eli Biham, Yaniv Carmeli, Adi Shamir
September 2016 Journal of Cryptology: Volume 29 Issue 4, October 2016
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

In this paper we present a new kind of cryptanalytic attack which utilizes bugs in the hardware implementation of computer instructions. The best-known example of such a bug is the Intel division bug, which resulted in slightly inaccurate results for extremely rare inputs. Whereas in most applications such bugs can ...
Keywords: RSA, ElGamal encryption, Fault attack, Pohlig---Hellman, Bug attack

3
Key Recovery Attacks on Iterated Even---Mansour Encryption Schemes
Itai Dinur, Orr Dunkelman, Nathan Keller, Adi Shamir
September 2016 Journal of Cryptology: Volume 29 Issue 4, October 2016
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

Iterated Even---Mansour (EM) encryption schemes (also named "key-alternating ciphers") were extensively studied in recent years as an abstraction of commonly used block ciphers. A large amount of previous works on iterated EM concentrated on security in an information-theoretic model. A central question studied in these papers is: What is the ...
Keywords: Backdoors in cryptography, Cryptanalysis, Key recovery attacks, $${\hbox {AES}^{2}}$$AES2 block cipher, Iterated Even---Mansour, LED block cipher

4
New Second-Preimage Attacks on Hash Functions
Elena Andreeva, Charles Bouillaguet, Orr Dunkelman, Pierre-Alain Fouque, Jonathan Hoch, John Kelsey, Adi Shamir, Sébastien Zimmer
September 2016 Journal of Cryptology: Volume 29 Issue 4, October 2016
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

In this work, we present several new generic second-preimage attacks on hash functions. Our first attack is based on the herding attack and applies to various Merkle---Damgård-based iterative hash functions. Compared to the previously known long-message second-preimage attacks, our attack offers more flexibility in choosing the second-preimage message at the ...
Keywords: Cryptanalysis, Dithering sequence, Hash function, Kite Generator, Second-preimage attack, Herding attack

5 published by ACM
Physical key extraction attacks on PCs
Daniel Genkin, Lev Pachmanov, Itamar Pipman, Adi Shamir, Eran Tromer
May 2016 Communications of the ACM: Volume 59 Issue 6, June 2016
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 110,   Downloads (12 Months): 47,614,   Downloads (Overall): 47,614

Full text available: HtmlHtml  PDFPDF
Computers broadcast their secrets via inadvertent physical emanations that are easily measured and exploited.

6
Reflections on slide with a twist attacks
Itai Dinur, Orr Dunkelman, Nathan Keller, Adi Shamir
November 2015 Designs, Codes and Cryptography: Volume 77 Issue 2-3, December 2015
Publisher: Kluwer Academic Publishers
Bibliometrics:
Citation Count: 0

Slide attacks use pairs of encryption operations which are slid against each other. Slide with a twist attacks are more sophisticated variants of slide attacks which slide an encryption operation against a decryption operation. Designed by Biryukov and Wagner in 2000, these attacks were used against several cryptosystems, including DESX, ...
Keywords: 94A60, Cryptanalysis, GOST (block cipher ), Random Involutions, 68P25, DESX, Even---Mansour scheme, Slide with a twist, Feistel structures, Fixed points, Reflection attack

7
Almost universal forgery attacks on AES-based MAC's
Orr Dunkelman, Nathan Keller, Adi Shamir
August 2015 Designs, Codes and Cryptography: Volume 76 Issue 3, September 2015
Publisher: Kluwer Academic Publishers
Bibliometrics:
Citation Count: 0

A message authentication code (MAC) computes for each (arbitrarily long) message $$m$$m and key $$k$$k a short authentication tag which is hard to forge when $$k$$k is unknown. One of the most popular ways to process $$m$$m in such a scheme is to use some variant of AES in CBC ...
Keywords: ALRED, Almost Universal Forgery, Message authentication codes, Pelican, 94A60, 68P25

8
Improved Top-Down Techniques in Differential Cryptanalysis
Itai Dinur, Orr Dunkelman, Masha Gutman, Adi Shamir
August 2015 Proceedings of the 4th International Conference on Progress in Cryptology -- LATINCRYPT 2015 - Volume 9230
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

The fundamental problem of differential cryptanalysis is to find the highest entries in the Difference Distribution Table DDT of a given mapping F over n-bit values, and in particular to find the highest diagonal entries which correspond to the best iterative characteristics of F. The standard bottom-up approach to this ...
Keywords: Difference distribution tables, Differential cryptanalysis, Iterative characteristics, SIMON

9
Improved Single-Key Attacks on 8-Round AES-192 and AES-256
Orr Dunkelman, Nathan Keller, Adi Shamir
June 2015 Journal of Cryptology: Volume 28 Issue 3, July 2015
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 2

AES is the most widely used block cipher today, and its security is one of the most important issues in cryptanalysis. After 13 years of analysis, related-key attacks were recently found against two of its flavors (AES-192 and AES-256). However, such a strong type of attack is not universally accepted ...
Keywords: Cryptanalysis, Differential enumeration, Multiset tabulation, Single-key attacks, AES, Key bridging

10
New Attacks on IDEA with at Least 6 Rounds
Eli Biham, Orr Dunkelman, Nathan Keller, Adi Shamir
March 2015 Journal of Cryptology: Volume 28 Issue 2, April 2015
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

IDEA is a 64-bit block cipher with 128-bit keys which was introduced by Lai and Massey in 1991. The best previously published attack on IDEA could only handle 6 of its 8.5-rounds. In this paper, we combine a highly optimized meet-in-the-middle attack with a keyless version of the Biryukov---Demirci relation ...
Keywords: IDEA, Biryukov---Demirci relation, Cryptanalysis, Zero-in-the-Middle attack

11
Orr Dunkelman, Nathan Keller, Adi Shamir
December 2014 Journal of Cryptology: Volume 28 Issue 1, January 2015
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 1

The Even---Mansour cryptosystem was developed in 1991 in an attempt to obtain the simplest possible block cipher, using only one publicly known random permutation and two whitening keys. Its exact security remained open for more than 20 years in the sense that the lower bound proof considered known plaintexts, whereas ...
Keywords: Even---Mansour block cipher, Single-key Even---Mansour, Slide attack, Whitening keys, Provable security, Slidex attack, Tight security bounds

12
A Practical-Time Related-Key Attack on the KASUMI Cryptosystem Used in GSM and 3G Telephony
Orr Dunkelman, Nathan Keller, Adi Shamir
September 2014 Journal of Cryptology: Volume 27 Issue 4, October 2014
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

Over the last 20 years, the privacy of most GSM phone conversations was protected by the A5/1 and A5/2 stream ciphers, which were repeatedly shown to be cryptographically weak. They are being replaced now by the new A5/3 and A5/4 algorithms, which are based on the block cipher KASUMI. In ...
Keywords: KASUMI, Boomerang attack, GSM/3G security, Related-key, Sandwich attack

13 published by ACM
Dissection: a new paradigm for solving bicomposite search problems
Itai Dinur, Orr Dunkelman, Nathan Keller, Adi Shamir
September 2014 Communications of the ACM: Volume 57 Issue 10, October 2014
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 10,   Downloads (12 Months): 100,   Downloads (Overall): 746

Full text available: HtmlHtml  PDFPDF  PDF Chinese translationPDF Chinese translation
Combinatorial search problems are usually described by a collection of possible states, a list of possible actions which map each current state into some next state, and a pair of initial and final states. The algorithmic problem is to find a sequence of actions which maps the given initial state ...

14
Improved Practical Attacks on Round-Reduced Keccak
Itai Dinur, Orr Dunkelman, Adi Shamir
March 2014 Journal of Cryptology: Volume 27 Issue 2, April 2014
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

The Keccak hash function is the winner of NIST's SHA-3 competition, and so far it showed remarkable resistance against practical collision finding attacks: After several years of cryptanalysis and a lot of effort, the largest number of Keccak rounds for which actual collisions were found was only 2. In this ...
Keywords: Near-collision, Collision, Practical attack, SHA-3, Cryptanalysis, Keccak

15
Key Recovery Attacks on 3-round Even-Mansour, 8-step LED-128, and Full AES2
Itai Dinur, Orr Dunkelman, Nathan Keller, Adi Shamir
November 2013 Part I of the Proceedings of the 19th International Conference on Advances in Cryptology - ASIACRYPT 2013 - Volume 8269
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 3

The Even-Mansour EM encryption scheme received a lot of attention in the last couple of years due to its exceptional simplicity and tight security proofs. The original 1-round construction was naturally generalized into r -round structures with one key, two alternating keys, and completely independent keys. In this paper we ...
Keywords: LED encryption scheme, Cryptanalysis, AES2 encryption scheme, iterated Even-Mansour, key recovery attacks

16
Itai Dinur, Adi Shamir
November 2012 Cryptography and Communications: Volume 4 Issue 3-4, December 2012
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 2

Cube attacks were introduced in Dinur and Shamir (2009) as a cryptanalytic technique that requires only black box access to the underlying cryptosystem. The attack exploits the existence of low degree polynomial representation of a single output bit (as a function of the key and plaintext bits) in order to ...
Keywords: Algebraic attacks, Cryptanalysis, Robust cube attacks, Cube attacks, Stream ciphers

17
Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems
Itai Dinur, Orr Dunkelman, Nathan Keller, Adi Shamir
August 2012 Proceedings of the 32nd Annual Cryptology Conference on Advances in Cryptology --- CRYPTO 2012 - Volume 7417
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

In this paper we show that a large class of diverse problems have a bicomposite structure which makes it possible to solve them with a new type of algorithm called dissection, which has much better time/memory tradeoffs than previously known algorithms. A typical example is the problem of finding the ...
Keywords: multi-encryption, Cryptanalysis, bicomposite, dissection, rebound, knapsacks, TM-tradeoff

18
Minimalism in cryptography: the even-mansour scheme revisited
Orr Dunkelman, Nathan Keller, Adi Shamir
April 2012 EUROCRYPT'12: Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 14

In this paper we consider the following fundamental problem: What is the simplest possible construction of a block cipher which is provably secure in some formal sense? This problem motivated Even and Mansour to develop their scheme in 1991, but its exact security remained open for more than 20 years ...
Keywords: minimalism, provable security, whitening keys, even-mansour block cipher, tight security bounds, slide attacks, slidex attack

19
New attacks on keccak-224 and keccak-256
Itai Dinur, Orr Dunkelman, Adi Shamir
March 2012 FSE'12: Proceedings of the 19th international conference on Fast Software Encryption
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 3

The Keccak hash function is one of the five finalists in NIST's SHA-3 competition, and so far it showed remarkable resistance against practical collision finding attacks: After several years of cryptanalysis and a lot of effort, the largest number of Keccak rounds for which actual collisions were found was only ...
Keywords: collision, near-collision, SHA-3, cryptanalysis, practical attack, Keccak

20
Improved attacks on full GOST
Itai Dinur, Orr Dunkelman, Adi Shamir
March 2012 FSE'12: Proceedings of the 19th international conference on Fast Software Encryption
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 11

GOST is a well known block cipher which was developed in the Soviet Union during the 1970's as an alternative to the US-developed DES. In spite of considerable cryptanalytic effort, until very recently there were no published single key attacks against its full 32-round version which were faster than the ...
Keywords: 2D meet in the middle attack, cryptanalysis, reflection property, block cipher, fixed point property, GOST



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2017 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us