Skip to main content

Lund University Publications

LUND UNIVERSITY LIBRARIES

Cryptanalysis of the "grain" family of stream ciphers

Maximov, Alexander LU (2006) 2006 ACM Symposium on Information, Computer and Communications Security, ASIACCS '06 2006. p.283-288
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(
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
keywords
Cryptanalysis, Decoding problem
host publication
Proceedings of the 2006 ACM Symposium on Information, Computer and Communications Security, ASIACCS '06
volume
2006
pages
283 - 288
publisher
Association for Computing Machinery (ACM)
conference name
2006 ACM Symposium on Information, Computer and Communications Security, ASIACCS '06
conference location
Taipei, Taiwan, Province of China
conference dates
2007-03-21 - 2007-03-24
external identifiers
  • scopus:34247336490
DOI
10.1145/1128817.1128859
language
English
LU publication?
yes
id
483f827a-f746-498d-9250-dd6107865430 (old id 617042)
date added to LUP
2016-04-04 12:19:50
date last changed
2021-08-25 01:54:14
@inproceedings{483f827a-f746-498d-9250-dd6107865430,
  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(},
  author       = {Maximov, Alexander},
  booktitle    = {Proceedings of the 2006 ACM Symposium on Information, Computer and Communications Security, ASIACCS '06},
  language     = {eng},
  pages        = {283--288},
  publisher    = {Association for Computing Machinery (ACM)},
  title        = {Cryptanalysis of the "grain" family of stream ciphers},
  url          = {http://dx.doi.org/10.1145/1128817.1128859},
  doi          = {10.1145/1128817.1128859},
  volume       = {2006},
  year         = {2006},
}