Results 1  10
of
17
Dragon: A fast word based stream cipher
 Proc. ICISC 2004, volume 3506 of LNCS
, 2005
"... This is the author’s version of a work that was submitted/accepted for publication in the following source: ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
This is the author’s version of a work that was submitted/accepted for publication in the following source:
A chosen IV attack against Turing
 In Selected Areas in Cryptography, volume LNCS 3006
, 2003
"... Abstract. In this paper, we show that the key scheduling algorithm of the recently proposed stream cipher Turing suffers from important flaws. These weaknesses allow an attacker that chooses the initialization vector (IV) to recover some partial information about the secret key. In particular, when ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
(Show Context)
Abstract. In this paper, we show that the key scheduling algorithm of the recently proposed stream cipher Turing suffers from important flaws. These weaknesses allow an attacker that chooses the initialization vector (IV) to recover some partial information about the secret key. In particular, when using Turing with a 256bit secret key and a 128bit IV, we present an attack that requires the ability to choose 237 IV and then recovers the key with complexity 272, requiring 236 bytes of memory. 1
Attack the Dragon
 Progress in Cryptology  INDOCRYPT 2005, Lecture Notes in Computer Science
, 2005
"... Dragon is a word oriented stream cipher submitted to the ECRYPT project, it operates on key sizes of 128 and 256 bits. The original idea of the design is to use a nonlinear feedback shift register (NLFSR) and a linear part (counter), combined by a filter function to generate a new state of the NL ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Dragon is a word oriented stream cipher submitted to the ECRYPT project, it operates on key sizes of 128 and 256 bits. The original idea of the design is to use a nonlinear feedback shift register (NLFSR) and a linear part (counter), combined by a filter function to generate a new state of the NLFSR and produce the keystream. The internal state of the cipher is 1088 bits, i.e., any kinds of TMD attacks are not applicable. In this paper we present two statistical distinguishers that distinguish Dragon from a random source both requiring around O(2 ) words of the keystream. In the first scenario the time complexity is around O(2 ) with the memory complexity O(2 ), whereas the second scenario needs only O(2 ) of time, but O(2 ) of memory. The attack is based on a statistical weakness introduced into the keystream by the filter function F . This is the first paper presenting an attack on Dragon, and it shows that the cipher does not provide full security when the key of size 256 bits is used.
High Efficiency Feedback Shift Register: σ−LFSR ⋆
"... Abstract. We introduce a new kind of wordoriented linear feedback shift register called σ−LFSR which is constructed with the instructions of the modern processor and have fast software implementation. We offer an algorithm to search for good primitive σ−LFSR. In particular, we give two examples HHZ ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
(Show Context)
Abstract. We introduce a new kind of wordoriented linear feedback shift register called σ−LFSR which is constructed with the instructions of the modern processor and have fast software implementation. We offer an algorithm to search for good primitive σ−LFSR. In particular, we give two examples HHZ1 and HHZ2 and compare their efficiency and security with those of the LFSRs appearing in stream ciphers such as SNOW, SOBER and Turing. Our results show that replacing the LFSRs in SNOW, SOBER and Turing with HHZ1 will improve security and the efficiency of fast software implementation.
The ANF of the Composition of Addition and Multiplication mod 2 n with a Boolean Function
"... Abstract. Compact formulas are derived to represent the Algebraic Normal Form (ANF) of f(x + a mod 2 n) and f(x × a mod 2 n) from and a is a constant the ANF of f, where f is a Boolean function on F n 2 of F n 2. We compare the algebraic degree of the composed functions with the algebraic degree of ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Abstract. Compact formulas are derived to represent the Algebraic Normal Form (ANF) of f(x + a mod 2 n) and f(x × a mod 2 n) from and a is a constant the ANF of f, where f is a Boolean function on F n 2 of F n 2. We compare the algebraic degree of the composed functions with the algebraic degree of the original function f. As an application, the formula for addition modulo 2 n is applied in an algebraic attack on the summation generator and the E0 encryption scheme in the Bluetooth keystream generator. 1
Nofish: A new stream cipher
"... The purpose of this paper is to provide a description of the Nofish cryptographic algorithm. This paper is intended to release the algorithm to the cryptographic community, for its future analysis and possible use. The name of the algorithm comes in respect to other wellknown secure crypto algorith ..."
Abstract
 Add to MetaCart
(Show Context)
The purpose of this paper is to provide a description of the Nofish cryptographic algorithm. This paper is intended to release the algorithm to the cryptographic community, for its future analysis and possible use. The name of the algorithm comes in respect to other wellknown secure crypto algorithms like Blowfish and Twofish and since this one has not gained this status, I call it Nofish. 1. Algorithm description The proposed algorithm is a synchronous stream cipher, more precisely a binary additive stream cipher because it using the XOR function to encrypt the plaintext. The design is based on HENKOS stream cipher
2.1.2 Usage and threat model................................................................................................................... 4
"... ..."
(Show Context)
1 Table of Contents
"... 1 Justification..............................................................................................................................................................3 ..."
Abstract
 Add to MetaCart
(Show Context)
1 Justification..............................................................................................................................................................3