On the Differential Security of Multivariate Public Key Cryptosystems
Daniel C. Smith-Tone
Since the discovery of an algorithm for factoring and computing discrete logarithms in polynomial time on a quantum computer, the cryptographic community has been searching for an alternative for security in the approaching post-quantum world. One excellent candidate is multivariate public key cryptography. Though the speed and parameterizable nature of such schemes is desirable, a standard metric for determining the security of a multivariate cryptosystem has been lacking. We present a reasonable measure for security against the common differential attacks and derive this measurement for several modern multivariate public key cryptosystems.
November 29-December 2, 2011
PQCrypto 2011: The 4th International Conference on Post-Quantum Cryptography
On the Differential Security of Multivariate Public Key Cryptosystems, PQCrypto 2011: The 4th International Conference on Post-Quantum Cryptography, Taipei, -1, [online], https://doi.org/10.1007/978-3-642-25405-5_9
(Accessed November 28, 2023)