Public quadratic polynomial-tuples for efficient signature-verification and message-encryption

  • Authors:
  • T. Matsumoto;H. Imai

  • Affiliations:
  • Yokohama National Univ., Yokohama, Japan;Yokohama National Univ., Yokohama, Japan

  • Venue:
  • Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
  • Year:
  • 1988

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper discusses an asymmetric cryptosystem C* which consists of public transformations of compIerity O(m2n3) and secret transformations of complexity O((mn)2(m + logn)), where each complexity is measured in the total number of bit-operations for processing an mn-bit message block. Each public key of C* is an n-tuple of quadratic n-variate polynomials over GF(2m) and can be used for both verifying signatures and encrypting plaintexts. This paper also shows that for C* it is practically infeasible to extract the n-tuple of n-variate polynomials representing the inverse of the corresponding public key.