<--- Back to Details
First PageDocument Content
Cryptography / Stream ciphers / Pseudorandom number generators / Linear-feedback shift register / Correlation attack / Self-shrinking generator / Grain / QUAD / Turing / Shrinking generator / Shift register
Date: 2006-03-23 04:05:33
Cryptography
Stream ciphers
Pseudorandom number generators
Linear-feedback shift register
Correlation attack
Self-shrinking generator
Grain
QUAD
Turing
Shrinking generator
Shift register

Decim, a new stream cipher for hardware applications ∗ C. Berbain1 , O. Billet1 , A. Canteaut2 , N. Courtois3 , B. Debraize3,4 , H. Gilbert1 , L. Goubin4 , A. Gouget5 , L. Granboulan6 , C. Lauradoux2 , M. Minier2 , T.

Add to Reading List

Source URL: www.rocq.inria.fr

Download Document from Source Website

File Size: 201,81 KB

Share Document on Facebook

Similar Documents

The Alan Turing Institute SME Consultation Understanding the data science and artificial intelligence (AI) needs of UK SMEs The Alan Turing Institute has commenced work to better understand and engage with small and medi

The Alan Turing Institute SME Consultation Understanding the data science and artificial intelligence (AI) needs of UK SMEs The Alan Turing Institute has commenced work to better understand and engage with small and medi

DocID: 1xV5H - View Document

Lecture 1, Tues Jan 17: Course Intro, Church-Turing Thesis ● ●  ●

Lecture 1, Tues Jan 17: Course Intro, Church-Turing Thesis ● ● ●

DocID: 1xUXq - View Document

Per Anhalter durch die Turing-Galaxis  Andrea Knaut, Christian Kühne, Constanze Kurz, Jörg Pohle, Rainer Rehak, Stefan Ullrich (Hrsg.): „Per Anhalter durch die Turing-Galaxis“ © 2012 der vorliegenden Ausgabe: Edi

Per Anhalter durch die Turing-Galaxis Andrea Knaut, Christian Kühne, Constanze Kurz, Jörg Pohle, Rainer Rehak, Stefan Ullrich (Hrsg.): „Per Anhalter durch die Turing-Galaxis“ © 2012 der vorliegenden Ausgabe: Edi

DocID: 1vnh0 - View Document

Structured Memory for Neural Turing Machines  Wei Zhang ∗ Yang Yu Bowen Zhou IBM Watson zhangwei,yu,

Structured Memory for Neural Turing Machines Wei Zhang ∗ Yang Yu Bowen Zhou IBM Watson zhangwei,yu,

DocID: 1vh8t - View Document

On the complexity of some computational problems in the Turing model Claus Diem November 18, 2013 Abstract Algorithms for concrete problems are usually described and analyzed in some random access machine model. This is

On the complexity of some computational problems in the Turing model Claus Diem November 18, 2013 Abstract Algorithms for concrete problems are usually described and analyzed in some random access machine model. This is

DocID: 1vf5u - View Document