On the security of the gollmann cascades

Sang Joon Park, Sangjin Lee, Seung Cheol Goh

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Citations (Scopus)

Abstract

The purpose of this paper is to evaluate the security of the Gollmann m-sequence cascades of k stages. We give some theoretical results, which can be utilized to construct the transition matrix T n of the conditional probabilities between the input and output strings of a stage. And then, we describe an attack algorithm for guessing the initial state of the first LFSR with desired reliability, using the transition matrix S n = T n k−1 of the conditional probabilities between the input string of the second stage and the output of the final stage of the given k-stage cascade. We finally evaluate the security of the cascades against this attack. Menicocci recently conjectured that there do not exist the complete analysis of the Gollmann cascades of more than 4 stages and it is infeasible to attack the 10-stage cascades with LFSRs of degree 100. Our experimental results show that the 9-stage cascades with LFSRs of degree 100 are completely breakable and the 10-stage cascades may be insecure.

Original languageEnglish
Title of host publicationAdvances in Cryptology ― CRYPTO 1995 - 15th Annual International Cryptology Conference, Proceedings
PublisherSpringer Verlag
Pages148-156
Number of pages9
Volume963
ISBN (Print)3540602216, 9783540602217
DOIs
Publication statusPublished - 1995
Externally publishedYes
Event15th Annual International Cryptology Conference, CRYPTO 19995 - Santa Barbara, United States
Duration: 1995 Aug 271995 Aug 31

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume963
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other15th Annual International Cryptology Conference, CRYPTO 19995
CountryUnited States
CitySanta Barbara
Period95/8/2795/8/31

Fingerprint

Cascade
Linear Feedback Shift Register
Transition Matrix
Attack
Conditional probability
Strings
M-sequence
Evaluate
Output
Experimental Results

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Park, S. J., Lee, S., & Goh, S. C. (1995). On the security of the gollmann cascades. In Advances in Cryptology ― CRYPTO 1995 - 15th Annual International Cryptology Conference, Proceedings (Vol. 963, pp. 148-156). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 963). Springer Verlag. https://doi.org/10.1007/3-540-44750-4_12

On the security of the gollmann cascades. / Park, Sang Joon; Lee, Sangjin; Goh, Seung Cheol.

Advances in Cryptology ― CRYPTO 1995 - 15th Annual International Cryptology Conference, Proceedings. Vol. 963 Springer Verlag, 1995. p. 148-156 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 963).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Park, SJ, Lee, S & Goh, SC 1995, On the security of the gollmann cascades. in Advances in Cryptology ― CRYPTO 1995 - 15th Annual International Cryptology Conference, Proceedings. vol. 963, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 963, Springer Verlag, pp. 148-156, 15th Annual International Cryptology Conference, CRYPTO 19995, Santa Barbara, United States, 95/8/27. https://doi.org/10.1007/3-540-44750-4_12
Park SJ, Lee S, Goh SC. On the security of the gollmann cascades. In Advances in Cryptology ― CRYPTO 1995 - 15th Annual International Cryptology Conference, Proceedings. Vol. 963. Springer Verlag. 1995. p. 148-156. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-44750-4_12
Park, Sang Joon ; Lee, Sangjin ; Goh, Seung Cheol. / On the security of the gollmann cascades. Advances in Cryptology ― CRYPTO 1995 - 15th Annual International Cryptology Conference, Proceedings. Vol. 963 Springer Verlag, 1995. pp. 148-156 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{dd713513b3c84bb7b5aac63761c034eb,
title = "On the security of the gollmann cascades",
abstract = "The purpose of this paper is to evaluate the security of the Gollmann m-sequence cascades of k stages. We give some theoretical results, which can be utilized to construct the transition matrix T n of the conditional probabilities between the input and output strings of a stage. And then, we describe an attack algorithm for guessing the initial state of the first LFSR with desired reliability, using the transition matrix S n = T n k−1 of the conditional probabilities between the input string of the second stage and the output of the final stage of the given k-stage cascade. We finally evaluate the security of the cascades against this attack. Menicocci recently conjectured that there do not exist the complete analysis of the Gollmann cascades of more than 4 stages and it is infeasible to attack the 10-stage cascades with LFSRs of degree 100. Our experimental results show that the 9-stage cascades with LFSRs of degree 100 are completely breakable and the 10-stage cascades may be insecure.",
author = "Park, {Sang Joon} and Sangjin Lee and Goh, {Seung Cheol}",
year = "1995",
doi = "10.1007/3-540-44750-4_12",
language = "English",
isbn = "3540602216",
volume = "963",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "148--156",
booktitle = "Advances in Cryptology ― CRYPTO 1995 - 15th Annual International Cryptology Conference, Proceedings",

}

TY - GEN

T1 - On the security of the gollmann cascades

AU - Park, Sang Joon

AU - Lee, Sangjin

AU - Goh, Seung Cheol

PY - 1995

Y1 - 1995

N2 - The purpose of this paper is to evaluate the security of the Gollmann m-sequence cascades of k stages. We give some theoretical results, which can be utilized to construct the transition matrix T n of the conditional probabilities between the input and output strings of a stage. And then, we describe an attack algorithm for guessing the initial state of the first LFSR with desired reliability, using the transition matrix S n = T n k−1 of the conditional probabilities between the input string of the second stage and the output of the final stage of the given k-stage cascade. We finally evaluate the security of the cascades against this attack. Menicocci recently conjectured that there do not exist the complete analysis of the Gollmann cascades of more than 4 stages and it is infeasible to attack the 10-stage cascades with LFSRs of degree 100. Our experimental results show that the 9-stage cascades with LFSRs of degree 100 are completely breakable and the 10-stage cascades may be insecure.

AB - The purpose of this paper is to evaluate the security of the Gollmann m-sequence cascades of k stages. We give some theoretical results, which can be utilized to construct the transition matrix T n of the conditional probabilities between the input and output strings of a stage. And then, we describe an attack algorithm for guessing the initial state of the first LFSR with desired reliability, using the transition matrix S n = T n k−1 of the conditional probabilities between the input string of the second stage and the output of the final stage of the given k-stage cascade. We finally evaluate the security of the cascades against this attack. Menicocci recently conjectured that there do not exist the complete analysis of the Gollmann cascades of more than 4 stages and it is infeasible to attack the 10-stage cascades with LFSRs of degree 100. Our experimental results show that the 9-stage cascades with LFSRs of degree 100 are completely breakable and the 10-stage cascades may be insecure.

UR - http://www.scopus.com/inward/record.url?scp=84957622876&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84957622876&partnerID=8YFLogxK

U2 - 10.1007/3-540-44750-4_12

DO - 10.1007/3-540-44750-4_12

M3 - Conference contribution

AN - SCOPUS:84957622876

SN - 3540602216

SN - 9783540602217

VL - 963

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

SP - 148

EP - 156

BT - Advances in Cryptology ― CRYPTO 1995 - 15th Annual International Cryptology Conference, Proceedings

PB - Springer Verlag

ER -