Контакты/Проезд  Доставка и Оплата Помощь/Возврат
История
  +7(495) 980-12-10
  пн-пт: 10-18 сб,вс: 11-18
  shop@logobook.ru
   
    Поиск книг                    Поиск по списку ISBN Расширенный поиск    
Найти
  Зарубежные издательства Российские издательства  
Авторы | Каталог книг | Издательства | Новинки | Учебная литература | Акции | Хиты | |
 

Construction and analysis of cryptographic functions, Budaghyan, Lilya


Варианты приобретения
Цена: 13974.00р.
Кол-во:
Наличие: Поставка под заказ.  Есть в наличии на складе поставщика.
Склад Америка: Есть  
При оформлении заказа до: 2025-07-28
Ориентировочная дата поставки: Август-начало Сентября
При условии наличия книги у поставщика.

Добавить в корзину
в Мои желания

Автор: Budaghyan, Lilya
Название:  Construction and analysis of cryptographic functions
ISBN: 9783319129907
Издательство: Springer
Классификация:




ISBN-10: 3319129902
Обложка/Формат: Hardcover
Страницы: 176
Вес: 0.40 кг.
Дата издания: 07.01.2015
Язык: English
Издание: 2014 ed.
Иллюстрации: 6 tables, black and white; viii, 168 p.
Размер: 164 x 281 x 14
Читательская аудитория: Professional & vocational
Ссылка на Издательство: Link
Рейтинг:
Поставляется из: Германии
Описание: Construction and Analysis of Cryptographic Functions


Complexity of Lattice Problems / A Cryptographic Perspective

Автор: Micciancio Daniele, Goldwasser Shafi
Название: Complexity of Lattice Problems / A Cryptographic Perspective
ISBN: 0792376889 ISBN-13(EAN): 9780792376880
Издательство: Springer
Рейтинг:
Цена: 25149.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: 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.

Cryptographic Applications of Analytic Number Theory / Complexity Lower Bounds and Pseudorandomness

Автор: Shparlinski Igor
Название: Cryptographic Applications of Analytic Number Theory / Complexity Lower Bounds and Pseudorandomness
ISBN: 3764366540 ISBN-13(EAN): 9783764366544
Издательство: Springer
Рейтинг:
Цена: 15372.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: 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.

Construction and Analysis of Cryptographic Functions

Автор: Lilya Budaghyan
Название: Construction and Analysis of Cryptographic Functions
ISBN: 3319363581 ISBN-13(EAN): 9783319363585
Издательство: Springer
Рейтинг:
Цена: 9781.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book covers novel research on construction and analysis of optimal cryptographic functions such as almost perfect nonlinear (APN), almost bent (AB), planar and bent functions.


ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
   В Контакте     В Контакте Мед  Мобильная версия