Results 191 to 200 of about 14,013 (215)
Some of the next articles are maybe not open access.
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 +2 more sources
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 +2 more sources
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
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
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
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
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
2019
Forkciphers are a new kind of primitive proposed recently by Andreeva et al. for efficient encryption and authentication of small messages. They fork the middle state of a cipher and encrypt it twice under two smaller independent permutations. Thus, forkciphers produce two output blocks in one primitive call.
Subhadeep Banik +8 more
openaire +4 more sources
Forkciphers are a new kind of primitive proposed recently by Andreeva et al. for efficient encryption and authentication of small messages. They fork the middle state of a cipher and encrypt it twice under two smaller independent permutations. Thus, forkciphers produce two output blocks in one primitive call.
Subhadeep Banik +8 more
openaire +4 more sources
2015
Due to the recent emergence of resource-constrained devices, cryptographers are facing the problem of designing dedicated lightweight ciphers. KLEIN is one of the resulting primitives, proposed at RFIDSec in 2011 by Gong et al. This family of software-oriented block ciphers has an innovative structure, as it combines 4-bit Sboxes with the AES MixColumn
Lallemand, Virginie +1 more
openaire +2 more sources
Due to the recent emergence of resource-constrained devices, cryptographers are facing the problem of designing dedicated lightweight ciphers. KLEIN is one of the resulting primitives, proposed at RFIDSec in 2011 by Gong et al. This family of software-oriented block ciphers has an innovative structure, as it combines 4-bit Sboxes with the AES MixColumn
Lallemand, Virginie +1 more
openaire +2 more sources
2015
FIDES is a lightweight authenticated cipher, presented at CHES 2013. The cipher has two version, providing either 80-bit or 96-bit security. In this paper, we describe internal state-recovery attacks on both versions of FIDES, and show that once we recover the internal state, we can use it to immediately forge any message.
Dinur, Itai, Jean, Jérémy
openaire +4 more sources
FIDES is a lightweight authenticated cipher, presented at CHES 2013. The cipher has two version, providing either 80-bit or 96-bit security. In this paper, we describe internal state-recovery attacks on both versions of FIDES, and show that once we recover the internal state, we can use it to immediately forge any message.
Dinur, Itai, Jean, Jérémy
openaire +4 more sources
2015
We present a detailed security analysis of the CAESAR candidate Ascon. Amongst others, cube-like, differential and linear cryptanalysis are used to evaluate the security of Ascon. Our results are practical key-recovery attacks on round-reduced versions of Ascon-128, where the initialization is reduced to 5 out of 12 rounds.
Christoph Dobraunig +3 more
openaire +2 more sources
We present a detailed security analysis of the CAESAR candidate Ascon. Amongst others, cube-like, differential and linear cryptanalysis are used to evaluate the security of Ascon. Our results are practical key-recovery attacks on round-reduced versions of Ascon-128, where the initialization is reduced to 5 out of 12 rounds.
Christoph Dobraunig +3 more
openaire +2 more sources