Title:
METHOD FOR EFFICIENTLY, PARALLELY AND QUICKLY ACHIEVING LATTICE-BASED SIGNATURE
Document Type and Number:
WIPO Patent Application WO/2024/012431
Kind Code:
A1
Abstract:
A method for efficiently, parallely and quickly achieving a lattice-based signature. In the present invention, a method for parallely, efficiently and securely implementing small-coefficient polynomial multiplication is provided on the basis of the feature of a polynomial coefficient being much less than a modulus. A multiplication operation for time consumption between polynomial coefficients is first converted into a shift addition/subtraction operation; the polynomial coefficients and a calculated median are then changed into non-negative integers by means of translation, and the influence of the translation is eliminated at the end; and on this basis, a parallel method for efficiently implementing small-polynomial multiplication is provided, which method comprises: storing, by means of splicing and in an integer variable having the maximum range which can be defined by different processors, identical dimension coefficients of different polynomials in a vector, and performing parallel calculation on a plurality of coefficients by means of operating only one variable. Furthermore, in order to achieve efficient calculation, parallel small-coefficient polynomial multiplication is optimized by using an advanced checking technique, and for sampling rejection, calculation and checking are preferentially performed on a part which has a higher rejection probability.
Inventors:
ZHAO YUNLEI (CN)
ZHENG JIEYU (CN)
LIANG ZHICHUANG (CN)
ZHAO ZHIXIANG (CN)
XU JUN (CN)
ZHANG XIAOYU (CN)
ZHENG JIEYU (CN)
LIANG ZHICHUANG (CN)
ZHAO ZHIXIANG (CN)
XU JUN (CN)
ZHANG XIAOYU (CN)
Application Number:
PCT/CN2023/106714
Publication Date:
January 18, 2024
Filing Date:
July 11, 2023
Export Citation:
Assignee:
UNIV FUDAN (CN)
International Classes:
G06F21/64
Foreign References:
| CN110351097A | 2019-10-18 | |||
| CN110175473A | 2019-08-27 | |||
| CN113541952A | 2021-10-22 | |||
| US20210167969A1 | 2021-06-03 |
Other References:
SAILADA SRIKANTH; VOHRA NEETI; SUBRAMANIAN N.: "Crystal Dilithium Algorithm For Post Quantum Cryptography:Experimentation and Usecase for eSign", 2022 FIRST INTERNATIONAL CONFERENCE ON ELECTRICAL, ELECTRONICS, INFORMATION AND COMMUNICATION TECHNOLOGIES (ICEEICT), IEEE, 16 February 2022 (2022-02-16), pages 1 - 6, XP034120655, DOI: 10.1109/ICEEICT53079.2022.9768654
Attorney, Agent or Firm:
SHANGHAI PATENT & TRADEMARK LAW OFFICE, LLC (CN)
Download PDF: