Miquel Soriano Ibaez

Ral Gonzalo Daz

Generacin y anlisis
de secuencias pseudoaleatorias
Primera edicin: septiembre de 1999

Els autors, 1999

Edicions UPC, 1999

Edicions de la Universitat Politcnica de Catalunya, SL
Jordi Girona Salgado 31, 08034 Barcelona
Tel.: 934 016 883 Fax: 934 015 885
Edicions Virtuals: www.edicionsupc.es
e-mail: edupc@sg.upc.es

Produccin: CBS Impressi digital

Pintor Fortuny 151, 08224 Terrassa (Barcelona)

Depsito legal: B-38636-99

ISBN: 84-8301-348-7

Quedan rigurosamente prohibidas, sin la autorizacin escrita de los titulares del copyright, bajo las
sanciones establecidas en las leyes, la reproduccin total o parcial de esta obra por cualquier medio o
procedimiento, comprendidos la reprografa y el tratamiento informtico, y la distribucin de ejemplares
de ella mediante alquiler o prstamo pblicos, as como la exportacin e importacin de ejemplares para
su distribucin y venta fuera del mbito de la Unin Europea.
Indice

1. Introduccin

1.1. Introduccin ....................................................................................................................................... 1

1.2. Entornos de aplicacin ....................................................................................................................... 2
1.3. Evolucin histrica en la generacin de nmeros aleatorios.............................................................. 4

2. El cifrado en flujo

2.1. Antecedentes histricos...................................................................................................................... 7

2.2. Visin genrica del cifrado en flujo ................................................................................................. 10
2.3. Sincronismo en los cifradores en flujo ............................................................................................. 11
2.4. Enfoques al cifrado en flujo ............................................................................................................. 13
2.5. Ventajas e incovenientes del cifrado en flujo................................................................................... 14
2.6. Ataques comunes al cifrado en flujo ................................................................................................ 14
2.7. Criterios de diseo ........................................................................................................................... 14

3. Generadores

3.1. Introduccin ..................................................................................................................................... 17

3.2. Generadores congruenciales............................................................................................................. 18
3.3. Registros de desplazamiento realimentados (FSR) .......................................................................... 21
3.4. Generadores con funciones de salida ............................................................................................... 28
3.5. Generadores controlados por reloj ................................................................................................... 38
3.6. Generadores en bloque..................................................................................................................... 45

4. Evaluacin de la seguridad

4.1. Introduccin ..................................................................................................................................... 49

4.2. Clculo del periodo de una secuencia .............................................................................................. 50
4.3. Anlisis estadstico de distribuciones............................................................................................... 50
4.4. Tests empricos ................................................................................................................................ 53
4.5. Tests tericos ................................................................................................................................... 58
4.6. Complejidades.................................................................................................................................. 63
4.7. Compresiones................................................................................................................................... 68

5. CDMA

5.1. Introduccin a la tcnica de acceso CDMA ..................................................................................... 69

5.2. Correlacin aperidica e impar ........................................................................................................ 72
5.3. Familia de secuencias pseudoaleatorias para sistemas CDMA ........................................................ 73

