Theoretical security analysis method of lattice PKE / KEM scheme based on compressed public key design

Through the lattice PKE/KEM scheme based on compressed public key design, the discrete Gaussian distribution is used to decompose the error and convert it into the standard modulus LWE problem, which solves the security assessment problem of lightweight cryptographic algorithms in IoT devices, achieves faster and more accurate security assessment and smaller communication bandwidth requirements.

CN119483949BActive Publication Date: 2025-09-12SHANDONG UNIV
2 Cites 0 Cited by

Patent Information

Application Number
CN202411656331.0
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-11-19
Publication Date
2025-09-12
Estimated Expiration
2044-11-19

AI Technical Summary

Technical Problem

Existing lightweight cryptographic algorithms cannot effectively evaluate the security of IoT devices, resulting in potential security risks. In addition, existing security assessment methods require excessive parameter selection and are not suitable for IoT environments.

Method used

A lattice PKE/KEM scheme based on compressed public key design is adopted. The error is decomposed using discrete Gaussian distribution and converted into a standard modulus LWE problem. The lower bound of security strength is evaluated and appropriate parameters are selected to ensure security.

Benefits of technology

Under the premise of maintaining small parameters and efficient calculation, the security assessment accuracy of IoT devices is improved, communication bandwidth is saved, and it is suitable for security analysis of IoT devices.

✦ Generated by Eureka AI based on patent content.
Patent Text Reader

Abstract

The present invention proposes a theoretical security analysis method for a lattice-based PKE / KEM scheme based on a compressed public key design, comprising the following steps: obtaining a key encapsulation scheme; utilizing the properties of a discrete Gaussian distribution to decompose e into two parts, e1 and e2, and then re-expressing the parameters as #imgabs0#; expressing #imgabs1# and #imgabs2# as #imgabs3#, wherein #imgabs4# is taken from an appropriate distribution; utilizing the properties of the discrete Gaussian distribution to decompose a secret #imgabs5# into a secret #imgabs6# and a redundant part #imgabs7# of a standard modulus LWE problem; and then rewriting the sample form as #imgabs8#; utilizing the standard modulus LWE problem corresponding to #imgabs9# to evaluate the theoretical difficulty lower bound of the corresponding problem, and then evaluating the security strength lower bound of the KEM scheme; and selecting specific parameters of the key encapsulation scheme for a required security strength λ according to the computational complexity of the standard modulus LWE problem corresponding to #imgabs10#.
Need to check novelty before this filing date? Find Prior Art