Author pages are created from data sourced from our academic publisher partnerships and public sources.
Share This Author
Biclique Cryptanalysis of the Full AES
This paper presents the novel technique of block cipher cryptanalysis with bicliques, which leads to the following results: the first key recovery method for the full AES-128 with computational complexity 2126.1.4 and key recovery methods with lower complexity for the reduced-round versions of AES not considered before.
Related-Key Cryptanalysis of the Full AES-192 and AES-256
This paper shows the first key recovery attack that works for all the keys and has 299.5 time and data complexity, while the recent attack by Biryukov-Khovratovich-Nikolic works for a weak key class and has much higher complexity.
Deanonymisation of Clients in Bitcoin P2P Network
This work presents an efficient method to deanonymize Bitcoin users, which allows to link user pseudonyms to the IP addresses where the transactions are generated and shows that a natural countermeasure of using Tor or other anonymity services can be cut-off by abusing anti-DoS countermeasures of the Bitcoin network.
Distinguisher and Related-Key Attack on the Full AES-256
A chosen-key distinguisher and a related-key attack on the full 256-bit key AES, showing that AES-256 can not model an ideal cipher in theoretical constructions.
Argon2: New Generation of Memory-Hard Functions for Password Hashing and Other Applications
- A. Biryukov, Daniel Dinu, D. Khovratovich
- Computer ScienceIEEE European Symposium on Security and Privacy…
- 21 March 2016
A new hash function Argon2 is presented, which is oriented at protection of low-entropy secrets without secret keys, which can provide ASIC-and botnet-resistance by filling the memory in 0.6 cycles per byte in the non-compressible way.
Triathlon of lightweight block ciphers for the Internet of things
- Daniel Dinu, Yann Le Corre, D. Khovratovich, Léo Perrin, Johann Großschädl, A. Biryukov
- Computer ScienceJournal of Cryptographic Engineering
- 14 July 2018
The benchmarking framework provides cipher designers with an easy-to-use tool to compare new algorithms with the state of the art and allows standardization organizations to conduct a fair and consistent evaluation of a large number of candidates.
Equihash: Asymmetric Proof-of-Work Based on the Generalized Birthday Problem
This paper shows how to construct an asymmetric proof-of-work (PoW) based on a computationally hard problem, which requires a lot of memory to generate a proof but is instant to verify, and introduces the new technique of algorithm binding to prevent cost amortization.
Cryptographic Schemes Based on the ASASA Structure: Black-Box, White-Box, and Public-Key (Extended Abstract)
- A. Biryukov, Charles Bouillaguet, D. Khovratovich
- Computer Science, MathematicsASIACRYPT
- 1 December 2014
This paper designs several encryption schemes based on the ASASA structure ranging from fast and generic symmetric ciphers to compact public key and white-box constructions based on generic affine transformations combined with specially designed low degree non-linear layers.
Key Recovery Attacks of Practical Complexity on AES Variants With Up To 10 Rounds
- A. Biryukov, O. Dunkelman, Nathan Keller, D. Khovratovich, A. Shamir
- Computer Science, MathematicsIACR Cryptol. ePrint Arch.
- 30 May 2010
This paper shows attacks on reduced-round variants of AES-256 with up to 10 rounds with complexity which is feasible, and increases the understanding of AES security, and focuses on attacks with practical complexity, i.e., attacks that can be experimentally verified.
Narrow-Bicliques: Cryptanalysis of Full IDEA
For the first time, an approach is described to noticeably speed-up key-recovery for the full 8.5 round IDEA and it is shown that the biclique approach to block cipher cryptanalysis not only obtains results on more rounds, but also improves time and data complexities over existing attacks.