Results 11  20
of
364
FPGA's as Cryptanalytic Tools
, 2002
"... This paper presents FPGA implementations of two cryptanalytic attacks against DES. Linear cryptanalysis results from Matsui's work [2] but could not be applied as such and had to be modified to face hardware constraints. We broke a key in about 14 hours on one single FPGA, becoming the fastest ..."
Abstract
 Add to MetaCart
This paper presents FPGA implementations of two cryptanalytic attacks against DES. Linear cryptanalysis results from Matsui's work [2] but could not be applied as such and had to be modified to face hardware constraints. We broke a key in about 14 hours on one single FPGA, becoming the fastest
A Cryptanalytic TimeMemory Tradeoff
 First FPGA Implementation, in the proceedings of FPL 2002, Lecture Notes in Computer Sciences, vol 2438, pp 780789
, 2002
"... Many searching problems allow timememory tradeoffs. That is, if there are K possible solutions to search over, the timememory tradeoff allows the solution to be found with high probability, in T operations (time) with M words of memory, provided the timememory product T ×M is larger than K. Crypt ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
. Cryptanalytic attacks based on exhaustive key search are the typical context where timememory tradeoffs are applicable. Due to large key sizes, exhaustive key search usually needs unrealistic computing powers and corresponds to a situation where T = K and M = 1. However, if the same attack has to be carried
Cryptanalytic Time/Memory/Data Tradeoffs for Stream Ciphers
, 1976
"... Abstract. In 1980 Hellman introduced a general technique for breaking arbitrary block ciphers with N possible keys in time T and memory M related by the tradeoff curve TM 2 = N 2 for 1 ≤ T ≤ N. Recently, Babbage and Golic pointed out that a different TM = N tradeoff attack for 1 ≤ T ≤ D is applicabl ..."
Abstract

Cited by 116 (6 self)
 Add to MetaCart
Abstract. In 1980 Hellman introduced a general technique for breaking arbitrary block ciphers with N possible keys in time T and memory M related by the tradeoff curve TM 2 = N 2 for 1 ≤ T ≤ N. Recently, Babbage and Golic pointed out that a different TM = N tradeoff attack for 1 ≤ T ≤ D
New Cryptanalytic Results on IDEA
 of Lecture Notes in Computer Science
, 2006
"... Abstract. IDEA is a 64bit block cipher with 128bit keys introduced by Lai and Massey in 1991. IDEA is one of the most widely used block ciphers, due to its inclusion in several cryptographic packages, such as PGP and SSH. The cryptographic strength of IDEA relies on a combination of three incompat ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
incompatible group operations – XOR, addition and modular multiplication. Since its introduction in 1991, IDEA has withstood extensive cryptanalytic effort, but no attack was found on the full variant of the cipher. In this paper we present the first known nontrivial relation that involves all the three
Vectorial Boolean Functions and Induced Algebraic Equations
, 2004
"... A general mathematical framework behind algebraic cryptanalytic attacks is developed. The framework ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
A general mathematical framework behind algebraic cryptanalytic attacks is developed. The framework
Cryptanalytic link and application to Skipjack
, 2001
"... Abstract. This paper shows a surprising similarity between the construction of, respectively, impossible differentials and square distinguishers. This observation is illustrated by comparing two attacks on IDEA (Biham & al., FSE’99 [2], Nakahara & al., 2001 [7]). Using this similarity, we al ..."
Abstract
 Add to MetaCart
Abstract. This paper shows a surprising similarity between the construction of, respectively, impossible differentials and square distinguishers. This observation is illustrated by comparing two attacks on IDEA (Biham & al., FSE’99 [2], Nakahara & al., 2001 [7]). Using this similarity, we
Differential Fault Analysis of Secret Key Cryptosystems
, 1997
"... In September 1996 Boneh, Demillo, and Lipton from Bellcore announced a new type of cryptanalytic attack which exploits computational errors to find cryptographic keys. Their attack is based on algebraic properties of modular arithmetic, and thus it is applicable only to public key cryptosystems suc ..."
Abstract

Cited by 315 (3 self)
 Add to MetaCart
In September 1996 Boneh, Demillo, and Lipton from Bellcore announced a new type of cryptanalytic attack which exploits computational errors to find cryptographic keys. Their attack is based on algebraic properties of modular arithmetic, and thus it is applicable only to public key cryptosystems
Making a Faster Cryptanalytic TimeMemory TradeOff
"... In 1980 Martin Hellman described a cryptanalytic timememory tradeoff which reduces the time of cryptanalysis by using precalculated data stored in memory. This technique was improved by Rivest before 1982 with the introduction of distinguished points which drastically reduces the number of memor ..."
Abstract

Cited by 103 (1 self)
 Add to MetaCart
In 1980 Martin Hellman described a cryptanalytic timememory tradeoff which reduces the time of cryptanalysis by using precalculated data stored in memory. This technique was improved by Rivest before 1982 with the introduction of distinguished points which drastically reduces the number
Theoretical Use of Cache Memory as a Cryptanalytic SideChannel
, 2002
"... We expand on the idea, proposed by Kelsey et al. [14], of cache memory being used as a sidechannel which leaks information during the run of a cryptographic algorithm. By using this sidechannel, an attacker may be able to reveal or narrow the possible values of secret information held on the ta ..."
Abstract

Cited by 78 (1 self)
 Add to MetaCart
We expand on the idea, proposed by Kelsey et al. [14], of cache memory being used as a sidechannel which leaks information during the run of a cryptographic algorithm. By using this sidechannel, an attacker may be able to reveal or narrow the possible values of secret information held
A Modification Of A Broken PublicKey Cipher
 Advances in Cryptology—CRYPTO ’86 Proceedings
, 1987
"... A possible publickey cipher is described and its security against various cryptanalytic attacks is considered. ..."
Abstract
 Add to MetaCart
A possible publickey cipher is described and its security against various cryptanalytic attacks is considered.
Results 11  20
of
364