Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

Product cipher

Cryptographic Algorithm

A product cipher is a cipher that combines two or more transformations in a way meant to make the result more secure, and more resistant to cryptanalysis, than any one of the components alone. It typically chains simple operations such as substitution through an S-box, permutation through a P-box, and modular arithmetic. The idea is credited to Claude Shannon, who presented it in his foundational paper Communication Theory of Secrecy Systems. When all of the constituent round functions share the same structure, the design is called an iterative cipher and the repetitions are called rounds. A product cipher that uses only substitutions and permutations is called an SP-network, and Feistel ciphers are an important class of product ciphers. IBM used the alternating substitution and permutation approach in the Lucifer cipher system, and it became the standard pattern for national encryption standards such as the Data Encryption Standard and the Advanced Encryption Standard.

Connections

Credited To

Source Product cipher (Wikipedia)

In Field

Cryptography, Fields
Source Product cipher (Wikipedia)

Invented

Source Product cipher (Wikipedia)
Sources
Product cipher (Wikipedia)
  • In Field: Cryptography, Lead
    In cryptography, a product cipher combines two or more transformations
  • Invented: Claude Shannon, Lead, concept credit
    The concept of product ciphers is due to Claude Shannon
  • In Group: Cryptographic Techniques, Lead, technique
    In cryptography, a product cipher combines two or more transformations in a manner intending that the resulting cipher is more secure than the individual components
  • Credited To: Claude Shannon, Lead, credit
    The concept of product ciphers is due to Claude Shannon
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.