Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Cambridge University Press eBooks

Quanta, ciphers, and computers

ARTUR K. EKERT

Published Feb 13, 2006• 0 citations
Publisher
DOI
10.1017/cbo9781139644228.015

Related papers

Computing with quanta—impacts of quantum theory on computation

Mika Hirvensalo

Theoretical Computer Science•Sep 1, 2002•5 citations

Quantum computers

Szymon Pustelny

•Jan 1, 2003•0 citations

Quantum Cryptanalysis of Affine Cipher

Mahima Mary Mathews, V. Panchami, Vishnu Ajith

Quantum Algorithms reduce the computational complexity or solve certain difficult problems that were originally impossible to solve with classical computers. Grover’s search algorithm is a Quantum computation algorithm that can find target elements from a set of unstructured data with the best possible,$O(\sqrt {N})$queries. Grover’s search Quantum circuits implemented accurately can be used to successfully search and find the keys of Symmetric ciphers. However, very few demonstrations of such practical cryptanalysis are available. In this paper, practical Quantum cryptanalysis circuits for Affine Cipher are proposed and demonstrated, that successfully break the cipher by finding the keys.

IEEE Journal on Emerging and Selected Topics in Circuits and Systems•Jul 15, 2024•4 citations

Quantum computers

Дядечко, Алла Миколаївна, Алла Николаевна Дядечко, Diadechko, Alla Mykolaivna +1 more

•Jan 1, 2008•0 citations

A Review of Block Ciphers and Its Post-Quantum Considerations

R Chethana, Jayavrinda Vrindavanam V, Subarna Roy +1 more

Recent advances in cryptography aim to address threats posed by quantum computers. However, these advances have focused disproportionately on asymmetric schemes, while symmetric primitives like block ciphers have received less attention. The common assumption is that doubling block cipher key sizes provides adequate quantum resistance, but this oversimplifies the challenge. This paper provides a systematic examination of block cipher security in the quantum computing era. The paper first establishes a formal framework for understanding block cipher security, covering their mathematical foundations and essential security properties. Building on this foundation, we examine how quantum computing fundamentally challenges these security assumptions, going beyond the simple impact on key lengths. Our review of recent research reveals that quantum attacks can exploit structural vulnerabilities in block ciphers and their modes of operation, requiring more comprehensive defenses than key length adjustments alone. We analyze emerging approaches in quantum-resistant design and identify critical areas requiring further research to ensure block cipher security in a post-quantum world.

IEEE Access•Jan 1, 2025•8 citations

Turing, ciphers and quanta

ARTUR K. EKERT, Alastair Kay, James E. Pope

Alan Turing has certainly contributed to a widespread belief that the quest for a perfect, unbreakable, cipher is a futile pursuit. The ancient art of concealing information has, in the past, been matched by the ingenuity of code-breakers, but no longer! With the advent of quantum cryptography, the hopes of would-be eavesdroppers have been dashed, perhaps for good. Moreover, recent research, building on schemes that were invented decades ago to perform quantum cryptography, shows that secure communication certified by a sufficient violation of a Bell inequality makes a seemingly insane scenario possible-devices of unknown or dubious provenance, even those that are manufactured by our enemies, can be safely used for secure communication, including key distribution. All that is needed to implement this bizarre and powerful form of cryptography is a loophole-free test of a Bell inequality, which is on the cusp of technological feasibility. We provide a brief overview of the intriguing connections between Bell inequalities and cryptography and describe how studies of quantum entanglement and the foundations of quantum theory influence the way we may protect information in the future.

Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences•Jun 18, 2012•1 citation
Quantum Algorithms reduce the computational complexity or solve certain difficult problems that were originally impossible to solve with classical computers. Grover’s search algorithm is a Quantum computation algorithm that can find target elements from a set of unstructured data with the best possible,O(N)O(\sqrt {N})O(N​)queries. Grover’s search Quantum circuits implemented accurately can be used to successfully search and find the keys of Symmetric ciphers. However, very few demonstrations of such practical cryptanalysis are available. In this paper, practical Quantum cryptanalysis circuits for Affine Cipher are proposed and demonstrated, that successfully break the cipher by finding the keys.
Recent advances in cryptography aim to address threats posed by quantum computers. However, these advances have focused disproportionately on asymmetric schemes, while symmetric primitives like block ciphers have received less attention. The common assumption is that doubling block cipher key sizes provides adequate quantum resistance, but this oversimplifies the challenge. This paper provides a systematic examination of block cipher security in the quantum computing era. The paper first establishes a formal framework for understanding block cipher security, covering their mathematical foundations and essential security properties. Building on this foundation, we examine how quantum computing fundamentally challenges these security assumptions, going beyond the simple impact on key lengths. Our review of recent research reveals that quantum attacks can exploit structural vulnerabilities in block ciphers and their modes of operation, requiring more comprehensive defenses than key length adjustments alone. We analyze emerging approaches in quantum-resistant design and identify critical areas requiring further research to ensure block cipher security in a post-quantum world.
Alan Turing has certainly contributed to a widespread belief that the quest for a perfect, unbreakable, cipher is a futile pursuit. The ancient art of concealing information has, in the past, been matched by the ingenuity of code-breakers, but no longer! With the advent of quantum cryptography, the hopes of would-be eavesdroppers have been dashed, perhaps for good. Moreover, recent research, building on schemes that were invented decades ago to perform quantum cryptography, shows that secure communication certified by a sufficient violation of a Bell inequality makes a seemingly insane scenario possible-devices of unknown or dubious provenance, even those that are manufactured by our enemies, can be safely used for secure communication, including key distribution. All that is needed to implement this bizarre and powerful form of cryptography is a loophole-free test of a Bell inequality, which is on the cusp of technological feasibility. We provide a brief overview of the intriguing connections between Bell inequalities and cryptography and describe how studies of quantum entanglement and the foundations of quantum theory influence the way we may protect information in the future.