Cryptographic Key Determination via Quantum Annealing Optimization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Determining cryptographic keys in an efficient and resource-conserving manner, particularly for symmetric-key cryptography algorithms, is challenging due to the computational hardness of deriving keys from plaintext and ciphertext.
Innovation Solution
A method is provided that involves transforming the cryptographic procedure into optimization problems, specifically mixed-integer linear programming (MILP) or quadratic unconstrained binary optimization (QUBO) problems, which can be solved using quantum annealing devices, allowing for the determination of cryptographic keys by analyzing intermediate relations and optimization expressions derived from cryptographic operations.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If cryptographic key determination is performed using traditional computational methods, then the problem is computationally hard and resource-intensive, but the patent transforms it into an optimization problem solvable by quantum annealing devices achieving substantial computational speedup
Solution Approach 1:
The patent replaces traditional computational methods with quantum annealing, substituting classical computational mechanics with quantum mechanical processes. The cryptographic key determination problem is transformed into a QUBO optimization problem that leverages quantum tunneling and energy minimization to achieve exponential speedup over classical approaches.
Solution Approach 2:
The patent changes the fundamental parameters of the problem by transforming cryptographic key determination from a direct computational search into an optimization problem with objective functions and constraints. This parameter transformation enables the use of quantum annealing by mapping discrete cryptographic operations into continuous optimization landscapes.
2Measurement precision
If the cryptographic procedure is analyzed in detail with intermediate relations for each operation, then the accuracy of key determination improves, but the complexity of the optimization problem increases
Solution Approach 1:
The patent segments the cryptographic procedure into individual operations (SubBytes, ShiftRows, MixColumns, AddRoundKey) and formulates separate intermediate relations for each segment. This segmentation allows the complex cryptographic analysis to be broken down into manageable optimization constraints that can be systematically combined into the final QUBO problem.
Solution Approach 2:
The patent introduces intermediate relations as mediator variables that connect different cryptographic operations. These intermediate variables serve as bridges between plaintext, ciphertext, and the cryptographic key, enabling the formulation of optimization expressions that capture the relationships across multiple cryptographic rounds without directly exposing the key.
3Productivity
If quantum annealing is used to solve the optimization problem, then computational efficiency improves substantially, but the requirement for quantum processing devices increases
Solution Approach 1:
The patent creates a universal framework that can analyze multiple symmetric cryptographic algorithms (AES, ARX-based ciphers, DES, 3DES) using the same QUBO formulation approach. The method is adaptable to different cryptographic procedures by modifying the intermediate relations and optimization expressions while maintaining the core quantum annealing solving mechanism.
Data Source
AI summary
A method for determining a cryptographic key is carried out in a data processing system, and comprises: providing a plaintext and a ciphertext determined from the plaintext using a cryptographic key and a cryptographic procedure which comprises cryptographic operations; for each cryptographic operation of the cryptographic procedure, providing at least one intermediate relation which comprises an intermediate equation and/or an intermediate inequality; determining an optimization problem comprising: the plaintext and the ciphertext; at least one optimization expression assigned to a round of the cryptographic procedure; and optimization variables comprising state variables of the cryptographic procedure and a cryptographic key variable; wherein the at least one optimization expression is determined from the at least one intermediate relation and comprises at least one preceding state variable assigned to a preceding round. The method further comprises: solving the optimization problem and determining the cryptographic key from an optimizing value of the cryptographic key variable.


