The Resource Boolean functions in cryptology and information security, edited by Bart Preneel and Oleg A. Logachev
Boolean functions in cryptology and information security, edited by Bart Preneel and Oleg A. Logachev
Resource Information
The item Boolean functions in cryptology and information security, edited by Bart Preneel and Oleg A. Logachev represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri-St. Louis Libraries.This item is available to borrow from 1 library branch.
Resource Information
The item Boolean functions in cryptology and information security, edited by Bart Preneel and Oleg A. Logachev represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri-St. Louis Libraries.
This item is available to borrow from 1 library branch.
- Summary
- This book contains the proceedings of the NATO-Russia Advanced Study Institute (ASI) 'Boolean Functions in Cryptology and Information Security', which was held in Zvenigorod, Moscow region, Russia. These proceedings consist of three parts. The first part contains survey lectures on various areas of Boolean function theory that are of primary importance for cryptology. These lectures were delivered by leading researchers from many countries and contain both classic and recent results. The second part contains research papers written by graduate and postgraduate students of Lomonosov University, Moscow. The third part contains a list of open problems in Boolean function theory. The book includes lectures and papers concern the following areas: cryptographic properties of Boolean functions and mappings; algebraic and combinatorial constructions of Boolean functions and mappings with prescribed cryptographic properties; Boolean functions and mappings in cryptosynthesis; classification of Boolean functions; cryptanalysis of ciphers; and, efficient computations in finite fields
- Language
- eng
- Extent
- 1 online resource (viii, 355 pages)
- Contents
-
- Vladimir Anashin
- Classification of the costs of RM(1, 7) in RM(3, 7) revisited
- Yuri Borissov, An Braeken, Svetla Nikova and Bart Preneel
- Conjectures on the number of balanced Boolean functions of bounded degree
- Thomas W. Cusick
- Bit-parallel circuits for arithmetic in finite fields
- Sergey B. Gashkov and Igor S. Sergeev
- On a family of perfect nonlinear binomials
- Tor Helleseth, Gohar Kyureghyan, Geir Jarle Ness and Alexander Pott
- Classification of Boolean quartic forms in eight variables
- Preface
- Philippe Langevin and Gregor Leander
- Local affinity of Boolean mappings
- Oleg A. Logachev, Valery V. Yashchenko and Mikhail P. Denisenko
- Boolean functions on odd number variables having nonlinearity greater than the bent concatenation bound
- Subhamoy Maitra
- Decimation based algebraic and correlation attacks and design of Boolean functions
- Miodrag J. Mihaljević
- Constructing families of Latin squares over Boolean Functions
- Valentin A. Nosov
- On almost perfect nonlinear Boolean functions
- Bart Preneel and Oleg Logachev
- François Rodier
- On the nonexistence of homogeneous rotation symmetric bent Boolean functions of degree greater than two
- Pantelimon Stănică
- On correlation immune Boolean functions
- Yuriy Tarannikov
- A cyclic code approach of bent functions over F2 and Z4
- Jacques Wolfmann
- On balanced nonlinear Boolean functions
- Yuliang Zheng and Xian-Mo Zhang
- Students' talks:
- Invited talks:
- On properties of correlation immune functions with high nonlinearity
- Anton Botev
- Constructing Boolean functions with extremal properties
- Andrey Khalyavin
- Tight bounds between algebraic immunity and nonlinearities of high orders
- Mikhail Lobanov
- On implementation of one type of recursive construction
- Sergey G. Shipunov
- On impossibility of uniform distribution of codewords over spheres
- Maria Yarykina
- Bent rectangles
- On the structure of the spectrum support of Boolean functions
- Alexander Zverev
- Some open problems:
- Open problems in Boolean function theory: the cryptographer's view
- Sergey Agievich
- On algebraic algorithms deciding properties of discrete functions
- Valeriy Alekseev
- Non-Archimedean theory of T-functions
- Isbn
- 9781607503446
- Label
- Boolean functions in cryptology and information security
- Title
- Boolean functions in cryptology and information security
- Statement of responsibility
- edited by Bart Preneel and Oleg A. Logachev
- Language
- eng
- Summary
- This book contains the proceedings of the NATO-Russia Advanced Study Institute (ASI) 'Boolean Functions in Cryptology and Information Security', which was held in Zvenigorod, Moscow region, Russia. These proceedings consist of three parts. The first part contains survey lectures on various areas of Boolean function theory that are of primary importance for cryptology. These lectures were delivered by leading researchers from many countries and contain both classic and recent results. The second part contains research papers written by graduate and postgraduate students of Lomonosov University, Moscow. The third part contains a list of open problems in Boolean function theory. The book includes lectures and papers concern the following areas: cryptographic properties of Boolean functions and mappings; algebraic and combinatorial constructions of Boolean functions and mappings with prescribed cryptographic properties; Boolean functions and mappings in cryptosynthesis; classification of Boolean functions; cryptanalysis of ciphers; and, efficient computations in finite fields
- Cataloging source
- N$T
- Dewey number
- 511.3/24
- Illustrations
- illustrations
- Index
- index present
- LC call number
- QA10.3
- LC item number
- .B66 2008eb
- Literary form
- non fiction
- Nature of contents
-
- dictionaries
- bibliography
- http://library.link/vocab/relatedWorkOrContributorDate
-
- 1963-
- 2007
- http://library.link/vocab/relatedWorkOrContributorName
-
- Preneel, Bart
- Logachev, Oleg A
- North Atlantic Treaty Organization
- NATO Science for Peace and Security Programme
- NATO Advanced Study Institute on Boolean Functions in Cryptology and Information Security
- Series statement
- NATO science for peace and security series. D, Information and communication security,
- Series volume
- v. 18
- http://library.link/vocab/subjectName
-
- Algebra, Boolean
- Cryptography
- Computer security
- MATHEMATICS
- Algebra, Boolean
- Computer security
- Cryptography
- Label
- Boolean functions in cryptology and information security, edited by Bart Preneel and Oleg A. Logachev
- Antecedent source
- unknown
- Bibliography note
- Includes bibliographical references and indexes
- Carrier category
- online resource
- Carrier category code
-
- cr
- Carrier MARC source
- rdacarrier
- Color
- multicolored
- Content category
- text
- Content type code
-
- txt
- Content type MARC source
- rdacontent
- Contents
-
- Vladimir Anashin
- Classification of the costs of RM(1, 7) in RM(3, 7) revisited
- Yuri Borissov, An Braeken, Svetla Nikova and Bart Preneel
- Conjectures on the number of balanced Boolean functions of bounded degree
- Thomas W. Cusick
- Bit-parallel circuits for arithmetic in finite fields
- Sergey B. Gashkov and Igor S. Sergeev
- On a family of perfect nonlinear binomials
- Tor Helleseth, Gohar Kyureghyan, Geir Jarle Ness and Alexander Pott
- Classification of Boolean quartic forms in eight variables
- Preface
- Philippe Langevin and Gregor Leander
- Local affinity of Boolean mappings
- Oleg A. Logachev, Valery V. Yashchenko and Mikhail P. Denisenko
- Boolean functions on odd number variables having nonlinearity greater than the bent concatenation bound
- Subhamoy Maitra
- Decimation based algebraic and correlation attacks and design of Boolean functions
- Miodrag J. Mihaljević
- Constructing families of Latin squares over Boolean Functions
- Valentin A. Nosov
- On almost perfect nonlinear Boolean functions
- Bart Preneel and Oleg Logachev
- François Rodier
- On the nonexistence of homogeneous rotation symmetric bent Boolean functions of degree greater than two
- Pantelimon Stănică
- On correlation immune Boolean functions
- Yuriy Tarannikov
- A cyclic code approach of bent functions over F2 and Z4
- Jacques Wolfmann
- On balanced nonlinear Boolean functions
- Yuliang Zheng and Xian-Mo Zhang
- Students' talks:
- Invited talks:
- On properties of correlation immune functions with high nonlinearity
- Anton Botev
- Constructing Boolean functions with extremal properties
- Andrey Khalyavin
- Tight bounds between algebraic immunity and nonlinearities of high orders
- Mikhail Lobanov
- On implementation of one type of recursive construction
- Sergey G. Shipunov
- On impossibility of uniform distribution of codewords over spheres
- Maria Yarykina
- Bent rectangles
- On the structure of the spectrum support of Boolean functions
- Alexander Zverev
- Some open problems:
- Open problems in Boolean function theory: the cryptographer's view
- Sergey Agievich
- On algebraic algorithms deciding properties of discrete functions
- Valeriy Alekseev
- Non-Archimedean theory of T-functions
- Control code
- 285284518
- Dimensions
- unknown
- Extent
- 1 online resource (viii, 355 pages)
- File format
- unknown
- Form of item
- online
- Isbn
- 9781607503446
- Level of compression
- unknown
- Media category
- computer
- Media MARC source
- rdamedia
- Media type code
-
- c
- Other physical details
- illustrations
- http://library.link/vocab/ext/overdrive/overdriveId
- 978-1-58603-878-6
- Quality assurance targets
- not applicable
- Reformatting quality
- unknown
- Sound
- unknown sound
- Specific material designation
- remote
- System control number
- (OCoLC)285284518
- Label
- Boolean functions in cryptology and information security, edited by Bart Preneel and Oleg A. Logachev
- Antecedent source
- unknown
- Bibliography note
- Includes bibliographical references and indexes
- Carrier category
- online resource
- Carrier category code
-
- cr
- Carrier MARC source
- rdacarrier
- Color
- multicolored
- Content category
- text
- Content type code
-
- txt
- Content type MARC source
- rdacontent
- Contents
-
- Vladimir Anashin
- Classification of the costs of RM(1, 7) in RM(3, 7) revisited
- Yuri Borissov, An Braeken, Svetla Nikova and Bart Preneel
- Conjectures on the number of balanced Boolean functions of bounded degree
- Thomas W. Cusick
- Bit-parallel circuits for arithmetic in finite fields
- Sergey B. Gashkov and Igor S. Sergeev
- On a family of perfect nonlinear binomials
- Tor Helleseth, Gohar Kyureghyan, Geir Jarle Ness and Alexander Pott
- Classification of Boolean quartic forms in eight variables
- Preface
- Philippe Langevin and Gregor Leander
- Local affinity of Boolean mappings
- Oleg A. Logachev, Valery V. Yashchenko and Mikhail P. Denisenko
- Boolean functions on odd number variables having nonlinearity greater than the bent concatenation bound
- Subhamoy Maitra
- Decimation based algebraic and correlation attacks and design of Boolean functions
- Miodrag J. Mihaljević
- Constructing families of Latin squares over Boolean Functions
- Valentin A. Nosov
- On almost perfect nonlinear Boolean functions
- Bart Preneel and Oleg Logachev
- François Rodier
- On the nonexistence of homogeneous rotation symmetric bent Boolean functions of degree greater than two
- Pantelimon Stănică
- On correlation immune Boolean functions
- Yuriy Tarannikov
- A cyclic code approach of bent functions over F2 and Z4
- Jacques Wolfmann
- On balanced nonlinear Boolean functions
- Yuliang Zheng and Xian-Mo Zhang
- Students' talks:
- Invited talks:
- On properties of correlation immune functions with high nonlinearity
- Anton Botev
- Constructing Boolean functions with extremal properties
- Andrey Khalyavin
- Tight bounds between algebraic immunity and nonlinearities of high orders
- Mikhail Lobanov
- On implementation of one type of recursive construction
- Sergey G. Shipunov
- On impossibility of uniform distribution of codewords over spheres
- Maria Yarykina
- Bent rectangles
- On the structure of the spectrum support of Boolean functions
- Alexander Zverev
- Some open problems:
- Open problems in Boolean function theory: the cryptographer's view
- Sergey Agievich
- On algebraic algorithms deciding properties of discrete functions
- Valeriy Alekseev
- Non-Archimedean theory of T-functions
- Control code
- 285284518
- Dimensions
- unknown
- Extent
- 1 online resource (viii, 355 pages)
- File format
- unknown
- Form of item
- online
- Isbn
- 9781607503446
- Level of compression
- unknown
- Media category
- computer
- Media MARC source
- rdamedia
- Media type code
-
- c
- Other physical details
- illustrations
- http://library.link/vocab/ext/overdrive/overdriveId
- 978-1-58603-878-6
- Quality assurance targets
- not applicable
- Reformatting quality
- unknown
- Sound
- unknown sound
- Specific material designation
- remote
- System control number
- (OCoLC)285284518
Subject
- MATHEMATICS -- Algebra | General
- Algebra, Boolean
- Algebra, Boolean -- Congresses
- Computer security
- Computer security -- Congresses
- Conference papers and proceedings
- Cryptography
- Cryptography -- Congresses
- Electronic book
- Electronic books
- Electronic books
Genre
Member of
- NATO science for peace and security series, Sub-series D, Information and communication security, v. 18
- Ebook Central Academic Complete
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.umsl.edu/portal/Boolean-functions-in-cryptology-and-information/VAyXm_xDhUs/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.umsl.edu/portal/Boolean-functions-in-cryptology-and-information/VAyXm_xDhUs/">Boolean functions in cryptology and information security, edited by Bart Preneel and Oleg A. Logachev</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.umsl.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.umsl.edu/">University of Missouri-St. Louis Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data - Experimental
Data Citation of the Item Boolean functions in cryptology and information security, edited by Bart Preneel and Oleg A. Logachev
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.umsl.edu/portal/Boolean-functions-in-cryptology-and-information/VAyXm_xDhUs/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.umsl.edu/portal/Boolean-functions-in-cryptology-and-information/VAyXm_xDhUs/">Boolean functions in cryptology and information security, edited by Bart Preneel and Oleg A. Logachev</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.umsl.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.umsl.edu/">University of Missouri-St. Louis Libraries</a></span></span></span></span></div>
