Results 1  10
of
44
Fault Analysis of Stream Ciphers
 Chryptographic Hardware and Embedded Systems – CHES 2004, Lecture Notes in Computer Science
, 2004
"... Abstract. A fault attack is a powerful cryptanalytic tool which can be applied to many types of cryptosystems which are not vulnerable to direct attacks. The research literature contains many examples of fault attacks on public key cryptosystems and block ciphers, but surprisingly we could not find ..."
Abstract

Cited by 26 (0 self)
 Add to MetaCart
Abstract. A fault attack is a powerful cryptanalytic tool which can be applied to many types of cryptosystems which are not vulnerable to direct attacks. The research literature contains many examples of fault attacks on public key cryptosystems and block ciphers, but surprisingly we could not find any systematic study of the applicability of fault attacks to stream ciphers. Our goal in this paper is to develop general techniques which can be used to attack the standard constructions of stream ciphers based on LFSR’s, as well as more specialized techniques which can be used against specific stream ciphers such as RC4, LILI128 and SOBERt32. While most of the schemes can be successfully attacked, we point out several interesting open problems such as an attack on FSM filtered constructions and the analysis of high Hamming weight faults in LFSR’s. Keywords stream cipher, LFSR, fault attack, Lili128, SOBERt32, RC4
Fibonacci and Galois Representations of FeedbackWithCarry Shift Registers
 IEEE Trans. Inform. Theory
, 2002
"... A feedbackwithcarry shift register (FCSR) with "Fibonacci" architecture is a shift register provided with a small amount of memory which is used in the feedback algorithm. Like the linear feedback shift register (LFSR), the FCSR provides a simple and predictable method for the fast generation of p ..."
Abstract

Cited by 20 (2 self)
 Add to MetaCart
A feedbackwithcarry shift register (FCSR) with "Fibonacci" architecture is a shift register provided with a small amount of memory which is used in the feedback algorithm. Like the linear feedback shift register (LFSR), the FCSR provides a simple and predictable method for the fast generation of pseudorandom sequences with good statistical properties and large periods. In this paper, we describe and analyze an alternative architecture for the FCSR which is similar to the "Galois" architecture for the LFSR. The Galois architecture is more efficient than the Fibonacci architecture because the feedback computations are performed in parallel. We also describe the output sequences generated by theFCSR, a slight modification of the (Fibonacci) FCSR architecture in which the feedback bit is delayed for clock cycles before being returned to the first cell of the shift register. We explain how these devices may be configured so as to generate sequences with large periods. We show that the FCSR also admits a more efficient "Galois" architecture.
Pseudorandom number generation by padic ergodic transformations: an addendum

, 2004
"... The paper study counterdependent pseudorandom number generators based on mvariate (m> 1) ergodic mappings of the space of 2adic integers Z2. The sequence of internal states of these generators is defined by the recurrence law xi+1 = H B i (xi) mod 2 n, whereas their output sequence is zi = F B i ..."
Abstract

Cited by 14 (6 self)
 Add to MetaCart
The paper study counterdependent pseudorandom number generators based on mvariate (m> 1) ergodic mappings of the space of 2adic integers Z2. The sequence of internal states of these generators is defined by the recurrence law xi+1 = H B i (xi) mod 2 n, whereas their output sequence is zi = F B i (xi) mod 2 n; here xj, zj are mdimensional vectors over Z2. It is shown how the results obtained for a univariate case could be extended to a multivariate case.
Efficient MultiplyWithCarry Random Number Generators With Optimal Distribution Properties
 ACM Transactions on Modeling and Computer Simulation
, 2003
"... Introduction 1.1. A pseudorox"q number gener ator (RNG) for high speed simulation and Monte CarS integrSqKx should have sever" pr" er"US : (1) it should haveenor""x perz d, (2) it should e hibitunifor distrqS""xI of dtuples(for all d), (3) it should exhibit a good lattice str""Ezx in high dimens ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Introduction 1.1. A pseudorox"q number gener ator (RNG) for high speed simulation and Monte CarS integrSqKx should have sever" pr" er"US : (1) it should haveenor""x perz d, (2) it should e hibitunifor distrqS""xI of dtuples(for all d), (3) it should exhibit a good lattice str""Ezx in high dimensions, and (4) it should be e#ciently computable(prablexzF with a base b which is a power of 2). Typically the RNG is a member of a family ofsimilar generrxI withdi#erq tparU"xIEU and one hopes that parKq"qxI and seeds may be easily chosen so as toguarF tee pr" er"E" (1), (2), (3) and (4). Ther is no known family of RNG with all four pr" er"KS (see,for example, [M1]). 1.2. In [MZ], Mar aglia and Zaman showed that their addwithcarc (AWC) gener ator satisfy condition (1). By giving up on (4) and using an appr"FxIE" base b, they achieve good distrxSKEKx pr" er"Kq of dtuplesfor values d wh
Register synthesis for algebraic feedback shift registers based on nonprimes
 DESIGNS, CODES, AND CRYPTOGRAPHY
"... In this paper, we describe a solution to the register synthesis problem for a class of sequence generators known as Algebraic Feedback Shift Registers (or AFSRs). These registers are based on the algebra of adic numbers, where is an element in a ring R, and produce sequences of elements in R=(). W ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
In this paper, we describe a solution to the register synthesis problem for a class of sequence generators known as Algebraic Feedback Shift Registers (or AFSRs). These registers are based on the algebra of adic numbers, where is an element in a ring R, and produce sequences of elements in R=(). We give several cases where the register synthesis problem can be solved by an ecient algorithm. Consequently, any keystreams over R=() used in stream ciphers must be unable to be generated by a small register in these classes. This paper extends the analyses of feedback with carry shift registers and algebraic feedback shift registers by Goresky, Klapper, and Xu [4, 5, 11].
Fourier Transforms and the 2adic Span of Periodic Binary Sequences
 IEEE Trans. Info. Theory
, 2000
"... An arithmetic or withcarry analog of Blahut's theorem is presented. This relates the length of the smallest feedback with carry shift register to the number of nonzero classical Fourier coefficients of a periodic binary sequence. ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
An arithmetic or withcarry analog of Blahut's theorem is presented. This relates the length of the smallest feedback with carry shift register to the number of nonzero classical Fourier coefficients of a periodic binary sequence.
Distributional Properties of dFCSR Sequences
"... In this paper we study the distribution properties of dFCSR sequences. These sequences have ecient generators and have several good statistical properties. We show that for d = 2 the number of occurrences of an xed size subsequence diers from the average number of occurrences by at most a small ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
In this paper we study the distribution properties of dFCSR sequences. These sequences have ecient generators and have several good statistical properties. We show that for d = 2 the number of occurrences of an xed size subsequence diers from the average number of occurrences by at most a small constant times the square root of the average.