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