Mod P Polynomial Operations … Towards Quantum Robust Crypto
Published in
3 min readJul 30, 2018
There you go … you can’t accuse me of click-baiting. With a title like this, you’re only going to click on this page, if you really want to read about quantum cryptography.
A demo of this method is defined here.
Mod P polynomials are used in some of the proposed methods in quantum computer robust cryptography, such as with lattice…
