Boolean functions in coding theory and cryptography (Record no. 55973)

MARC details
000 -LEADER
fixed length control field 04088nam a22002297a 4500
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20191121122454.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 191121b ||||| |||| 00| 0 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781470437374
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 003.54 LOG
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name Oleg A Logachev
-- ; A A Salʹnikov
-- ; V V I︠A︡shchenko
245 ## - TITLE STATEMENT
Title Boolean functions in coding theory and cryptography
Statement of responsibility, etc /Oleg A Logachev
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication, distribution, etc Providence, R.I.
Name of publisher, distributor, etc : American Mathematical Society
Date of publication, distribution, etc , ©2012.
300 ## - PHYSICAL DESCRIPTION
Extent xiv, 334 pages
Dimensions ; 26 cm.
365 ## - TRADE PRICE
Price amount 00
490 ## - SERIES STATEMENT
Series statement Translations of mathematical monographs, v. 241.
505 ## - FORMATTED CONTENTS NOTE
Contents note Ch. 1 Arithmetics of Finite Fields and Polynomials --<br/>1.1. Basic Algebra --<br/>1.2. Construction of finite fields --<br/>1.3. Polynomials over finite fields --<br/>Comments to Chapter 1 --<br/>ch. 2 Boolean Functions --<br/>2.1. Basic concepts and definitions --<br/>2.2. Numerical and metric characteristics --<br/>2.3. Autocorrelation and crosscorrelation --<br/>2.4. Group algebra of Boolean functions --<br/>2.5. Cryptographic properties of Boolean functions and mappings --<br/>2.6. Covering sequences of Boolean functions --<br/>Comments to Chapter 2 --<br/>ch. 3 Classifications of Boolean Functions --<br/>3.1. Group equivalence of mappings. Polya's theorem --<br/>3.2. Classification of Boolean functions of five variables --<br/>3.3. Classification of quadratic Boolean functions --<br/>3.4. Classification of homogeneous cubic forms of 8 variables --<br/>3.5. RM-equivalence of Boolean functions --<br/>Comments to Chapter 3 --<br/>ch. 4 Linear Codes over the Field F2 --<br/>4.1. Basic properties of linear block codes --<br/>4.2. decoding problem --<br/>4.3. Cyclic codes --<br/>4.4. Some classes of primitive cyclic codes --<br/>Comments to Chapter 4 --<br/>ch. 5 Reed-Muller Codes --<br/>5.1. General properties of the Reed-Muller codes --<br/>5.2. Reed's decoding algorithm --<br/>5.3. First order Reed-Muller codes and connections with other codes --<br/>5.4. Reed-Muller codes of second order and related codes --<br/>5.5. Classification of Boolean functions and Reed-Muller codes of the 3rd order --<br/>Comments to Chapter 5 --<br/>ch. 6 Nonlinearity --<br/>6.1. Nonlinearity as a measure of cryptographic quality --<br/>6.2. Maximum-nonlinear bent functions and their properties --<br/>6.3. Some classes of maximum-nonlinear bent functions --<br/>6.4. Partially maximum-nonlinear (partially bent) functions and their properties --<br/>6.5. Plateaued functions and partially defined mn-bent functions --<br/>6.6. Hyperbent functions --<br/>6.7. Biorthogonal bases --<br/>Comments to Chapter 6 --<br/>ch. 7 Correlation Immunity and Resiliency --<br/>7.1. Main definitions and properties --<br/>7.2. inheritance of properties under restrictions of Boolean functions --<br/>7.3. General methods for constructing correlation-immune functions and resilient mappings --<br/>7.4. Nonlinearity of correlation-immune and resilient functions --<br/>7.5. Construction of resilient Boolean functions with good cryptographic properties --<br/>7.6. Covering sequences of correlation-immune and resilient functions --<br/>7.7. Quadratic resilient Boolean functions of maximum order --<br/>Comments to Chapter 7 --<br/>ch. 8 Codes, Boolean Mappings, and Their Cryptographic Properties --<br/>8.1. Almost perfect nonlinear and almost bent mappings --<br/>8.2. Coding-theoretic approach to the study of APN and AB mappings --<br/>8.3. Cyclic codes and Boolean mappings --<br/>8.4. Avalanche criteria and propagation criteria --<br/>8.5. Construction of Boolean functions satisfying the propagation criterion of degree m and order t --<br/>8.6. Global avalanche characteristics of Boolean functions --<br/>Comments to Chapter 8 --<br/>ch. 9 Basics of Cryptanalysis --<br/>9.1. Berlekamp-Massey algorithm. Linear complexity --<br/>9.2. Principles of the statistical method for cryptanalysis of block ciphers --<br/>9.3. Principles of the correlation cryptanalysis method --<br/>9.4. Principles of the linear cryptanalysis method --<br/>9.5. Principles of the difference (differential) cryptanalysis method --<br/>Comments to Chapter 9.
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Cryptography
655 ## - INDEX TERM--GENRE/FORM
Genre/form data or focus term Coding theory
Non-focus term Algebra, Boolean
700 ## - ADDED ENTRY--PERSONAL NAME
Personal name A A Salʹnikov
700 ## - ADDED ENTRY--PERSONAL NAME
Personal name ; V V I︠A︡shchenko
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type Books
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Home library Current library Date acquired Source of acquisition Cost, normal purchase price Total Checkouts Full call number Barcode Date last seen Date checked out Price effective from Koha item type Public note
    Dewey Decimal Classification     SNU LIBRARY SNU LIBRARY 21/11/2019 Maths Gifted Book 0.00 1 003.54 LOG G1569 09/05/2023 02/05/2023 21/11/2019 Books Maths Gifted Book

© Copyright Shiv Nadar University 2012. All Rights Reserved.  Disclaimer |  Sitemap
The Shiv Nadar University has been established under U.P. Act No 12 of 2011. Shiv Nadar University is UGC Approved.