Results 191 to 200 of about 9,806 (225)
Some of the next articles are maybe not open access.
2008
The stream cipher Rabbit is one candidate to the ECRYPT Stream Cipher Project (eSTREAM) on the third evaluation phase. It has a 128-bit key, 64-bit IV and 513-bit internal state. Currently, only one paper [1] studied it besides a series of white papers by the authors of Rabbit.
Yi Lu 0002, Huaxiong Wang, San Ling
openaire +1 more source
The stream cipher Rabbit is one candidate to the ECRYPT Stream Cipher Project (eSTREAM) on the third evaluation phase. It has a 128-bit key, 64-bit IV and 513-bit internal state. Currently, only one paper [1] studied it besides a series of white papers by the authors of Rabbit.
Yi Lu 0002, Huaxiong Wang, San Ling
openaire +1 more source
Cryptologia, 1978
We are interested in printing accounts of readers who have taught, or who are teaching, courses concerning cryptology. This means all courses, short, long, high-powered, low level, formal, informal, credit, no credit, graduate school, elementary school, etc.
openaire +1 more source
We are interested in printing accounts of readers who have taught, or who are teaching, courses concerning cryptology. This means all courses, short, long, high-powered, low level, formal, informal, credit, no credit, graduate school, elementary school, etc.
openaire +1 more source
2020
We report on the concrete cryptanalysis of LEDAcrypt, a 2nd Round candidate in NIST’s Post-Quantum Cryptography standardization process and one of 17 encryption schemes that remain as candidates for near-term standardization. LEDAcrypt consists of a public-key encryption scheme built from the McEliece paradigm and a key-encapsulation mechanism (KEM ...
Daniel Apon +3 more
openaire +2 more sources
We report on the concrete cryptanalysis of LEDAcrypt, a 2nd Round candidate in NIST’s Post-Quantum Cryptography standardization process and one of 17 encryption schemes that remain as candidates for near-term standardization. LEDAcrypt consists of a public-key encryption scheme built from the McEliece paradigm and a key-encapsulation mechanism (KEM ...
Daniel Apon +3 more
openaire +2 more sources
2015
In this article, we analyse the security of the authenticated encryption mode JAMBU, a submission to the CAESAR competition that remains currently unbroken. We show that the security claims of this candidate regarding its nonce-misuse resistance can be broken.
Thomas Peyrin +3 more
openaire +2 more sources
In this article, we analyse the security of the authenticated encryption mode JAMBU, a submission to the CAESAR competition that remains currently unbroken. We show that the security claims of this candidate regarding its nonce-misuse resistance can be broken.
Thomas Peyrin +3 more
openaire +2 more sources
2006
Rainbow is a fast asymmetric multivariate signature algorithm proposed by J. Ding and D. Schmidt in [5]. This paper presents a cryptanalysis of Rainbow which enables an attacker provided with the public key to recover an equivalent representation of the secret key, thus allowing her to efficiently forge a signature of any message.
Olivier Billet, Henri Gilbert
openaire +1 more source
Rainbow is a fast asymmetric multivariate signature algorithm proposed by J. Ding and D. Schmidt in [5]. This paper presents a cryptanalysis of Rainbow which enables an attacker provided with the public key to recover an equivalent representation of the secret key, thus allowing her to efficiently forge a signature of any message.
Olivier Billet, Henri Gilbert
openaire +1 more source
Journal of Cryptology, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lars R. Knudsen +3 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lars R. Knudsen +3 more
openaire +2 more sources
An Introduction to Cryptanalysis
AT&T Technical Journal, 1994Cryptanalysis is defined as the process of attempting to find a shortcut method, not envisioned by the designer, for decrypting an enciphered message when the key used to encrypt the message is not known. As an example, this paper cryptanalyzes a simple substitution cipher.
openaire +1 more source
Cryptologia, 2014
Abstract Rotor cipher machines played a large role in World War II: Germany used Enigma; America created Sigaba; Britain developed Typex. The breaking of Enigma by Polish and (later) British cryptanalysts had an enormous impact on the war. However, despite being based on the commercial version of the Enigma, there is no documented successful attack on ...
Kelly Chang +2 more
openaire +1 more source
Abstract Rotor cipher machines played a large role in World War II: Germany used Enigma; America created Sigaba; Britain developed Typex. The breaking of Enigma by Polish and (later) British cryptanalysts had an enormous impact on the war. However, despite being based on the commercial version of the Enigma, there is no documented successful attack on ...
Kelly Chang +2 more
openaire +1 more source
2009
CTC is a toy cipher designed in order to assess the strength of algebraic attacks. While the structure of CTC is deliberately weak with respect to algebraic attacks, it was claimed by the designers that CTC is secure with respect to statistical attacks, such as differential and linear cryptanalysis.
Orr Dunkelman, Nathan Keller
openaire +1 more source
CTC is a toy cipher designed in order to assess the strength of algebraic attacks. While the structure of CTC is deliberately weak with respect to algebraic attacks, it was claimed by the designers that CTC is secure with respect to statistical attacks, such as differential and linear cryptanalysis.
Orr Dunkelman, Nathan Keller
openaire +1 more source
2009
CubeHash is a family of hash functions submitted by Bernstein as a SHA-3 candidate. In this paper, we provide two different cryptanalysis approaches concerning its collision resistance. Thanks to the first approach, related to truncated differentials, we computed a collision for the CubeHash -1/36 hash function, i.e.
Eric Brier, Thomas Peyrin
openaire +1 more source
CubeHash is a family of hash functions submitted by Bernstein as a SHA-3 candidate. In this paper, we provide two different cryptanalysis approaches concerning its collision resistance. Thanks to the first approach, related to truncated differentials, we computed a collision for the CubeHash -1/36 hash function, i.e.
Eric Brier, Thomas Peyrin
openaire +1 more source