Cryptographic Boolean Functions and Applications, Cusick, Thomas W.
Автор: Mendelson, Elliot, Название: Schaum`s outline of Boolean algebra and switching circuits ISBN: 0070414602 ISBN-13(EAN): 9780070414600 Издательство: McGraw-Hill Рейтинг: Цена: 986 р. Наличие на складе: Есть (4 шт.) Описание: Schaum`s Outlines present all the essential course information in an easy-to-follow, topic-by-topic format. You also get hundreds of examples, solved problems, and practice exercises to test your skills.
Автор: Pascal Paillier; Ingrid Verbauwhede Название: Cryptographic Hardware and Embedded Systems - CHES 2007 ISBN: 3540747346 ISBN-13(EAN): 9783540747345 Издательство: Springer Рейтинг: Цена: 13774 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Constitutes the refereed proceedings of the 9th International Workshop on Cryptographic Hardware and Embedded Systems, CHES 2007, held in Vienna, Austria, September 10-13, 2007. This book presents 31 revised full papers that were reviewed and selected from 99 submissions.
Описание: The book introduces new ways of using analytic number theory in cryptography and related areas, such as complexity theory and pseudorandom number generation.Cryptographers and number theorists will find this book useful. The former can learn about new number theoretic techniques which have proved to be invaluable cryptographic tools, the latter about new challenging areas of applications of their skills.
Автор: Micciancio Daniele, Goldwasser Shafi Название: Complexity of Lattice Problems / A Cryptographic Perspective ISBN: 0792376889 ISBN-13(EAN): 9780792376880 Издательство: Springer Рейтинг: Цена: 27544 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Complexity of Lattice Problems: A Cryptographic Perspective is an essential reference for those researching ways in which lattice problems can be used to build cryptographic systems. It will also be of interest to those working in computational complexity, combinatorics, and foundations of cryptography.The book presents a self-contained overview of the state of the art in the complexity of lattice problems, with particular emphasis on problems that are related to the construction of cryptographic functions. Specific topics covered are the strongest known inapproximability result for the shortest vector problem; the relations between this and other computational lattice problems; an exposition of how cryptographic functions can be built and prove secure based on worst-case hardness assumptions about lattice problems; and a study of the limits of non-approximability of lattice problems. Some background in complexity theory, but no prior knowledge about lattices, is assumed.The aim of the authors is to make lattice-based cryptography accessible to a wide audience, ultimately yielding further research and applications. Complexity of Lattice Problems: A Cryptographic Perspective will be valuable to anyone working in this fast-moving field. It serves as an excellent reference, providing insight into some of the most challenging issues being examined today.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru