Construction of the Tsujii-Shamir-Kasahara (TSK) Type Multivariate Public Key Cryptosystem, which relies on the Diﬃculty of Prime Factorization

Shigeo Tsujii; Kohtaro Tadaki; Masahito Gotaishi; Ryou Fujita

Paper 2012/145

Construction of the Tsujii-Shamir-Kasahara (TSK) Type Multivariate Public Key Cryptosystem, which relies on the Diﬃculty of Prime Factorization

Shigeo Tsujii, Kohtaro Tadaki, Masahito Gotaishi, and Ryou Fujita

Abstract

A new multivariate public-key cryptosystem (MPKC) with the security based on the difficulty of the prime factoring is proposed. Unlike conventional cryptosystems such as RSA, most MPKCs are expected secure against quantum computers, and their operation of encryption and decryption is expected quick, because they do not need exponential operation. However, their security against quantum computers is very difficult to prove mathematically. We propose a new MPKC based on sequential solution method, assuming the security against von Neumann computers, whose attack seems as difficult as prime factoring. This cryptosystem is applicable to both encryption and signature.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Published elsewhere. Unknown where it was published
Contact author(s): gotaishi @ tamacc chuo-u ac jp
tsujii @ tamacc chuo-u ac jp
History: 2012-03-22: revised; 2012-03-22: received; See all versions
Short URL: https://ia.cr/2012/145
License: CC BY

BibTeX

@misc{cryptoeprint:2012/145,
      author = {Shigeo Tsujii and Kohtaro Tadaki and Masahito Gotaishi and Ryou Fujita},
      title = {Construction of the Tsujii-Shamir-Kasahara ({TSK}) Type Multivariate Public Key Cryptosystem, which relies on the Diﬃculty of Prime Factorization},
      howpublished = {Cryptology {ePrint} Archive, Paper 2012/145},
      year = {2012},
      url = {https://eprint.iacr.org/2012/145}
}