Paper 2019/1174 Original: eprint.iacr.org/2019/1174 ↗
Hidden Irreducible Polynomials : A cryptosystem based on Multivariate Public Key Cryptography
Abstract
Asymmetric schemes are moving towards a new series of cryptosystems based on known open problems that until the day guarantee security from the point that are not solvable under determined properties. In this paper you can read a novel research done mostly on the field of Multivariate Public Key Cryptography that focus the interest on sharing a pre-master key between Alice and Bob using quadratic multivariate polynomials as the public key. What does this scheme somehow special is that it uses a private construction involving polynomial factorization that allows Alice to recover the secret sent by Bob.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2019-10-10: last updated
- 2019-10-10: published
- Short URL
- https://ia.cr/2019/1174
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2019/1174,
author = {Borja Gómez},
title = {Hidden Irreducible Polynomials : A cryptosystem based on Multivariate Public Key Cryptography},
howpublished = {Cryptology {ePrint} Archive, Paper 2019/1174},
year = {2019},
url = {https://eprint.iacr.org/2019/1174}
}