Cryptology ePrint Archive: Report 2010/557

A Digital Signature Based on Multivariate Polynomials over Fq

Masahiro Yagisawa

Abstract: We propose the digital signature scheme based on multivariate polynomials over finite fields in this paper. We generate the multivariate a polynomial of high degree F(X) . We construct the digital signature scheme using F(X). Our system is immune from the Gröbner bases attacks because obtaining parameters of F(X) to be secret keys arrives at solving the multivariate algebraic equations that is one of NP complete problems .

Category / Keywords: digital signature, multivariate polynomial , multivariate algebraic equation, Gröbner bases attacks , NP complete problems

Date: received 1 Nov 2010, withdrawn 14 Jan 2011

Contact author: tfktyagi2 at c3-net ne jp

Available format(s): (-- withdrawn --)

Version: 20110114:093121 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]