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

Quantum Cryptography and Hardness of Non-Collapsing Measurements

Tomoyuki Morimae, Yuki Shirakawa, Takashi Yamakawa

Year
2025
Journal
arXiv preprint
DOI
arXiv:2510.04448
arXiv
2510.04448

One-way puzzles (OWPuzzs) introduced by Khurana and Tomer [STOC 2024] are a natural quantum analogue of one-way functions (OWFs), and one of the most fundamental primitives in ''Microcrypt'' where OWFs do not exist but quantum cryptography is possible. OWPuzzs are implied by almost all quantum cryptographic primitives, and imply several important applications such as non-interactive commitments and multi-party computations. A significant goal in the field of quantum cryptography is to base OWPuzzs on plausible assumptions that will not imply OWFs. In this paper, we base OWPuzzs on hardness of non-collapsing measurements. To that end, we introduce a new complexity class, $\mathbf{SampPDQP}$, which is a sampling version of the decision class $\mathbf{PDQP}$ introduced in [Aaronson, Bouland, Fitzsimons, and Lee, ITCS 2016]. We show that if $\mathbf{SampPDQP}$ is hard on average for quantum polynomial time, then OWPuzzs exist. $\mathbf{SampPDQP}$ is the class of sampling problems that can be solved by a classical polynomial-time algorithm that can make a single query to a non-collapsing measurement oracle, which is a ''magical'' oracle that can sample measurement results on quantum states without collapsing the states. Such non-collapsing measurements are highly unphysical operations that should be hard to realize in quantum polynomial-time. We also study upperbounds of the hardness of $\mathbf{SampPDQP}$. We introduce a new primitive, distributional collision-resistant puzzles (dCRPuzzs), which are a natural quantum analogue of distributional collision-resistant hashing [Dubrov and Ishai, STOC 2006]. We show that dCRPuzzs imply average-case hardness of $\mathbf{SampPDQP}$ (and therefore OWPuzzs as well). We also show that two-message honest-statistically-hiding commitments with classical communication and one-shot signatures [Amos, Georgiou, Kiayias, Zhandry, STOC 2020] imply dCRPuzzs.

Open paper