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.
Dung Hoang DUONG
Kyushu University
Albrecht PETZOLDT
National Institute of Standards and Technology
Tsuyoshi TAKAGI
Kyushu University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Dung Hoang DUONG, Albrecht PETZOLDT, Tsuyoshi TAKAGI, "CyclicSRP - A Multivariate Encryption Scheme with a Partially Cyclic Public Key" in IEICE TRANSACTIONS on Fundamentals,
vol. E100-A, no. 12, pp. 2691-2698, December 2017, doi: 10.1587/transfun.E100.A.2691.
Abstract: 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.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/transfun.E100.A.2691/_p
Copy
@ARTICLE{e100-a_12_2691,
author={Dung Hoang DUONG, Albrecht PETZOLDT, Tsuyoshi TAKAGI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={CyclicSRP - A Multivariate Encryption Scheme with a Partially Cyclic Public Key},
year={2017},
volume={E100-A},
number={12},
pages={2691-2698},
abstract={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.},
keywords={},
doi={10.1587/transfun.E100.A.2691},
ISSN={1745-1337},
month={December},}
Copy
TY - JOUR
TI - CyclicSRP - A Multivariate Encryption Scheme with a Partially Cyclic Public Key
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2691
EP - 2698
AU - Dung Hoang DUONG
AU - Albrecht PETZOLDT
AU - Tsuyoshi TAKAGI
PY - 2017
DO - 10.1587/transfun.E100.A.2691
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E100-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2017
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.
ER -