Quantum algorithms for cryptographically significant Boolean functions. An IBMQ experience

DOI10.1007/978-981-16-3061-3MaRDI QIDQ5003196zbMATH OpenOpenAlexFDO

Authors Tharrmashastha Sapv, Debajyoti Bera, Arpita Maitra, Subhamoy Maitra

Publication date 20 July 2021

Published in SpringerBriefs in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-981-16-3061-3

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Quantum algorithms and complexity in the theory of computing (68Q12) Cryptography (94A60) Boolean functions (94D10)

Recommendations

• Simplified Quantum Computing with Applications
• THE DEUTSCH–JOZSA ALGORITHM REVISITED IN THE DOMAIN OF CRYPTOGRAPHICALLY SIGNIFICANT BOOLEAN FUNCTIONS
• Boolean functions for cryptography and coding theory
• Quantum algorithms via linear algebra. A primer
• Cryptographic Boolean functions and applications.

Cited in

(1)

• Implementation and analysis of ciphers in quantum computing

This page was built for publication: Quantum algorithms for cryptographically significant Boolean functions. An IBMQ experience

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5003196)