Horizontal Correlation Analysis without Precise Location on Schoolbook Polynomial Multiplication of Lattice-based Cryptosystem

被引:1
|
作者
Lu, Chuanchao [1 ]
Cui, Yijun [1 ]
Li, Yang [2 ]
Kundi, Dur-E-Shahwar [3 ]
Wang, Chenghua [1 ]
Liu, Weiqiang [1 ]
机构
[1] Nanjing Univ Aeronaut & Astronaut, Coll Elect & Informat Engn, Nanjing, Peoples R China
[2] Univ Electrocommun, Dept Informat, Tokyo, Japan
[3] Queens Univ Belfast, Ctr Secure Informat Technol, Belfast, Antrim, North Ireland
基金
中国国家自然科学基金; 英国工程与自然科学研究理事会;
关键词
Lattice-based cryptography; Ring-LWE; School-book; polynomial multiplier; Side-channel analysis; Correlation power analysis; HARDWARE;
D O I
10.1109/ISCAS48785.2022.9937520
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Most cryptographic systems are secure in theory; however, the implementation of cryptographic system on embedded devices can be attacked by analyzing the power consumption of specific operation to reveal the key. The classic vertical correlation power analysis (CPA) attack requires a large number of power traces for analysis. Using transient secret-key scheme significantly weakens such an attack as insufficient data could be obtained. On the other hand, the horizontal CPA requires at least a single power trace and can make full use of multiple intermediate values to analyze the correlation of power consumption. In this work, we devised a horizontal CPA attack on schoolbook polynomial multiplication of hardware-implemented lattice-based cryptosystem without precise location. The accuracy of correctly recovering any one sub secret-key using only a single trace is 99.90%, and the accuracy of correctly recovering the secret-key is 76.41%. The powerful attack capability of horizontal CPA exposes the vulnerability of unprotected schoolbook polynomial multiplication against the attack of side-channel analysis (SCA).
引用
收藏
页码:2428 / 2432
页数:5
相关论文
共 18 条
  • [1] A Novel Combined Correlation Power Analysis (CPA) Attack on Schoolbook Polynomial Multiplication in Lattice-based Cryptosystems
    Lu, Chuanchao
    Cui, Yijun
    Khalid, Ayesha
    Gu, Chongyan
    Wang, Chenghua
    Liu, Weiqiang
    2022 IEEE 35TH INTERNATIONAL SYSTEM-ON-CHIP CONFERENCE (IEEE SOCC 2022), 2022, : 225 - 230
  • [2] Optimized Schoolbook Polynomial Multiplication for Compact Lattice-Based Cryptography on FPGA
    Liu, Weiqiang
    Fan, Sailong
    Khalid, Ayesha
    Rafferty, Ciara
    O'Neill, Maire
    IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2019, 27 (10) : 2459 - 2463
  • [3] Towards Efficient Polynomial Multiplication for Lattice-Based Cryptography
    Du, Chaohui
    Bai, Guoqiang
    2016 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS), 2016, : 1178 - 1181
  • [4] The implementation of polynomial multiplication for lattice-based cryptography: A survey
    Zeng, Chenkai
    He, Debiao
    Feng, Qi
    Peng, Cong
    Luo, Min
    JOURNAL OF INFORMATION SECURITY AND APPLICATIONS, 2024, 83
  • [5] Efficient Arithmetic for Polynomial Multiplication in Post-quantum Lattice-Based Cryptosystem on RISC-V Platform
    Zhao, Haosong
    Su, Rui
    Lin, Rui
    Dong, Jiankuo
    Chen, Donglong
    APPLIED CRYPTOGRAPHY AND NETWORK SECURITY WORKSHOPS, ACNS 2023 SATELLITE WORKSHOPS, ADSC 2023, AIBLOCK 2023, AIHWS 2023, AIOTS 2023, CIMSS 2023, CLOUD S&P 2023, SCI 2023, SECMT 2023, SIMLA 2023, 2023, 13907 : 439 - 458
  • [6] Area-Time-Efficient Scalable Schoolbook Polynomial Multiplier for Lattice-Based Cryptography
    Birgani, Yahya Arzani
    Timarchi, Somayeh
    Khalid, Ayesha
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2022, 69 (12) : 5079 - 5083
  • [7] Sparse polynomial multiplication for lattice-based cryptography with small complexity
    Sedat Akleylek
    Erdem Alkım
    Zaliha Yüce Tok
    The Journal of Supercomputing, 2016, 72 : 438 - 450
  • [8] Sparse polynomial multiplication for lattice-based cryptography with small complexity
    Akleylek, Sedat
    Alkim, Erdem
    Tok, Zaliha Yuce
    JOURNAL OF SUPERCOMPUTING, 2016, 72 (02): : 438 - 450
  • [9] An efficient and light weight polynomial multiplication for ideal lattice-based cryptography
    Vijay Kumar Yadav
    Shekhar Verma
    S. Venkatesan
    Multimedia Tools and Applications, 2021, 80 : 3089 - 3120
  • [10] An efficient and light weight polynomial multiplication for ideal lattice-based cryptography
    Yadav, Vijay Kumar
    Verma, Shekhar
    Venkatesan, S.
    MULTIMEDIA TOOLS AND APPLICATIONS, 2021, 80 (02) : 3089 - 3120