Linear cryptanalysis of bluetooth stream cipher

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2332, Issue , 2002, Pages 238-255

  Golić, Jovan Dj ^a   Bagini, Vittorio ^a   Morgari, Guglielmo ^a  

^a Rome CryptoDesign Center   (Italy)

Author keywords

Iterative probabilistic decoding; Linear correlations; Linear cryptanalysis; Reinitialization

Indexed keywords

BLUETOOTH; ITERATIVE DECODING; ITERATIVE METHODS;

BINARY SYSTEMS; BLUETOOTH COMBINERS; ITERATIVE PROBABILISTIC DECODING; KEYSTREAM GENERATORS; LINEAR CORRELATION; LINEAR CRYPTANALYSIS; PRE-COMPUTATION; REINITIALIZATION;

CRYPTOGRAPHY;

EID: 84947279371     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-46035-7_16     Document Type: Article

References (18)

1. BluetoothTM, Bluetooth Specification, Version 1.1, Feb. 2001.
2. V. Chepyzhov and B. Smeets, “On a fast correlation attack on stream ciphers,” Advances in Cryptology - EUROCRYPT ’91, Lecture Notes in Computer Science, vol. 547, pp. 176-185, 1991.
3. E. Dawson and A. Clark, “Divide andconquer attacks on certain classes of stream ciphers,” Cryptologia, vol. 18, pp. 25-40, 1994.
4. S. Fluhrer and S. Lucks, “Analysis of the E0 encryption system,” SelectedAreas in Cryptography - SAC 2001, Lecture Notes in Computer Science, vol. 2259, pp. 38-48, 2001.
5. M. P. C. Fossorier, M. J. Mihaljevic, andH. Imai, “Reducedcomplexit y iterative decoding of low-density parity check codes based on belief propagation,” IEEE Trans. Commun., vol. 47, pp. 673-680, May 1999.
6. R. G. Gallager, “Low-density parity-check codes,” IRE Trans. Inform. Theory, vol. 8, pp. 21-28, Jan. 1962.
7. J. Dj. Golic, “Correlation properties of a general binary combiner with memory,” Journal of Cryptology, vol. 9, pp. 111-126, 1996.
8. J. Dj. Golic, “Computation of low-weight parity-check polynomials,” Electronics Letters, vol. 32, pp. 1981-1982, Oct. 1996.
9. J. Dj. Golic, “Cryptanalysis of allegedA5 stream cipher,” Advances in Cryptology - EUROCRYPT ’97, Lecture Notes in Computer Science, vol. 1233, pp. 239-255, 1997.
10. J. Dj. Golic, M. Salmasizadeh, and E. Dawson, “Fast correlation attacks on the summation generator,” Journal of Cryptology, vol. 13, pp. 245-262, 2000.
11. J. Dj. Golic, “Iterative optimum symbol-by-symbol decoding and fast correlation attacks,” IEEE Trans. Inform. Theory, vol. 47, pp. 3040-3049, 2001.
12. M. Jakobsson andS. Wetzel, “Security weaknesses in Bluetooth,” Topics in Cryptology - CT-RSA 2001, Lecture Notes in Computer Science, vol. 2020, pp. 176-191, 2001.
13. C. R. P. Hartmann and L. D. Rudolph, “An optimum symbol-by-symbol decoding rule for linear codes,” IEEE Trans. Inform. Theory, vol. 22, pp. 514-517, Sept. 1976.
14. M. Hermelin and K. Nyberg, “Correlation properties of the Bluetooth combiner,” Information Security andCryptology - ICISC ’99, Lecture Notes in Computer Science, vol. 1787, pp. 17-29, 1999.
15. D. J. C. MacKay, “Gooderror-correcting codes basedon very sparse matrices,” IEEE Trans. Inform. Theory, vol. 45, pp. 399-431, Mar. 1999.
16. W. Meier and O. Staffelbach, “Fast correlation attacks on certain stream ciphers,” Journal of Cryptology, vol. 1, pp. 159-176, 1989.
17. W. Meier and O. Staffelbach, “Correlation properties of combiners with memory in stream ciphers,” Journal of Cryptology, vol. 5, pp. 67-86, 1992.
18. M. J. Mihaljevic and J. Dj. Golic, “A methodfor convergence analysis of iterative probabilistic decoding,” IEEE Trans. Inform. Theory, vol. 46, pp. 2206-2211, Sept. 2000.