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

Security bound of cheat sensitive quantum bit commitment

Guang Ping He

Year
2014
Journal
arXiv preprint
DOI
arXiv:1407.7517
arXiv
1407.7517

Cheat sensitive quantum bit commitment (CSQBC) loosens the security requirement of quantum bit commitment (QBC), so that the existing impossibility proofs of unconditionally secure QBC can be evaded. But here we analyze the common features in all existing CSQBC protocols, and show that in any CSQBC having these features, the receiver can always learn a non-trivial amount of information on the sender's committed bit before it is unveiled, while his cheating can pass the security check with a probability not less than 50%. The sender's cheating is also studied. The optimal CSQBC protocols that can minimize the sum of the cheating probabilities of both parties are found to be trivial, as they are practically useless. We also discuss the possibility of building a fair protocol in which both parties can cheat with equal probabilities.

Open paper