Progress in applications of Boolean functions /
Saved in:
Imprint: | San Rafael, Calif. (1537 Fourth Street, San Rafael, CA 94901 USA) : Morgan and Claypool Publishers, c2010. |
---|---|
Description: | 1 electronic text (xiv, 139 pages : illustrations) : digital file. |
Language: | English |
Series: | Synthesis lectures on digital circuits and systems, 1932-3174 ; # 26 Synthesis lectures on digital circuits and systems (Online), # 26. |
Subject: | |
Format: | E-Resource Book |
URL for this record: | http://pi.lib.uchicago.edu/1001/cat/bib/8512848 |
Other authors / contributors: | Sasao, Tsutomu, 1950- Butler, Jon T. |
---|---|
ISBN: | 9781608451821 (electronic bk.) 9781608451814 (pbk.) |
Notes: | Title from PDF t.p. (viewed on January 11, 2010). Series from website. Includes bibliographical references and index. Abstract freely available; full-text restricted to subscribers or individual document purchasers. Also available in printing. Mode of access: World Wide Web. System requirements: Adobe Acrobat reader. |
Summary: | This book brings together five topics on the application of Boolean functions. They are: 1. Equivalence classes of Boolean functions: The number of n-variable functions is large, even for values as small as n = 6, and there has been much research on classifying functions. There are many classifications, each with its own distinct merit. 2. Boolean functions for cryptography: The process of encrypting/decrypting plaintext messages often depends on Boolean functions with specific properties. For example, highly nonlinear functions are valued because they are less susceptible to linear attacks. 3. Boolean differential calculus: An operation analogous to taking the derivative of a real-valued function offers important insight into the properties of Boolean functions. One can determine tests or susceptibility to hazards. 4. Reversible logic: Most logic functions are irreversible; it is impossible to reconstruct the input, given the output. However, Boolean functions that are reversible are necessary for quantum computing, and hold significant promise for low-power computing. 5. Data mining: The process of extracting subtle patterns from enormous amounts of data has benefited from the use of a graph-based representation of Boolean functions. This has use in surveillance, fraud detection, scientific discovery including bio-informatics, genetics, medicine, and education. Written by experts, these chapters present a tutorial view of new and emerging technologies in Boolean functions. |
Standard no.: | 10.2200/S00243ED1V01Y200912DCS026 |
Similar Items
-
Boolean functions and their applications in cryptography /
by: Wu, Chuan-Kun
Published: (2016) -
Cryptographic Boolean functions and applications /
by: Cusick, Thomas W., 1943-
Published: (2009) -
Boolean functions in cryptology and information security /
Published: (2008) -
Cryptographic Boolean functions and applications /
by: Cusick, Thomas W., 1943-
Published: (2017) -
Countable Boolean algebras and decidability /
by: Goncharov, S. S.
Published: (1997)