The optimal key estimation of stream ciphers and its approximation algorithm based on a probabilistic inference

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

1 Citation (Scopus)

Abstract

A stream cipher is an important class of encryption algorithms. Its safety depends on the structure of the pseudorandom number generator used. There are various types of pseudo-random number generators in existence, and attack algorithms used on them have been studied individually. In this paper, we express the problem of attacks on a general stream cipher as a probabilistic inference problem, and formulate the optimal key estimation. We also propose a unified framework of attack algorithms that can be applied to a wide variety of stream ciphers. The optimal key estimation, however, has computational complexity. To reduce the complexity, an approximation algorithm based on a probabilistic inference is proposed. We also describe some attack algorithms used on practical pseudorandom number generators. Finally, the proposed algorithm is evaluated by through a computer simulation.

Original languageEnglish
Title of host publication2012 International Symposium on Information Theory and Its Applications, ISITA 2012
Pages531-535
Number of pages5
Publication statusPublished - 2012
Event2012 International Symposium on Information Theory and Its Applications, ISITA 2012 - Honolulu, HI
Duration: 2012 Oct 282012 Oct 31

Other

Other2012 International Symposium on Information Theory and Its Applications, ISITA 2012
CityHonolulu, HI
Period12/10/2812/10/31

Fingerprint

Approximation algorithms
Cryptography
Computational complexity
Computer simulation

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems

Cite this

Iikubo, Y., Horii, S., & Matsushima, T. (2012). The optimal key estimation of stream ciphers and its approximation algorithm based on a probabilistic inference. In 2012 International Symposium on Information Theory and Its Applications, ISITA 2012 (pp. 531-535). [6400993]

The optimal key estimation of stream ciphers and its approximation algorithm based on a probabilistic inference. / Iikubo, Yuji; Horii, Shunsuke; Matsushima, Toshiyasu.

2012 International Symposium on Information Theory and Its Applications, ISITA 2012. 2012. p. 531-535 6400993.

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

Iikubo, Y, Horii, S & Matsushima, T 2012, The optimal key estimation of stream ciphers and its approximation algorithm based on a probabilistic inference. in 2012 International Symposium on Information Theory and Its Applications, ISITA 2012., 6400993, pp. 531-535, 2012 International Symposium on Information Theory and Its Applications, ISITA 2012, Honolulu, HI, 12/10/28.
Iikubo Y, Horii S, Matsushima T. The optimal key estimation of stream ciphers and its approximation algorithm based on a probabilistic inference. In 2012 International Symposium on Information Theory and Its Applications, ISITA 2012. 2012. p. 531-535. 6400993
Iikubo, Yuji ; Horii, Shunsuke ; Matsushima, Toshiyasu. / The optimal key estimation of stream ciphers and its approximation algorithm based on a probabilistic inference. 2012 International Symposium on Information Theory and Its Applications, ISITA 2012. 2012. pp. 531-535
@inproceedings{82dfaaa0b3ee4f8c80a1834a07336e35,
title = "The optimal key estimation of stream ciphers and its approximation algorithm based on a probabilistic inference",
abstract = "A stream cipher is an important class of encryption algorithms. Its safety depends on the structure of the pseudorandom number generator used. There are various types of pseudo-random number generators in existence, and attack algorithms used on them have been studied individually. In this paper, we express the problem of attacks on a general stream cipher as a probabilistic inference problem, and formulate the optimal key estimation. We also propose a unified framework of attack algorithms that can be applied to a wide variety of stream ciphers. The optimal key estimation, however, has computational complexity. To reduce the complexity, an approximation algorithm based on a probabilistic inference is proposed. We also describe some attack algorithms used on practical pseudorandom number generators. Finally, the proposed algorithm is evaluated by through a computer simulation.",
author = "Yuji Iikubo and Shunsuke Horii and Toshiyasu Matsushima",
year = "2012",
language = "English",
isbn = "9784885522673",
pages = "531--535",
booktitle = "2012 International Symposium on Information Theory and Its Applications, ISITA 2012",

}

TY - GEN

T1 - The optimal key estimation of stream ciphers and its approximation algorithm based on a probabilistic inference

AU - Iikubo, Yuji

AU - Horii, Shunsuke

AU - Matsushima, Toshiyasu

PY - 2012

Y1 - 2012

N2 - A stream cipher is an important class of encryption algorithms. Its safety depends on the structure of the pseudorandom number generator used. There are various types of pseudo-random number generators in existence, and attack algorithms used on them have been studied individually. In this paper, we express the problem of attacks on a general stream cipher as a probabilistic inference problem, and formulate the optimal key estimation. We also propose a unified framework of attack algorithms that can be applied to a wide variety of stream ciphers. The optimal key estimation, however, has computational complexity. To reduce the complexity, an approximation algorithm based on a probabilistic inference is proposed. We also describe some attack algorithms used on practical pseudorandom number generators. Finally, the proposed algorithm is evaluated by through a computer simulation.

AB - A stream cipher is an important class of encryption algorithms. Its safety depends on the structure of the pseudorandom number generator used. There are various types of pseudo-random number generators in existence, and attack algorithms used on them have been studied individually. In this paper, we express the problem of attacks on a general stream cipher as a probabilistic inference problem, and formulate the optimal key estimation. We also propose a unified framework of attack algorithms that can be applied to a wide variety of stream ciphers. The optimal key estimation, however, has computational complexity. To reduce the complexity, an approximation algorithm based on a probabilistic inference is proposed. We also describe some attack algorithms used on practical pseudorandom number generators. Finally, the proposed algorithm is evaluated by through a computer simulation.

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

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

M3 - Conference contribution

SN - 9784885522673

SP - 531

EP - 535

BT - 2012 International Symposium on Information Theory and Its Applications, ISITA 2012

ER -