Logo
Unionpedia
Communication
Get it on Google Play
New! Download Unionpedia on your Android™ device!
Download
Faster access than browser!
 

Lai–Massey scheme and Permutation box

Shortcuts: Differences, Similarities, Jaccard Similarity Coefficient, References.

Difference between Lai–Massey scheme and Permutation box

Lai–Massey scheme vs. Permutation box

The Lai–Massey scheme is a cryptographic structure used in the design of block ciphers. In cryptography, a permutation box (or P-box) is a method of bit-shuffling used to permute or transpose bits across S-boxes inputs, retaining diffusion while transposing.

Similarities between Lai–Massey scheme and Permutation box

Lai–Massey scheme and Permutation box have 2 things in common (in Unionpedia): Block cipher, Permutation.

Block cipher

In cryptography, a block cipher is a deterministic algorithm operating on fixed-length groups of bits, called a block, with an unvarying transformation that is specified by a symmetric key.

Block cipher and Lai–Massey scheme · Block cipher and Permutation box · See more »

Permutation

In mathematics, the notion of permutation relates to the act of arranging all the members of a set into some sequence or order, or if the set is already ordered, rearranging (reordering) its elements, a process called permuting.

Lai–Massey scheme and Permutation · Permutation and Permutation box · See more »

The list above answers the following questions

Lai–Massey scheme and Permutation box Comparison

Lai–Massey scheme has 7 relations, while Permutation box has 13. As they have in common 2, the Jaccard index is 10.00% = 2 / (7 + 13).

References

This article shows the relationship between Lai–Massey scheme and Permutation box. To access each article from which the information was extracted, please visit:

Hey! We are on Facebook now! »