6. Bibliografa............................................................................................................................................ 79
Bibliografa
[ADA 97] Adachi, Sawahashi, Okawa. Tree-Structured Generation of Orthogonal
Spreading Codes with Different Length for Forward Link of DS-CDMA
Mobile Radio. Elect. Letters, vol 33, n. 1, Enero 97, pp 27-28
[BLAH 83] Blahut, R. Theory and practice of error control codes. Addison Wesley,
1983
[BETH 84] T. Beth, F. Piper "The stop-and-go generator". Lecture Notes in
Computer Science 209; Advances in Cryptology: Proc. Eurocrypt'84.
[BRUE 84] J.O. Bruer. "On pseudo random sequences as crypto generators" Proceedings
of Int. Zurich Seminar on Digital Communicationes, Switzerland, 1984..
[CHA 88] W.G. Chambers, D. Gollman. "Generators for sequences with near-maximal
linear equivalence" IEE Proc. E., vol. 135, pp 67-69, 1988.
[CRU 95] E. Cruselles, M. Soriano, J. Forn, J.L. Mels : Secure Communications in
Broadband Networks. Third International Conference on
Telecommunication Systems. Modelling and Analysis.16-19 Mar 1995,
Nashville, Tennesse. USA
[DING 91]C. Ding, G. Xiao, W. Shan The Stability Theory of Stream Ciphers. Lecture
Notes in Computer Science 561. Springer-Verlag , Berlin, 1991.
[DIN 98] Dinan, Jabbari Spreading Codes for Direct Sequence CDMA and Wideband
CDMA Cellular Networks. IEEE Communications Magazine, Sept 98.
[FUS 91] A. Fuster, D. de la Gua, J. Negrillo, F. Montoya. A Basic Structure for
Generating Pseudorandom Binary Sequences
[GOL 67] R. Gold. Optimal binary sequences for spread spectrum multiplexing.
IEEE Trans. on Information Theory, vol IT-13, 1967, pp. 619-621.
[GOLI 92] J. D. Golic, S. V. Petrovic "A generalized correlation attack with a
probabilistic edit distance". Lecture Notes in Computer Science 547.
Advances in Cryptology-Proc. Eurocrypt'92. Springer-Verlag , Balatonfred,
1992. pp. 472 - 476.
[GOLL 89] D. Gollman, W. Chambers "Clock-controlled shift registers: A review".
IEEE J. Selected Areas on Communications, vol 7, pp 525-533, Mayo 1989.
[GOLO 67] S.W. Golomb. Shift Register Sequences Holden-Day. 1967.
[JAN 89] C. J. Jansen "The Shortest Feedback Shift Register that Can Generate a
Given Sequence ". Lecture Notes in Computer Science 435. Advances in
Cryptology-Proc. Crypto'89. Springer-Verlag , Montreal 1989. pp. 90 - 99.

Los autores, 1999; Edicions UPC, 1999.

 Bibliografa.

[JEN 83] S. Jennings. "Multiplexed sequences: Some properties of the minimum

polynomial", Lecture Notes in Computer Science 149; Cryptography: Proc.
Workshop Cryptography, Springer Verlag 1983.
[JEN 84] S. Jennings. "Autocorrelation function of the multiplexed sequence", IEE
proc. vol 131, n2, pp. 169-172, Abril 1984.
[KEY 76] E. Key. "An analysis of the structure and complexity of nonlinear binary
sequence generators", IEEE Trans. Information Theory, vol IT-22, n 6, pp.
732-763. Nov. 1976.
[KLA 95] A. Klapper. Feedback with carry shift registers over finite fields, Fast
Software Encryption, Second International Workshop, Lecture Notes in
Computer Science, vol 1008, pp 174-178. 1995
[KLA 97] A. Klapper, M. Goresky Feedback Shift Registers, 2-Adic Span, and
Combiners With Memory. Journal of Cryptology, vol. 10, n 2, 111-147.
1997
[KNU 67] D.E. Knuth. The Art of Computer Programming. Vol 2: Seminumerical
Algorithms" Adison-Wesley 1967.
[MAS 76] J.L. Massey. "Shift Register Sysnthesis and BCH Decoding" IEEE
Transactions on Information Theory, Vol. IT-15, No 1, Jan. 1976.
[MAS 84] J.L. Massey, R. A. Ruepple "Linear ciphers and random sequence generators
with multiple clocks" Lecture Notes in Computer Science 209; Advances in
Cryptology: Proc Eurocrypt'84. Springer-Verlag. Berlin 1985.
[MAUR91] U. Maurer. "A universal statistical test for random bit generators"
Lecture Notes in Computer Science, No 537. Advances in Cryptology-
CRYPTO'90. Springer-Verlag , Berlin, 1991.
[MEIE 90] W. Meier, O. Staffelbach. Correlation Properties of Combiners with
Memory in Stream Ciphers. Advances in Cryptology. Proc. Eurocrypt 90.
Springer-Verlag , pp 204 - 215.
[MEIE 92] W. Meier, O. Staffelbach. Correlation Properties of Combiners with
Memory in Stream Ciphers. Journal of Cryptology. Vol 5, n.1 1992.
[MUN 89] S. Mund "Ziv-Lempel Complexity for Periodic Sequences and its
Cryptographic Application". Lecture Notes in Computer Science 547.
Advances in Cryptology. Proc. Eurocrypt 89. Springer-Verlag , Brighton,
1989.
[PET 72] Peterson, Weldon. Error Correcting Codes. MIT Press, 1972
[PICK 82] R.L. Pickholtz, D.L. Schilling, L.B. Milstein. Theory of Spread-Spectrum
Communications - A Tutorial. IEEE Trans. Commun. vol COM-30, n.5, pp
855-884. Mayo 82.

