Results 171 to 180 of about 458 (184)
Some of the next articles are maybe not open access.

Cryptanalysis of Spent with Systems of Algebraic Equations

2008 International Conference on Computer Science and Software Engineering, 2008
Serpent is a block cipher which was suggested as a candidate for the advanced encryption standard (AES). Several recently proposed ciphers are built with layers of small S-boxes, interconnected by linear key-dependent layers. In this paper we study the security of such ciphers under an additional hypothesis: the S-box can be described by an over ...
Han Haiqing, Hu Zhihua, Qin Zhongping
openaire   +2 more sources

Impossible Differential-Algebraic Cryptanalysis of Serpent

2009 International Conference on Multimedia Information Networking and Security, 2009
Serpent is an SP Network block cipher submitted to the AES competition and chosen as one of its five finalists. The security of Serpent is widely acknowledged, especially as the best known attack so far is a differential-linear attack on only 11 rounds out of the 32 rounds of the cipher.
Zhongping Qin, Haiqing Han, Zhihua Hu
openaire   +2 more sources

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

Algebraic Cryptanalysis of CTRU Cryptosystem

2008
CTRU, a public key cryptosystem was proposed by Gaborit, Ohler and Sole. It is analogue of NTRU, the ring of integers replaced by the ring of polynomials $\mathbb{F}_2[T]$. It attracted attention as the attacks based on either LLL algorithm or the Chinese Remainder Theorem are avoided on it, which is most common on NTRU.
openaire   +2 more sources

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.
Xiaojuan Lu, Meicheng Liu, Dongdai Lin
openaire   +2 more sources

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   +2 more sources

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   +2 more sources

Practical Algebraic Cryptanalysis for Dragon-Based Cryptosystems [PDF]

open access: possible, 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
Jintai Ding   +4 more
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   +2 more
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   +2 more sources

Home - About - Disclaimer - Privacy