SPN-type cryptographic optimal difference and linear feature search methods, systems, and storage media

By constructing a difference and linear approximation table of a lightweight Super S-box and optimizing the search strategy, the problem of SPN-type lightweight cryptography's difficulty in efficiently searching for optimal features is solved, achieving fast and accurate security assessment and design assistance.

CN117499019BActive Publication Date: 2026-05-26NO 30 INST OF CHINA ELECTRONIC TECH GRP CORP
View PDF 2 Cites 0 Cited by

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
NO 30 INST OF CHINA ELECTRONIC TECH GRP CORP
Filing Date
2023-11-07
Publication Date
2026-05-26

AI Technical Summary

Technical Problem

Existing technologies struggle to efficiently search for the optimal differential and linear features of SPN-type lightweight cryptosystems within a reasonable timeframe, making it impossible to accurately assess their security against differential and linear analysis.

Method used

We construct a lightweight Super S-box difference distribution table DDTSS and a linear approximation table LATSS, and optimize the branch and bound search strategy through strict pruning conditions. We use these tables for sorting and table lookup operations to improve search efficiency and find the optimal difference and linear features.

Benefits of technology

The precise security bounds of SPN-type lightweight cryptography can be obtained in a relatively short time, which can assist in the design of lightweight cryptographic algorithms and improve the efficiency and accuracy of security assessment.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN117499019B_ABST
    Figure CN117499019B_ABST
Patent Text Reader

Abstract

This invention discloses a method, system, and storage medium for optimal differential and linear feature search in SPN-type cryptography. The invention constructs a lightweight Super S-box differential distribution table (DDTSS) and a linear approximation table (LATSS), respectively. Then, the DDTSS and LATSS are sorted by upper bounds of the differential and linear probabilities, respectively. Following an improved branch-and-bound algorithm, optimal differential and linear features are searched on the DDTSS and LATSS under given pruning conditions. This invention uses stricter pruning conditions to optimize the branch-and-bound search strategy, enabling the acquisition of precise security bounds against differential and linear analysis in SPN-type lightweight cryptography within a shorter time. This invention can be used for security evaluation of SPN-type lightweight cryptography and to assist in the design of lightweight cryptographic algorithms, possessing high practical value and application prospects.
Need to check novelty before this filing date? Find Prior Art