Kniha Boolean Functions: Cryptographic And Combinatorial Properties - Functions With Symmetry S. Maitra

Boolean Functions: Cryptographic And Combinatorial Properties - Functions With Symmetry

Autor: S. Maitra
Jazyk: Angličtina
Vazba: Pevná
Dostupnost: 50 % šance
Prohledáme celý svět
3 630
This book discusses cryptographic and combinatorial properties of Boolean functions. Boolean functio...

Informace o knize

Autor
Jazyk
Angličtina
Vazba
Kniha - Pevná
Vydáno
2018
Stránek
420
EAN
9789814327138
ISBN
9814327131
Enbook ID
05070292
Hmotnost
562

Kompletní popis

This book discusses cryptographic and combinatorial properties of Boolean functions. Boolean functions are very easy to understand (but deep in analysis) and the subject covers significant amount of material in digital circuits, communication theory, VLSI design, computer science, coding theory and Mathematics. Boolean function is considered as one of the most basic building blocks in cryptographic system design. The properties that make a Boolean function suitable for a cryptographic system, are mostly combinatorial. We discuss these properties (e.g., balancedness, nonlinearity, correlation immunity, propagation characteristics, algebraic immunity) in detail. For each of the properties, existing research results and the recent contributions in the literature will be presented. The basic material will always contain hardcore theoretical results. However, we present the materials in a way that a person with undergraduate level mathematical background can access it. Implementation details related to these properties (e.g., how to check in writing a program whether a Boolean function is correlation immune) will be detailed. In addition to theoretical construction techniques for Boolean functions with different combinatorial and cryptographic properties, the book will concentrate on different state-of-the-art search techniques. In some cases these search techniques provide better results than the construction techniques for low number of input variables and they are quite interesting as the size of the complete set of Boolean functions is super exponential in the number of input variables. Different symmetries in the set of Boolean functions will also be presented in detail. The author will present the inherent beauty of Boolean functions that he has experienced in his research career.

Mohlo by vás zajímat

2 462
706

Le Corbusier Paper Models

Marc Hagan-Guirey
398

Making Good

Tina Loo
1 910

Murdle: Volume 1

G. T. Karber
264

A New System of Geography

Anton Friedrich Busching
887
290
351

Iron Flame

Rebecca Yarros
235

Dot to Dot: Puppy

Angela Hewitt
50

Li'l Bud

William Reynolds
444
2 795

Human Lives

Jacqueline A. Laing
2 567
2 286

Atomic Physics 8

I. Lindgren
1 147

Zákaznicí kteří koupili tuto knihu koupili také

560

Paul, Lisa & Co PLUS A1.1

Manuela Georgiakaki
253

Kücük Hayvanlar

Bahar Havzali sener
183
179

Streichquartett

Anton Webern
404

Kornnattern

Wolfgang Schmidt
370

Vaterland

Robert Harris
280