Cryptanalysis of the "grain" family of stream ciphers

Alexander Maximov

doi:10.1145/1128817.1128859

Cryptanalysis of the "grain" family of stream ciphers

Alexander Maximov

Department of Electrical and Information Technology

Research output: Chapter in Book/Report/Conference proceeding › Paper in conference proceeding › peer-review

Abstract

Let us have an NLFSR with the feedback function g(x) and an LFSR with the generating polynomial f(x). The function g(x) is a Boolean function on the state of the NLFSR and the LFSR, at any time instance t. Whenever the LFSR has good statistical properties, it is used for controlling the randomness of the NLFSR's state machine. In this paper we define and study the general class of "Grain" family of stream ciphers, where the keystrearn bits are generated by another Boolean function h(y) on the states of the NLFSR and the LFSR. We show that the cryptographic strength of this family is related to the general decoding problem, when a key-recovering attack is considered. A proper choice of the functions f(

Original language	English
Title of host publication	Proceedings of the 2006 ACM Symposium on Information, Computer and Communications Security, ASIACCS '06
Publisher	Association for Computing Machinery (ACM)
Pages	283-288
Volume	2006
DOIs	https://doi.org/10.1145/1128817.1128859
Publication status	Published - 2006
Event	2006 ACM Symposium on Information, Computer and Communications Security, ASIACCS '06 - Taipei, Taiwan Duration: 2007 Mar 21 → 2007 Mar 24

Publication series

Name
Volume	2006

Conference

Conference	2006 ACM Symposium on Information, Computer and Communications Security, ASIACCS '06
Country/Territory	Taiwan
City	Taipei
Period	2007/03/21 → 2007/03/24

Subject classification (UKÄ)

Electrical Engineering, Electronic Engineering, Information Engineering

Free keywords

Cryptanalysis
Decoding problem

Access to Document

10.1145/1128817.1128859

Cite this

@inproceedings{483f827af746498d9250dd6107865430,

title = "Cryptanalysis of the {"}grain{"} family of stream ciphers",

abstract = "Let us have an NLFSR with the feedback function g(x) and an LFSR with the generating polynomial f(x). The function g(x) is a Boolean function on the state of the NLFSR and the LFSR, at any time instance t. Whenever the LFSR has good statistical properties, it is used for controlling the randomness of the NLFSR's state machine. In this paper we define and study the general class of {"}Grain{"} family of stream ciphers, where the keystrearn bits are generated by another Boolean function h(y) on the states of the NLFSR and the LFSR. We show that the cryptographic strength of this family is related to the general decoding problem, when a key-recovering attack is considered. A proper choice of the functions f(",

keywords = "Cryptanalysis, Decoding problem",

author = "Alexander Maximov",

year = "2006",

doi = "10.1145/1128817.1128859",

language = "English",

volume = "2006",

publisher = "Association for Computing Machinery (ACM)",

pages = "283--288",

booktitle = "Proceedings of the 2006 ACM Symposium on Information, Computer and Communications Security, ASIACCS '06",

address = "United States",

note = "2006 ACM Symposium on Information, Computer and Communications Security, ASIACCS '06 ; Conference date: 21-03-2007 Through 24-03-2007",

}

Maximov, A 2006, Cryptanalysis of the "grain" family of stream ciphers. in Proceedings of the 2006 ACM Symposium on Information, Computer and Communications Security, ASIACCS '06. vol. 2006, Association for Computing Machinery (ACM), pp. 283-288, 2006 ACM Symposium on Information, Computer and Communications Security, ASIACCS '06, Taipei, Taiwan, 2007/03/21. https://doi.org/10.1145/1128817.1128859

TY - GEN

T1 - Cryptanalysis of the "grain" family of stream ciphers

AU - Maximov, Alexander

PY - 2006

Y1 - 2006

N2 - Let us have an NLFSR with the feedback function g(x) and an LFSR with the generating polynomial f(x). The function g(x) is a Boolean function on the state of the NLFSR and the LFSR, at any time instance t. Whenever the LFSR has good statistical properties, it is used for controlling the randomness of the NLFSR's state machine. In this paper we define and study the general class of "Grain" family of stream ciphers, where the keystrearn bits are generated by another Boolean function h(y) on the states of the NLFSR and the LFSR. We show that the cryptographic strength of this family is related to the general decoding problem, when a key-recovering attack is considered. A proper choice of the functions f(

AB - Let us have an NLFSR with the feedback function g(x) and an LFSR with the generating polynomial f(x). The function g(x) is a Boolean function on the state of the NLFSR and the LFSR, at any time instance t. Whenever the LFSR has good statistical properties, it is used for controlling the randomness of the NLFSR's state machine. In this paper we define and study the general class of "Grain" family of stream ciphers, where the keystrearn bits are generated by another Boolean function h(y) on the states of the NLFSR and the LFSR. We show that the cryptographic strength of this family is related to the general decoding problem, when a key-recovering attack is considered. A proper choice of the functions f(

KW - Cryptanalysis

KW - Decoding problem

U2 - 10.1145/1128817.1128859

DO - 10.1145/1128817.1128859

M3 - Paper in conference proceeding

VL - 2006

SP - 283

EP - 288

BT - Proceedings of the 2006 ACM Symposium on Information, Computer and Communications Security, ASIACCS '06

PB - Association for Computing Machinery (ACM)

T2 - 2006 ACM Symposium on Information, Computer and Communications Security, ASIACCS '06

Y2 - 21 March 2007 through 24 March 2007

ER -

Cryptanalysis of the "grain" family of stream ciphers

Abstract

Publication series

Conference

Subject classification (UKÄ)

Free keywords

Access to Document

Fingerprint

Cite this