iPedia Free Information Center

Information about Cs Cipher

CS-Cipher
General
Jacques Stern and Serge Vaudenay
1998
Cipher detail
Key size(s):| 128 bits
Block size(s):| 64 bits
Feistel network
8


In cryptography, CS-Cipher (for Chiffrement Symétrique) is a block cipher invented by Jacques Stern and Serge Vaudenay in 1998. It was submitted to the NESSIE project, but was not selected.

The algorithm uses a key length between 0 and 128 bits (length must be a multiple of 8 bits). By default, the cipher uses 128 bits. It operates on blocks of 64 bits using an 8-round Feistel network and is optimized for 8-bit processors. The round function is based on the Fast Fourier transform and uses the binary expansion of e as a source of "nothing up my sleeve numbers".

References

Block ciphers
 •  • [ e]
Algorithms: 3-Way | AES | Akelarre | Anubis | ARIA | BaseKing | Blowfish | C2 | Camellia | CAST-128 | CAST-256 | CIKS-1 | CIPHERUNICORN-A | CIPHERUNICORN-E | CMEA | Cobra | COCONUT98 | Crab | CRYPTON | CS-Cipher | DEAL | DES | DES-X | DFC | E2 | FEAL | FROG | G-DES | GOST | Grand Cru | Hasty Pudding Cipher | Hierocrypt | ICE | IDEA | IDEA NXT | Iraqi | Intel Cascade Cipher | KASUMI | KHAZAD | Khufu and Khafre | KN-Cipher | Libelle | LOKI89/91 | LOKI97 | Lucifer | M6 | MacGuffin | Madryga | MAGENTA | MARS | Mercy | MESH | MISTY1 | MMB | MWA | MULTI2 | NewDES | NOEKEON | NUSH | Q | RC2 | RC5 | RC6 | REDOC | Red Pike | S-1 | SAFER | SC2000 | SEED | Serpent | SHACAL | SHARK | Skipjack | SMS4 | Square | TEA | Triple DES | Twofish | UES | Xenon | xmx | XTEA | XXTEA | Zodiac
Design: Feistel network | Key schedule | Product cipher | S-box | SPN Attacks: Brute force | Linear / Differential / Integral cryptanalysis | Mod n | Related-key | Slide | XSL
Standardization: AES process | CRYPTREC | NESSIE Misc: Avalanche effect | Block size | IV | Key size | Modes of operation | Piling-up lemma | Weak key
Cryptography
 •  • [ e]
History of cryptography | Cryptanalysis | | Topics in cryptography
Symmetric-key algorithm | Block cipher | Stream cipher | Public-key cryptography | Cryptographic hash function | Message authentication code | Random numbers
Jacques Stern (born 1949) is a cryptographer, currently a professor at the École Normale Supérieure, where he is Director of the Computer Science Laboratory. He received the 2006 CNRS Gold Medal.
..... Click the link for more information.
Serge Vaudenay (5 April 1968-) is a well-known French cryptographer.

