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

Tradeoffs on the volume of fault-tolerant circuits

Anirudh Krishna, Gilles Zémor

Year

2025

Journal

arXiv preprint

DOI

arXiv:2510.03057

arXiv

2510.03057

Dating back to the seminal work of von Neumann [von Neumann, Automata Studies, 1956], it is known that error correcting codes can overcome faulty circuit components to enable robust computation. Choosing an appropriate code is non-trivial as it must balance several requirements. Increasing the rate of the code reduces the relative number of redundant bits used in the fault-tolerant circuit, while increasing the distance of the code ensures robustness against faults. If the rate and distance were the only concerns, we could use asymptotically optimal codes as is done in communication settings. However, choosing a code for computation is challenging due to an additional requirement: The code needs to facilitate accessibility of encoded information to enable computation on encoded data. This seems to conflict with having large rate and distance. We prove that this is indeed the case, namely that a code family cannot simultaneously have constant rate, growing distance and short-depth gadgets to perform encoded CNOT gates. As a consequence, achieving good rate and distance may necessarily entail accepting very deep circuits, an undesirable trade-off in certain architectures and applications.

Open paper