A Stream Cipher Proposal: Grain-128

@article{Hell2006ASC,
  title={A Stream Cipher Proposal: Grain-128},
  author={Martin Hell and Thomas Johansson and Alexander Maximov and Willi Meier},
  journal={2006 IEEE International Symposium on Information Theory},
  year={2006},
  pages={1614-1618}
}
A new stream cipher, Grain-128, is proposed. The design is very small in hardware and it targets environments with very limited resources in gate count, power consumption, and chip area. Grain-128 supports key size of 128 bits and IV size of 96 bits. The design is very simple and based on two shift registers, one linear and one nonlinear, and an output function 

Figures, Tables, and Topics from this paper

Design Example III: Grain-128a Stream Cipher
TLDR
In this chapter, a third design example is presented which is the Grain-128a stream cipher with × 2 option which is a cryptographic block designed in a 180 nm bulk CMOS technology both with MCML and CMOS gates for comparing the power supply noise performance. Expand
BSF-128 : A New Synchronous Stream Cipher Design
The main aim of this paper is to introduce a new synchronous stream cipher based on128 bit key length. The new proposed design is named “BSF-128” and is primarily based on a Non Linear Feedback ShiftExpand
An Improved Hardware Implementation of the Grain Stream Cipher
  • S. Mansouri, E. Dubrova
  • Computer Science
  • 2010 13th Euromicro Conference on Digital System Design: Architectures, Methods and Tools
  • 2010
TLDR
By transforming the NLFSR of Grain from its original Fibonacci configuration to the Galois configuration and by introducing new hardware solutions, this paper double the throughput of the 80 and 128-bit key 1 bit/cycle architectures of Grain with no area and power penalty. Expand
An AEAD Variant of the Grain Stream Cipher
TLDR
A new Grain stream cipher, denoted Grain- 128AEAD is presented, with support for authenticated encryption with associated data, based on Grain-128a but introduces a few changes in order to increase the security and protect against recent cryptanalysis results. Expand
The rakaposhi Stream Cipher
TLDR
The rakaposhi stream cipher offers 128-bit security, and aims to complement the current eSTREAM portfolio of hardware-oriented stream ciphers. Expand
A New Proposed Design of a Stream Cipher Algorithm: Modified Grain-128
The objective of this research is to propose a new algorithm based on the existing Grain 128 stream cipher algorithm. The comparison of Grain 128 and Modified Grain 128 will be evaluated by usingExpand
Cryptanalysis of the Grain Family of Ciphers: A Review
  • Hridya P R, J. Jose
  • Computer Science
  • 2019 International Conference on Communication and Signal Processing (ICCSP)
  • 2019
TLDR
The paper discusses major attacks that were proposed against Grain family of ciphers, and Grain-128 in particular. Expand
A Detailed Analysis of Grain family of Stream Ciphers
TLDR
Security features and different attacks on Grain family of stream ciphers have been studied in this paper to analyze the strengths and weaknesses of these designs. Expand
Randomness analysis on grain - 128 stream cipher
TLDR
The randomness analysis of Grain-128 stream cipher algorithm by using NIST Statistical Test Suite is introduced and it is obtained that this algorithm is not random at the 1% significance level. Expand
On Increasing the Throughput of Stream Ciphers
TLDR
A common hardware implementation technique for improving the throughput is to parallelize computations but this usually requires to insert additional memory cells for storing the intermediate results, hence at the expense of an increased hardware size. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 17 REFERENCES
Grain: a stream cipher for constrained environments
TLDR
A new stream cipher, Grain, is proposed, which targets hardware environments where gate count, power consumption and memory is very limited and has the additional feature that the speed can be increased at the expense of extra hardware. Expand
Cryptanalytic Time/Memory/Data Tradeoffs for Stream Ciphers
TLDR
This paper shows that a combination of the two approaches has an improved time/memory/data tradeoff for stream ciphers of the form TM2D2 = N2 for any D2 ≤ T ≤ N. Expand
Fault Analysis of Stream Ciphers
TLDR
The goal in this paper is to develop general techniques which can be used to attack the standard constructions of stream ciphers based on LFSR's, as well as more specialized techniques which could be used against specific streamciphers such as RC4, LILI-128 and SOBER-t32. Expand
Fast Correlation Attacks Based on Turbo Code Techniques
TLDR
New methods for fast correlation attacks on stream ciphers, based on techniques used for constructing and decoding the by now famous turbo codes, are described. Expand
Fast Correlation Attack Algorithm with List Decoding and an Application
TLDR
An improved method for the fast correlation attack on certain stream ciphers is presented and its theoretical analyzibility is considered, so that its performance can also be estimated in cases where corresponding experiments are not feasible due to the current technological limitations. Expand
Fast Correlation Attacks through Reconstruction of Linear Polynomials
TLDR
By modeling the task of a fast correlation attack as the problem of learning a binary linear multivariate polynomial, algorithms forPolynomial reconstruction with queries can be modified through some general techniques used in fast correlation attacks. Expand
Cryptanalysis of the "Grain" family of stream ciphers
TLDR
This paper gives a linear distinguishing attack on Grain with time complexity O(254), when O(251) bits of the keystream is available, and it reveals a leakage in the choice of the functions in this particular design instance. Expand
Fast Algebraic Attacks on Stream Ciphers with Linear Feedback
TLDR
This paper shows how to substantially lower the degree of these equations by multiplying them by well-chosen multivariate polynomials, and is able to break Toyocrypt in 249 CPU clocks, with only 20 Kbytes of keystream, the fastest attack proposed so far. Expand
Algebraic Attacks on Stream Ciphers with Linear Feedback
TLDR
This paper shows how to substantially lower the degree of these equations by multiplying them by well-chosen multivariate polynomials, and is able to break Toyocrypt in 2 CPU clocks, with only 20 Kbytes of keystream, the fastest attack proposed so far. Expand
Fast Correlation Attacks: An Algorithmic Point of View
TLDR
It is shown that the simple algorithmic techniques that are usually used to perform these steps can be replaced by algorithms with better asymptotic complexity using more advancedgorithmic techniques, and these new algorithms yield large improvements on the efficiency of fast correlation attacks. Expand
...
1
2
...