<--- Back to Details
First PageDocument Content
Linear feedback shift register / SNOW / Block cipher modes of operation / Serpent / Primitive polynomial / Q / Grain / Cryptography / Stream ciphers / SOSEMANUK
Date: 2005-06-21 11:27:49
Linear feedback shift register
SNOW
Block cipher modes of operation
Serpent
Primitive polynomial
Q
Grain
Cryptography
Stream ciphers
SOSEMANUK

Sosemanuk, a fast software-oriented stream cipher∗ C. Berbain1 , O. Billet1 , A. Canteaut2 , N. Courtois3 , H. Gilbert1 , L. Goubin4 , A. Gouget5 , L. Granboulan6 , C. Lauradoux2 , M. Minier2 , T. Pornin7 and H. Sibert

Add to Reading List

Source URL: www.ecrypt.eu.org

Download Document from Source Website

File Size: 241,97 KB

Share Document on Facebook

Similar Documents

The modpn Library: Bringing Fast Polynomial Arithmetic into Maple Xin Li Marc Moreno Maza Raqeeb Rasheed

The modpn Library: Bringing Fast Polynomial Arithmetic into Maple Xin Li Marc Moreno Maza Raqeeb Rasheed

DocID: 1qv76 - View Document

POLYDIV: Enhanced Polynomial Division Francis J. Wright School of Mathematical Sciences Queen Mary and Westfield College University of London Mile End Road, London E1 4NS, UK.

POLYDIV: Enhanced Polynomial Division Francis J. Wright School of Mathematical Sciences Queen Mary and Westfield College University of London Mile End Road, London E1 4NS, UK.

DocID: 1pVMv - View Document

Improved algorithms for solving bivariate systems via Rational Univariate Representations Yacine Bouzidi, Sylvain Lazard, Guillaume Moroz, Marc Pouget, Fabrice Rouillier, Michael Sagraloff  To cite this version:

Improved algorithms for solving bivariate systems via Rational Univariate Representations Yacine Bouzidi, Sylvain Lazard, Guillaume Moroz, Marc Pouget, Fabrice Rouillier, Michael Sagraloff To cite this version:

DocID: 1lVp4 - View Document

The Mathematics of Coding: Information, Compression, Error Correction, and Finite Fields

The Mathematics of Coding: Information, Compression, Error Correction, and Finite Fields

DocID: 1gbjE - View Document

Number Fields Introduction A number field is a field of finite degree over Q. By the Primitive Element Theorem, any number field K = Q(α) for some α ∈ K. The minimal polynomial Let K be a number field and let α ∈

Number Fields Introduction A number field is a field of finite degree over Q. By the Primitive Element Theorem, any number field K = Q(α) for some α ∈ K. The minimal polynomial Let K be a number field and let α ∈

DocID: 1bnyB - View Document