Serge Vaudenay entered the École Normale Supérieure in Paris as a normalien student in 1989. In 1992, he passed the agrégation in mathematics.
..... Click the link for more information.
In cryptography, the key size (alternatively key length) is the size of the digits used to create an encrypted text; it is therefore also a measure of the number of possible keys which can be used in a cipher, and the number of keys which must be tested to 'break' the
..... Click the link for more information.
block size. Both the input (plaintext) and output (ciphertext) are the same length; the output cannot be shorter than the input — this is logically required by the Pigeonhole principle and the fact that the cipher must be invertible — and it is simply undesirable for
..... Click the link for more information.
In cryptography, a Feistel cipher is a block cipher with a symmetric structure, named after IBM cryptographer Horst Feistel; it is also commonly known as a Feistel network. A large proportion of block ciphers use the scheme, including the Data Encryption Standard (DES).
..... Click the link for more information.
Cryptography (or cryptology; derived from Greek κρυπτός kryptós "hidden," and the verb γράφω gráfo "write" or λεγειν legein
..... Click the link for more information.
block cipher is a symmetric key cipher which operates on fixed-length groups of bits, termed blocks, with an unvarying transformation. When encrypting, a block cipher might take a (for example) 128-bit block of plaintext as input, and output a corresponding 128-bit block
..... Click the link for more information.
Jacques Stern (born 1949) is a cryptographer, currently a professor at the École Normale Supérieure, where he is Director of the Computer Science Laboratory. He received the 2006 CNRS Gold Medal.
..... Click the link for more information.
Serge Vaudenay (5 April 1968-) is a well-known French cryptographer.

Serge Vaudenay entered the École Normale Supérieure in Paris as a normalien student in 1989. In 1992, he passed the agrégation in mathematics.
..... Click the link for more information.
19th century - 20th century - 21st century
1960s  1970s  1980s  - 1990s -  2000s  2010s  2020s
1995 1996 1997 - 1998 - 1999 2000 2001

Year 1998 (MCMXCVIII
..... Click the link for more information.
For other uses, see nessie (disambiguation).


NESSIE (New European Schemes for Signatures, Integrity and Encryption) was a European research project funded from 2000–2003 to identify secure cryptographic primitives.
..... Click the link for more information.
In cryptography, a Feistel cipher is a block cipher with a symmetric structure, named after IBM cryptographer Horst Feistel; it is also commonly known as a Feistel network. A large proportion of block ciphers use the scheme, including the Data Encryption Standard (DES).
..... Click the link for more information.
central processing unit (CPU), or sometimes simply processor, is the component in a digital computer capable of executing a program.(Knott 1974) It interprets computer program instructions and processes data.
..... Click the link for more information.
fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse. FFTs are of great importance to a wide variety of applications, from digital signal processing and solving partial differential equations to algorithms for
..... Click the link for more information.
e is the unique real number such that the value of the derivative (slope of the tangent line) of f(x) = ex at the point x = 0 is exactly 1.
..... Click the link for more information.
In cryptography, nothing up my sleeve numbers are any numbers which, by their construction, are above suspicion of hidden properties. They are used in creating cryptographic functions such as hashes and ciphers.
..... Click the link for more information.
For the page description language, see .


A postscript (from post scriptum, a Latin expression meaning "after writing" and abbreviated P.S.
..... Click the link for more information.
block cipher is a symmetric key cipher which operates on fixed-length groups of bits, termed blocks, with an unvarying transformation. When encrypting, a block cipher might take a (for example) 128-bit block of plaintext as input, and output a corresponding 128-bit block
..... Click the link for more information.
3-Way

General
Joan Daemen
1994

NOEKEON
BaseKing

Cipher detail
Key size(s):| 96 bits

Block size(s):| 96 bits
Substitution-permutation network
11
Best public cryptanalysis|-| colspan=2 | related-key attack

In cryptography,
..... Click the link for more information.
AES
The SubBytes step, one of four stages in a round of AES

General
Vincent Rijmen, Joan Daemen
1998

Square
Anubis, Grand Cru

AES winner, CRYPTREC, NESSIE
Cipher detail
Key size(s):| 128, 192 or 256 bits[1]
..... Click the link for more information.
Akelarre

General
G. Álvarez, D. de la Guía, F. Montoya, A. Peinado
1996

IDEA, RC5

Cipher detail
Key size(s):| 128 bits

Block size(s):| 128 bits
Substitution-permutation network
4
..... Click the link for more information.
Anubis

General
Vincent Rijmen and Paulo S. L. M. Barreto
2000

Rijndael

Cipher detail
Key size(s):| 128 to 320 bits in steps of 32 bits

Block size(s):| 128 bits
substitution-permutation network
..... Click the link for more information.
ARIA

General

2003

AES

South Korean standard
Cipher detail
Key size(s):| 128, 192, or 256 bits

Block size(s):| 128 bits
Substitution-permutation network
12, 14, or 16
..... Click the link for more information.
BaseKing

General
Joan Daemen
1994

NOEKEON
3-Way

Cipher detail
Key size(s):| 192 bits

Block size(s):| 192 bits
Substitution-permutation network
11
Best public cryptanalysis|-| colspan=2 | related-key attack, power analysis
..... Click the link for more information.
Blowfish
The round function (Feistel function) of Blowfish

General
Bruce Schneier
1993

Twofish

Cipher detail
Key size(s):| 32-448 bits in steps of 8 bits; default 128 bits

Block size(s):| 64 bits
Feistel network
16
..... Click the link for more information.
Cryptomeria cipher
The Feistel function of the Cryptomeria cipher algorithm.

General
4C Entity
2003

DES

CSS

Cipher detail
Key size(s):| 56 bits

Block size(s):| 64 bits
Feistel network
10

The
..... Click the link for more information.
Camellia

General
Mitsubishi, NTT
2000

E2, MISTY1

CRYPTREC, NESSIE
Cipher detail
Key size(s):| 128, 192 or 256 bits

Block size(s):| 128 bits
Feistel network
18 or 24

In cryptography, Camellia
..... Click the link for more information.
CAST-128
Three rounds of the CAST-128 block cipher

General
Carlisle Adams and Stafford Tavares
1996

CAST-256

Cipher detail
Key size(s):| 40 to 128 bits

Block size(s):| 64 bits
Feistel network
12 or 16
In cryptography,
..... Click the link for more information.
CAST-256

General
Carlisle Adams, Stafford Tavares, Howard Heys, Michael Wiener
1998

CAST-128

Cipher detail
Key size(s):| 128, 192 or 256 bits

Block size(s):| 128 bits
generalised Feistel network
48
In cryptography, CAST-256
..... Click the link for more information.
CIKS-1

General
A.A. Moldovyan and N.A. Moldovyan
January 2002

Spectr-H64

Cipher detail
Key size(s):| 256 bits

Block size(s):| 64 bits
Feistel-like network
8
Best public cryptanalysis|-| colspan=2 | Differential attack using 2
..... Click the link for more information.


This article is copied from an article on Wikipedia.org - the free encyclopedia created and edited by online user community. The text was not checked or edited by anyone on our staff. Although the vast majority of the wikipedia encyclopedia articles provide accurate and timely information please do not assume the accuracy of any particular article. This article is distributed under the terms of GNU Free Documentation License.
Herod_Archelaus


page counter