Cryptology ePrint Archive: Report 2019/1174

Hidden Irreducible Polynomials : A cryptosystem based on Multivariate Public Key Cryptography

Borja Gómez

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.

Category / Keywords: public-key cryptography / public-key cryptography factoring asymmetric mutlviariate quadratic-polynomial

Date: received 9 Oct 2019, last revised 9 Oct 2019

Contact author: kub0x at elhacker net

Available format(s): PDF | BibTeX Citation

Version: 20191010:125256 (All versions of this report)

Short URL: ia.cr/2019/1174


[ Cryptology ePrint archive ]