TY - JOUR
T1 - CyclicSRP - A multivariate encryption scheme with a partially cyclic public key
AU - Duong, Dung Hoang
AU - Petzoldt, Albrecht
AU - Takagi, Tsuyoshi
N1 - Funding Information:
The first author thanks the Japanese Society for the Promotion of Science (JSPS) for financial support under Grant KAKENHI 16K17644. This work was supported by JST CREST Grant Number JPMJCR14D6, Japan.
Publisher Copyright:
Copyright © 2017 The Institute of Electronics, Information and Communication Engineers.
Copyright:
Copyright 2017 Elsevier B.V., All rights reserved.
PY - 2017/12
Y1 - 2017/12
N2 - Multivariate Public Key Cryptography (MPKC) is one of the main candidates for secure communication in a post-quantum era. Recently, Yasuda and Sakurai proposed at ICICS 2015 a new multivariate encryption scheme called SRP, which offers efficient decryption, a small blow up factor between plaintext and ciphertext and resists all known attacks against multivariate schemes. However, similar to other MPKC schemes, the key sizes of SRP are quite large. In this paper we propose a technique to reduce the key size of the SRP scheme, which enables us to reduce the size of the public key by up to 54%. Furthermore, we can use the additional structure in the public key polynomials to speed up the encryption process of the scheme by up to 50%. We show by experiments that our modifications do not weaken the security of the scheme.
AB - Multivariate Public Key Cryptography (MPKC) is one of the main candidates for secure communication in a post-quantum era. Recently, Yasuda and Sakurai proposed at ICICS 2015 a new multivariate encryption scheme called SRP, which offers efficient decryption, a small blow up factor between plaintext and ciphertext and resists all known attacks against multivariate schemes. However, similar to other MPKC schemes, the key sizes of SRP are quite large. In this paper we propose a technique to reduce the key size of the SRP scheme, which enables us to reduce the size of the public key by up to 54%. Furthermore, we can use the additional structure in the public key polynomials to speed up the encryption process of the scheme by up to 50%. We show by experiments that our modifications do not weaken the security of the scheme.
UR - http://www.scopus.com/inward/record.url?scp=85038210630&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85038210630&partnerID=8YFLogxK
U2 - 10.1587/transfun.E100.A.2691
DO - 10.1587/transfun.E100.A.2691
M3 - Article
AN - SCOPUS:85038210630
SN - 0916-8508
VL - E100A
SP - 2691
EP - 2698
JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
IS - 12
ER -