H. Niederreiter, The linear complexity profile and the jump complexity of keystream sequences,w:Advances in Cryptology (Aarhus, 1990. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
An Approximate Distribution for the Maximum Order Complexity - Erdmann, Murphy (1995) (Correct)
....is C(S n ) considered as a function of n. He gave some properties of a typical linear complexity profile for a random sequence. Thus the linear complexity profile can be used to construct statistical tests for the randomness of a sequence as discussed by Wang [9] Carter [1] and Niederreiter [7]. In this paper, we consider general (nonlinear) feedback shift registers (FSR) Accordingly we define the maximum order complexity of a sequence S n to be the shortest feedback register that can generate the sequence S n . The maximum order complexity can be calculated efficiently using, for ....
H. Niederreiter. The Linear Complexity Profile and the Jump Complexity of Keystream Sequences. In Advances in Cryptology, Proceedings of EUROCRYPT 90, pages 174--188. Springer--Verlag, 1991.
Stream Ciphers - Robshaw (1995) (1 citation) (Correct)
.... very important theorems concerning the linear complexity profile and managed to obtain expressions for the expected behavior of the linear complexity profile of a sequence for which each bit is generated at random [114] This so called ideal linear complexity profile has been widely studied [96]. Rueppel established that the linear complexity profile for a perfectly random source closely follows the line y = x 2 ; a conjecture was posed specifying a class of sequences which possess the ideal linear complexity profile, that is which sequences have a profile which follows the line y = ....
H. Niederreiter. The linear complexity profile and the jump complexity of keystream sequences. In I.B. Damgard, editor, Advances in Cryptology --- Eurocrypt '90, pages 174--188, Springer-Verlag, Berlin, 1991.
Generatory Liczb Losowych: Algorytmy,testowanie, Zastosowania - Kotulski (2001) (Correct)
No context found.
H. Niederreiter, The linear complexity profile and the jump complexity of keystream sequences,w:Advances in Cryptology (Aarhus, 1990.
Preliminary Analysis of the BSAFE 3.x Pseudorandom Number.. - Baldwin (1998) (Correct)
No context found.
H. Niederreiter. The linear complexity profile and the jump complexity of keystream sequences. In I.B. Damgrd, editor, Advances in Cryptology - Eurocrypt `90, pages 174 - 188, Springer-Verlag 1991.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC