49 search results - page 8 / 10 » Linear Cryptanalysis of Reduced-Round PRESENT |
EUROCRYPT
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. We present a new algorithm for upper bounding the maximum average linear hull probability for SPNs, a value required to determine provable security against linear cryptan...
FUIN
2010
13 years 6 months ago
2010
In this paper we present an application of the propositional SATisfiability environment to computing some simple orthogonal matrices and some interesting tasks in the area of cry...
FSE
2003
Springer
14 years 21 days ago
2003
Springer
We present our further observations on the structure of the AES algorithm relating to the cyclic properties of the functions used in this cipher. We note that the maximal period of...
ASIACRYPT
2001
Springer
13 years 11 months ago
2001
Springer
A Zero-knowledge protocol provides provably secure entity authentication based on a hard computational problem. Among many schemes proposed since 1984, the most practical rely on f...
FSE
1997
Springer
13 years 11 months ago
1997
Springer
In this paper we present a new 128-bit block cipher called Square. The original design of Square concentrates on the resistance against di erential and linear cryptanalysis. Howeve...