Linear (Hull) and Algebraic Cryptanalysis of the Block Cipher PRESENT

Nakahara, Jorge; Sepehrdad, Pouyan; Zhang, Bingsheng; Wang, Meiqin

doi:10.1007/978-3-642-10433-6_5

Cited by 51 publications

(31 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The best published differential attacks are for 16 rounds of Present-80 [30] and 17 (and possibly up to 19) rounds [1] for Present-128. Results on linear cryptanalysis for up to 26 rounds are available in [12,26]. Bit-pattern based integral attacks [31] are successful up to seven rounds of Present.…”

Section: Block Ciphersmentioning

confidence: 99%

Algebraic Precomputations in Differential and Integral Cryptanalysis

Albrecht

Cid

Dullien

et al. 2011

Information Security and Cryptology

View full text Add to dashboard Cite

Abstract. Algebraic cryptanalysis is a general tool which permits one to assess the security of a wide range of cryptographic schemes. Algebraic techniques have been successfully applied against a number of multivariate schemes and stream ciphers. Yet, their feasibility against block ciphers remains the source of much speculation. In this context, algebraic techniques have mainly been deployed in order to solve a system of equations arising from the cipher, so far with limited success. In this work we propose a different approach: to use Gröbner basis techniques to compute structural features of block ciphers, which may then be used to improve "classical" differential and integral attacks. We illustrate our techniques against the block ciphers Present and Ktantan32.

show abstract

Section: Block Ciphersmentioning

confidence: 99%

Algebraic Precomputations in Differential and Integral Cryptanalysis

Albrecht

Cid

Dullien

et al. 2011

Information Security and Cryptology

View full text Add to dashboard Cite

show abstract

“…Its original structure has attracted the attention of the community, and a large number of results on reduced versions have been published [38,16,39,35,2,34,17,27,32,5]. All these attacks need a large number of plaintext-ciphertext pairs, which in most cases reaches the full codebook.…”

Section: Brief Description Of Presentmentioning

confidence: 99%

Sieve-in-the-Middle: Improved MITM Attacks

Canteaut

Naya-Plasencia

Vayssière

2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. This paper presents a new generic technique, named sieve-in-the-middle, which improves meet-in-the-middle attacks in the sense that it provides an attack on a higher number of rounds. Instead of selecting the key candidates by searching for a collision in an intermediate state which can be computed forwards and backwards, we here look for the existence of valid transitions through some middle sbox. Combining this technique with short bicliques allows to freely add one or two more rounds with the same time complexity. Moreover, when the key size of the cipher is larger than its block size, we show how to build the bicliques by an improved technique which does not require any additional data (on the contrary to previous biclique attacks). These techniques apply to PRESENT, DES, PRINCE and AES, improving the previously known results on these four ciphers. In particular, our attack on PRINCE applies to 8 rounds (out of 12), instead of 6 in the previous cryptanalyses. Some results are also given for theoretically estimating the sieving probability provided by some subsets of the input and output bits of a given sbox.

show abstract

“…Security PRESENT has attracted a lot of cryptanalytic attention because of very particular linear biases. The papers [42,12,13,36] study the linear behavior of PRESENT regarding multiple linear trails. This kind of cryptanalysis allows to mount multi-linear attacks on up to 27 rounds of PRESENT but using all the codebook.…”

Section: Desl and Desxl Desl And Desxl Are Two Lightweight Variants Omentioning

confidence: 99%

Survey and Benchmark of Lightweight Block Ciphers for Wireless Sensor Networks

Cazorla

Marquet

Minier

2013

Proceedings of the 10th International Conference on Security and Cryptography

View full text Add to dashboard Cite

Abstract. For security applications in wireless sensor networks (WSNs), choosing best algorithms in terms of energy-efficiency and of small memory requirements is a real challenge because the sensor networks must be autonomous. In [17,35], the authors have benchmarked on a dedicated platform some block-ciphers and have deduced the best candidates to use in the context of small embedded platforms. This article proposes to study on a dedicated platform of sensors most of the recent lightweight block ciphers as well as some conventional block ciphers. First, we describe the design of the chosen block ciphers with a security summary and we then present some implementation tests performed on our platform.

show abstract

Linear (Hull) and Algebraic Cryptanalysis of the Block Cipher PRESENT

Cited by 51 publications

References 25 publications

Algebraic Precomputations in Differential and Integral Cryptanalysis

Algebraic Precomputations in Differential and Integral Cryptanalysis

Sieve-in-the-Middle: Improved MITM Attacks

Survey and Benchmark of Lightweight Block Ciphers for Wireless Sensor Networks

Contact Info

Product

Resources

About