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

Covering Sequences of Boolean Functions and Their Cryptographic Significance

โœ Scribed by C. Carlet; Yu. Tarannikov

Book ID
110332320
Publisher
Springer
Year
2002
Tongue
English
Weight
135 KB
Volume
25
Category
Article
ISSN
0925-1022

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

Cryptographic Boolean Functions and Appl
Cryptographic Boolean Functions and Applications || Fourier analysis of Boolean functions
โœ Cusick, Thomas W. ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier ๐ŸŒ English โš– 184 KB

Boolean functions are the building blocks of symmetric cryptographic systems. Symmetrical cryptographic algorithms are fundamental tools in the design of all types of digital security systems (i.e. communications, financial and e-commerce). Cryptographic Boolean Functions and Applications is a