TY - GEN
T1 - Lattice-Based Public Key Cryptosystems Invoking Linear Mapping Mask
AU - Wang, Yuntao
AU - Ikematsu, Yasuhiko
AU - Yasuda, Takanori
N1 - Funding Information:
Acknowledgement. We thank Dr. Atsushi Takayasu for his helpful comments on this work. This work was supported by JSPS KAKENHI Grant Number JP20K23322, JP21K11751, JP19K20266, JP20K03741, Japan. This work is based on the discussions at FY2019 IMI Joint Usage Research Program Short-term Joint Research “New Development of Constructing Next-Generation Cryptography via Unified Approaches of Mathematics Theory, Computation and Cryptology”.
Publisher Copyright:
© 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.
PY - 2022
Y1 - 2022
N2 - In ProvSec 2018, Yasuda proposed a multivariate public key cryptosystem using the pq-method, whose security is based on the constrained MQ problem. Afterward, in SCIS 2020, he improved the cryptosystem by adding noise elements and simultaneously considered the cryptanalysis using the NTRU method. This improved cryptosystem is the first one combining lattice and multivariate public-key cryptosystem. In this paper, we propose three variants of Yasuda’s cryptosystem. The main improvement is that we invite the linear structures instead of the multivariate quadratic polynomials. In particular, we simplify the procedure in key generation mechanism by using a linear mapping mask which produces resistance against the key-recovery attack. Furthermore, we propose a ring version that is quite efficient compared to the standard versions. Finally, we adopt the ring-LWE method instead of the original NTRU method to give a more promising cryptanalysis.
AB - In ProvSec 2018, Yasuda proposed a multivariate public key cryptosystem using the pq-method, whose security is based on the constrained MQ problem. Afterward, in SCIS 2020, he improved the cryptosystem by adding noise elements and simultaneously considered the cryptanalysis using the NTRU method. This improved cryptosystem is the first one combining lattice and multivariate public-key cryptosystem. In this paper, we propose three variants of Yasuda’s cryptosystem. The main improvement is that we invite the linear structures instead of the multivariate quadratic polynomials. In particular, we simplify the procedure in key generation mechanism by using a linear mapping mask which produces resistance against the key-recovery attack. Furthermore, we propose a ring version that is quite efficient compared to the standard versions. Finally, we adopt the ring-LWE method instead of the original NTRU method to give a more promising cryptanalysis.
UR - http://www.scopus.com/inward/record.url?scp=85142706434&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85142706434&partnerID=8YFLogxK
U2 - 10.1007/978-3-031-20917-8_7
DO - 10.1007/978-3-031-20917-8_7
M3 - Conference contribution
AN - SCOPUS:85142706434
SN - 9783031209161
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 88
EP - 104
BT - Provable and Practical Security - 16th International Conference, ProvSec 2022, Proceedings
A2 - Ge, Chunpeng
A2 - Guo, Fuchun
PB - Springer Science and Business Media Deutschland GmbH
T2 - 16th International Conference on Provable and Practical Security, ProvSec 2022
Y2 - 11 November 2022 through 12 November 2022
ER -