Cryptology ePrint Archive: Report 2019/1283

Breaking the Hidden Irreducible Polynomials Scheme

Christian Eder

Abstract: In 2019 Gómez described a new public key cryptography scheme based on ideas from multivariate public key cryptography using hidden irreducible polynomials. We show that the scheme's design has a flaw which lets an attacker recover the private key directly from the public key.

Category / Keywords: public-key cryptography / multivariate, univariate polynomial factorization

Date: received 5 Nov 2019

Contact author: ederc at mathematik uni-kl de

Available format(s): PDF | BibTeX Citation

Version: 20191105:152813 (All versions of this report)

Short URL: ia.cr/2019/1283


[ Cryptology ePrint archive ]