B-2
Los autores, 1999; Edicions UPC, 1999.
 Bibliografa.

[RUEP 85] R. A. Rueppel. Correlation immunity and the summation generator.

Advances in Cryptology. Proc. Crypto 85. Springer-Verlag , Berlin, 1986.
pp. 260-272.
[RUEP 86] R. A. Rueppel. Analysis and Design of Stream Ciphers. Springer-Verlag
(1986).
[RUEP 87] R. A. Rueppel, "When Shift Registers Clocks Themselves" Lecture Notes
in Computer Science. Advances in Cryptology- Proc. Eurocrypt'87.
Springer-Verlag, 1987.
[SAR 80] D. V. Sarvate, W.P. Pursley. Cross-correlation properties of pseudo-random
and related sequences. Proc. IEEE, vol 68, pp 593-519, 1980.
[SCH0 77] R. A. Scholtz. The Spread Spectrum Concept. IEEE Trans. Commun. vol.
COM-25, n.8 pp 748-755. Agosto 1977.
[SCHR 90] A.W. Schrift, A. Shamir. "On the Universality of the Next Bit Test". Lecture
Notes in Computer Science 537. Advances in Cryptology- Proc. Crypto'90.
Springer-Verlag , 1990. pp. 394 - 407.
[SCHN 96] B. Schneier, Applied Cryptography, John Wiley & Sons, 1996.
[SHA 49] C. E. Shannon "Communication theory of secrecy systems". Bell Syst. Tech.
J. vol 28, pp. 656-715, Oct. 1949.
[SIEG 84] T. Siegenthaler. "Correlation-immunity of nonlinear combining functions for
cryptographic applications", IEEE Trans. Inform. Theory, vol IT-30, pp 776-
780, Oct. 84
[SIMM 92] G. Simmons. Contemporary Cryptology. IEEE Press 1992.
[STA 89] O. Staffelbach. "Correlation Attacks on Stream Ciphers". Proceeding of the
workshop on Stream Ciphers. Report 89/1. 1989.
[TATE 89] Tatebayashi, Matsuzaki and Newman "A Cryptosystem using Digital
Signal Processors for Mobile Communications" . IEEE, 1989.
[WEL 74] Welch. Lower Bounds on the Maximal Cross-Correlation of Signals IEEE
Trans. Inform. Theory, vol IT-20, mayo 74, pp 397-399.
[ZEN 88] K. Zeng, M.Q. Huang, "On the Linear Syndrome Method in Cryptanalysis".
Lecture Notes in Computer Science, 403. Proc. Crypto'88. Springer-Verlag ,
New York, 1988, p.p. 469 - 478.
[ZEN 89] K. Zeng, C. Yang and T.R.N. Rao "On the Linear Consistency Test (LCT)
in Cryptanalysis with Applications". Lecture Notes in Computer Science,
435. Proc. Crypto'89. Springer-Verlag , New York, 1989, p.p. 164 - 174.
[ZEN 90] K. Zeng, C. Yang and T.R.N. Rao "An Improved Linear Syndrome
Algorithm in Cryptanalysis with Applications". Lecture Notes in Computer
Science. 537. Proc. Crypto'90. Springer-Verlag , New York, 1990. pp. 34 -
47.

B-3
Los autores, 1999; Edicions UPC, 1999.
 Bibliografa.

[ZEN 91] K. Zeng, C. Yang and T.R.N. Rao. "Pseudorandom Bit Generators in Stream
Cipher Cryptography". IEEE, 1991.

B-4
Los autores, 1999; Edicions UPC, 1999.