Results 171 to 180 of about 6,665 (199)

Review ofAlgebraic Cryptanalysis

Cryptologia, 2010
Bard, Gregory V., Algebraic Cryptanalysis, 2009, Springer-Verlag, New York, 356 pages, $129.00, hardcover. In his 1941 address to the American Mathematical Society, A. A. Albert [2, p.
openaire   +1 more source

Differential-Linear Cryptanalysis from an Algebraic Perspective

2021
The differential-linear cryptanalysis is an important cryptanalytic tool in cryptography, and has been extensively researched since its discovery by Langford and Hellman in 1994. There are nevertheless very few methods to study the middle part where the differential and linear trail connect.
Meicheng Liu, Xiaojuan Lu, Dongdai Lin
openaire   +1 more source

Algebraic Cryptanalysis of A NLFSR Based Stream Cipher

2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications, 2008
Among recent developments on stream ciphers, the algebraic attack has gained much attention. In this paper we concentrate on algebraic cryptanalysis of Grain, a non-linear feedback shift register (NLFSR) based stream cipher. The target here is to analyze generic key generating structure of Grain, that is why, we aim to recover the internal states of ...
Mehreen Afzal, Ashraf Masood
openaire   +1 more source

Block Ciphers: Algebraic Cryptanalysis and Gröbner Bases

2009
Block ciphers are one of the most important classes of cryptographic algorithms in current use. Commonly used to provide confidentiality for transmission and storage of information, they encrypt and decrypt blocks of data according to a secret key.
Carlos Cid, Ralf-Philipp Weinmann
openaire   +1 more source

Algebraic-Differential Cryptanalysis of DES

2009
Algebraic cryptanalysis is as a general framework that permits to assess the security of a wide range of cryptographic schemes. However, the feasibility of algebraic cryptanalysis against block ciphers remains the source of speculation and especially in targeting modern block ciphers.
Faugère, Jean-Charles, Perret, Ludovic, Spaenlehauer, Pierre-Jean   +2 more
openaire   +1 more source

Algebraic Cryptanalysis of the Data Encryption Standard

2007
In spite of growing importance of the Advanced Encryption Standard (AES), the Data Encryption Standard (DES) is by no means obsolete. DES has never been broken from the practical point of view. The variant "triple DES" is believed very secure, is widely used, especially in the financial sector, and should remain so for many many years to come.
Nicolas T. Courtois, Gregory V. Bard
openaire   +1 more source

Algebraic Methods in Block Cipher Cryptanalysis

2009
This thesis is a contribution to the field of algebraic cryptanalysis. Specifically the following topics have been studied: We construct and analyze Feistel and SLN ciphers that have a sound design strategy against linear and differential cryptanalysis. The encryption process for these cipher can be described by very simple polynomial equations.
openaire   +1 more source

Practical Algebraic Cryptanalysis for Dragon-Based Cryptosystems

2010
Recently, the Little Dragon Two and Poly-Dragon multivariate based public-key cryptosystems were proposed as efficient and secure schemes. In particular, the inventors of the two schemes claim that Little Dragon Two and Poly-Dragon resist algebraic cryptanalysis. In this paper, we show that MXL2, an algebraic attack method based on the XL algorithm and
Johannes Buchmann, Stanislav Bulygin, Jintai Ding, Wael Said Abd Elmageed Mohamed, Fabian Werner   +4 more
openaire   +1 more source

Algebraic Cryptanalysis of Curry and Flurry Using Correlated Messages

2010
In this paper, we present an algebraic attack against the Flurry and Curry block ciphers [12,13]. Usually, algebraic attacks against block ciphers only require one message/ciphertext pair to be mounted. In this paper, we investigate a different approach.
Faugère, Jean-Charles, Perret, Ludovic
openaire   +1 more source

Towards Algebraic Cryptanalysis of HFE Challenge 2

2011
In this paper, we present an experimental analysis of HFE Challenge 2 (144 bit) type systems. We generate scaled versions of the full challenge fixing and guessing some unknowns. We use the MXL3 algorithm, an efficient algorithm for computing Grobner basis, to solve these scaled versions.
Mohamed Saied Emam Mohamed, Jintai Ding, Johannes Buchmann   +2 more
openaire   +1 more source