Compare Papers

Paper 1

Advances in Quantum-Secure Banking: Cryptographic Solutions

Timothy Olatunji Ogundola

Year

2020

Journal

International Journal of Science and Research Archive

DOI

10.30574/ijsra.2020.1.1.0048

arXiv

-

Quantum computers are moving so quickly that they now threaten the cryptographic tools banks rely on every day. Shorts algorithm alone puts RSA and ECC at risk, and even Grovers speed-up shortens the lifespan of most symmetric keys. Faced with these dangers, the finance industry must switch to quantum-safe schemes without delay. This study reviews the newest post-quantum options that are being built for payments, lending, and other banking functions. Drawing on NISTs standardization work, live pilots at top banks, and head-to-head tests of lattice, code, multivariate, hash, and isogeny methods, we map out practical upgrade paths. Our analysis finds that lattice packages such as CRYSTALS-Kyber and Di lithium strike the best balance of performance and maturity today, while hybrid setups and crypto-agility keep systems future-proof. We therefore urge firms to roll out new algorithms in stages, work with regulators, and share lessons across the sector so they remain secure in a quantum world.

Open paper

Paper 2

Proofs of quantum memory

Minki Hhan, Tomoyuki Morimae, Yasuaki Okinaka, Takashi Yamakawa

Year

2025

Journal

arXiv preprint

DOI

arXiv:2510.04159

arXiv

2510.04159

With the rapid advances in quantum computer architectures and the emerging prospect of large-scale quantum memory, it is becoming essential to classically verify that remote devices genuinely allocate the promised quantum memory with specified number of qubits and coherence time. In this paper, we introduce a new concept, proofs of quantum memory (PoQM). A PoQM is an interactive protocol between a classical probabilistic polynomial-time (PPT) verifier and a quantum polynomial-time (QPT) prover over a classical channel where the verifier can verify that the prover has possessed a quantum memory with a certain number of qubits during a specified period of time. PoQM generalize the notion of proofs of quantumness (PoQ) [Brakerski, Christiano, Mahadev, Vazirani, and Vidick, JACM 2021]. Our main contributions are a formal definition of PoQM and its constructions based on hardness of LWE. Specifically, we give two constructions of PoQM. The first is of a four-round and has negligible soundness error under subexponential-hardness of LWE. The second is of a polynomial-round and has inverse-polynomial soundness error under polynomial-hardness of LWE. As a lowerbound of PoQM, we also show that PoQM imply one-way puzzles. Moreover, a certain restricted version of PoQM implies quantum computation classical communication (QCCC) key exchange.

Open paper