Solution finding device, solution finding method, and program

The new algorithm for solving the Syndrome Decoding Problem optimizes memory and time complexity by using the nearest neighbor method for list combination in the search tree, addressing inefficiencies in existing SDP solutions.

WO2026154672A1PCT designated stage Publication Date: 2026-07-23NT T INC
View PDF 0 Cites 0 Cited by

Patent Information

Authority / Receiving Office
WO · WO
Patent Type
Applications
Current Assignee / Owner
NT T INC
Filing Date
2025-01-20
Publication Date
2026-07-23

AI Technical Summary

Technical Problem

Existing algorithms for solving the Syndrome Decoding Problem (SDP) in coded cryptography fail to achieve an efficient trade-off between memory usage and time complexity, particularly when combining lists using the nearest neighbor method.

Method used

A new algorithm that uses the nearest neighbor method for combining lists in the search tree, allowing partial iteration through the tree, especially in deeper parts where the probability of finding a solution is low, and estimates the number of iterations based on the success probability, thereby optimizing memory and time complexity.

Benefits of technology

The proposed method achieves a more efficient trade-off between memory usage and time complexity compared to conventional methods, effectively solving the SDP with reduced computational resources.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure JP2025001540_23072026_PF_FP_ABST
    Figure JP2025001540_23072026_PF_FP_ABST
Patent Text Reader

Abstract

A solution finding device according to one embodiment of the present disclosure finds a solution to a syndrome decoding problem, the solution finding device comprising: an input unit for inputting integers n, k, and w, a matrix H∈F2 (n-k) × n, and a vector s∈F2 n - k; and a solution finding unit for finding, as a solution, a vector e∈F2 n satisfying He = s and wt (e) = ω, said solution being found on the basis of an algorithm in which repetition of a solution search using a search tree used in an MO algorithm is nested for each depth of the search tree.
Need to check novelty before this filing date? Find Prior Art