๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Construction of Cryptographically Important Boolean Permutations

โœ Scribed by Wenying Zhang; Chuan-Kun Wu; Shiqu Li

Publisher
Springer
Year
2004
Tongue
English
Weight
114 KB
Volume
15
Category
Article
ISSN
0938-1279

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Symmetry Groups of Boolean Functions and
Symmetry Groups of Boolean Functions and Constructions of Permutation Groups
โœ Andrzej Kisielewicz ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 273 KB

In this paper we deal with the symmetry group S f of a boolean function f on n-variables, that is, the set of all permutations on n elements which leave f invariant. The main problem is that of concrete representation: which permutation ลฝ . groups on n elements can be represented as G s S f for some

Enumerating Boolean functions of cryptog
Enumerating Boolean functions of cryptographic significance
โœ Chris Mitchell ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Springer ๐ŸŒ English โš– 803 KB

In this paper we describe applications of functions from GF(2) m onto GF(2)" in the design of encryption algorithms. If such a function is to be useful it must satisfy a set of criteria, the actual definition of which depends on the type of encryption technique involved. This in turn means that it i

Construction of pseudorandom permutation
Construction of pseudorandom permutations
โœ Yasuhiro Ohnishi; Akira Maruoka ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 682 KB

## Abstract The permutation from {0, 1}^__2n__^ to {0, 1}^__2n__^ represented by __S(f)__ in DES (Data Encryption Standard) is used as the basic operation. Let __f__ be a function from {0, 1}^__n__^ to {0, 1}^__n__^ and โŠ• denote bitwise exclusive or. Then __S(f)__ is defined __S(f)(L.R) = R.[LโŠ•f(R)