bokomslag Quantum Algorithms for Cryptographically Significant Boolean Functions
Data & IT

Quantum Algorithms for Cryptographically Significant Boolean Functions

Tharrmashastha Sapv Debajyoti Bera Arpita Maitra Subhamoy Maitra

Pocket

959:-

Funktionen begränsas av dina webbläsarinställningar (t.ex. privat läge).

Uppskattad leveranstid 5-10 arbetsdagar

Fri frakt för medlemmar vid köp för minst 249:-

  • 118 sidor
  • 2021
This book is a timely report of the state-of-the-art analytical techniques in the domain of quantum algorithms related to Boolean functions. It bridges the gap between recent developments in the area and the hands-on analysis of the spectral properties of Boolean functions from a cryptologic viewpoint. Topics covered in the book include Qubit, DeutschJozsa and Walsh spectrum, Grovers algorithm, Simons algorithm and autocorrelation spectrum. The book aims at encouraging readers to design and implement practical algorithms related to Boolean functions. Apart from combinatorial techniques, this book considers implementing related programs in a quantum computer. Researchers, practitioners and educators will find this book valuable.
  • Författare: Tharrmashastha Sapv, Debajyoti Bera, Arpita Maitra, Subhamoy Maitra
  • Format: Pocket/Paperback
  • ISBN: 9789811630606
  • Språk: Engelska
  • Antal sidor: 118
  • Utgivningsdatum: 2021-07-20
  • Förlag: Springer Verlag, Singapore