#### Filter Results:

- Full text PDF available (9)

#### Publication Year

1993

2014

- This year (0)
- Last 5 years (1)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Harald Niederreiter, Rainer Göttfert
- J. Symb. Comput.
- 1993

- Berndt M. Gammel, Rainer Göttfert
- WCC
- 2005

Nonlinear n-stage feedback shift-register sequences over the finite field Fq of period q n − 1 are investigated under linear operations on sequences. We prove that all members of an easily described class of linear combinations of shifted versions of these sequences possess useful properties for cryptographic applications: large periods, large linear… (More)

- RAINER GÖTTFERT
- 2010

A new deterministic factorization algorithm for polynomials over finite fields was recently developed by Niederreiter. The bottleneck in this algorithm is the last stage in which the irreducible factors of the polynomial are derived from the solutions of a system of linear equations. In this paper, we consider finite fields of characteristic 2, and we show… (More)

- Berndt M. Gammel, Rainer Göttfert, O. Kniffler
- ISCAS
- 2006

We determine the imbalances of the keystreams produced by Achterbahn-80 and Achterbahn-128 in two different ways. The number of cyclically inequivalent keystreams produced by the keystream generators of Achterbahn-80 and Achterbahn-128 is determined. An abstract model for the keystream generator of a primitive NLFSR combination generator is used to justify… (More)

We report on the results of computations concerning the linear complexities of the NLFSRs deployed in Achterbahn's keystream generator. We outline a probabilis-tic algorithm for estimating the linear complexities of binary sequences of period 2 N − 1. We define Achterbahn-Version 2 whose keystream generator consists of ten shift registers. We introduce the… (More)

The Boolean combining function in the 80-bit-key stream cipher Achterbahn [1] is weak. Its major weakness consists of the fact that by setting two specific variables to zero, the function becomes linear. Its second weakness consists of the fact that it can be approximated by a linear function which agrees with the Boolean combining function with probability… (More)

- Rainer Göttfert, Harald Niederreiter
- EUROCRYPT
- 1993

Stream ciphers that deploy linear feedback shift registers (LFSRs) have been shown to be vulnerable under fast correlation at-[1], and fault attacks [13]. We discuss certain nonlinear feedback shift registers (NLFSRs) recommended as substitutes for LFSRs in stream cipher systems.