Quantum search for scaled hash function preimages

Ramos-Calderer, Sergi; Bellini, Emanuele; Latorre, José I.; Manzano, Marc; Mateu, Víctor

doi:10.1007/s11128-021-03118-9

Cited by 13 publications

(3 citation statements)

References 39 publications

(56 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Define the length of the sensitive information of physical fitness in Colleges and universities to be encrypted as N, construct the sensitive characteristic quantity of physical fitness in Colleges and universities by using the symmetric hash function [17], use the distribution of 0 and 1 to carry out the error correction control of physical fitness encryption in Colleges and Universities, and obtain the transmission protocol of sensitive key of physical fitness in Colleges and universities according to the input system parameters:…”

Section: Mixed Encryption Of Sports Fitness Sensitive Informationmentioning

confidence: 99%

Hybrid Encryption Algorithm for Sensitive Information of College Physical Fitness in Cloud Storage Environment

Deng

2022

Journal of Sensors

View full text Add to dashboard Cite

In order to improve the security of college sports fitness sensitive information, this paper proposes a hybrid encryption algorithm for college sports fitness sensitive information in cloud storage environment. Build an analysis model of influencing factors of cloud storage environment to identify the risk value of sensitive information; Using Bloom filter data structure to eliminate redundant data of sensitive information; The transmission channel model of sensitive information and the security coding model of sensitive information are constructed. Combined with the fuzzy differential information fusion method, the complete key of sensitive information under the symmetric encryption protocol is obtained to realize the key optimization design. Through AES encryption and decryption algorithm, the anti encryption control and structural reorganization of college sports fitness sensitive information, and the iterative convergence control of hybrid encryption, so as to realize the hybrid encryption of college sports fitness sensitive information. The encryption time of the design algorithm under different attribute numbers is always kept below 0.2S, the maximum encryption time under different number of software packages is only 0.5 s, and the encryption accuracy can reach 1, which proves that the design algorithm has certain application value.

show abstract

Section: Mixed Encryption Of Sports Fitness Sensitive Informationmentioning

confidence: 99%

Hybrid Encryption Algorithm for Sensitive Information of College Physical Fitness in Cloud Storage Environment

Deng

2022

Journal of Sensors

View full text Add to dashboard Cite

show abstract

“…In contrast to the past study [6], based on the Grover algorithm [7] allowing for quadratic improvement, where a pre-image attack on hash functions using gate-based approach on universal quantum computers was touched upon, we propose to solve the same problem using quantum annealing devices, which offers an advantage of the possibility of utilizing more qubits.…”

Section: Methodsmentioning

confidence: 99%

Converting of Boolean Expression to Linear Equations, Inequalities and QUBO Penalties for Cryptanalysis

et al. 2022

View full text Add to dashboard Cite

There exists a wide range of constraint programming (CP) problems defined on Boolean functions depending on binary variables. One of the approaches to solving CP problems is using specific appropriate solvers, e.g., SAT solvers. An alternative is using the generic solvers for mixed-integer linear programming problems (MILP), but they require transforming expressions with Boolean functions to linear equations or inequalities. Here, we present two methods of such a transformation which applies to any Boolean function defined by explicit rules giving values of the Boolean function for all combinations of its Boolean variables. The first method represents the Boolean function as a linear equation in the original binary variables and, possibly, binary ancillaries, which become additional variables of the MILP problem being composed. The second method represents the Boolean function as a set of linear inequalities in the original binary variables and one additional continuous variable (representing the value of the function). The choice between the first or second method is a trade-off between the number of binary variables and number of linear constraints in the emerging MP problem. The advantage of the proposed approach is that both methods reduce important cryptanalysis problems, such as the preimaging of hash functions or breaking symmetric ciphers as the MILP problems, which are solved by the generic MILP solvers. Furthermore, the first method enables to reduce the binary linear equations to quadratic unconstrained binary optimization (QUBO), by the quantum annealer, e.g., D-Wave.

show abstract

“…Grover’s search can decrease the security of symmetric key ciphers by a factor of the square root. In response, various symmetric key ciphers are being analysed under the Grover search algorithm [ 3 , 4 , 5 , 6 ]. It is worth noting that the quantum resources (elements that make up a quantum circuit such as quantum gates, qubits, and circuit depth) for applying the Grover’s search to AES [ 3 , 7 , 8 , 9 ] are being used as a standard for estimating post-quantum security strength by NIST [ 10 ].…”

Section: Introductionmentioning

confidence: 99%

Quantum Binary Field Multiplication with Optimized Toffoli Depth and Extension to Quantum Inversion

Jang

Kim

Lim

et al. 2023

Sensors

View full text Add to dashboard Cite

The Shor’s algorithm can find solutions to the discrete logarithm problem on binary elliptic curves in polynomial time. A major challenge in implementing Shor’s algorithm is the overhead of representing and performing arithmetic on binary elliptic curves using quantum circuits. Multiplication of binary fields is one of the critical operations in the context of elliptic curve arithmetic, and it is especially costly in the quantum setting. Our goal in this paper is to optimize quantum multiplication in the binary field. In the past, efforts to optimize quantum multiplication have centred on reducing the Toffoli gate count or qubits required. However, despite the fact that circuit depth is an important metric for indicating the performance of a quantum circuit, previous studies have lacked sufficient consideration for reducing circuit depth. Our approach to optimizing quantum multiplication differs from previous work in that we aim at reducing the Toffoli depth and full depth. To optimize quantum multiplication, we adopt the Karatsuba multiplication method which is based on the divide-and-conquer approach. In summary, we present an optimized quantum multiplication that has a Toffoli depth of one. Additionally, the full depth of the quantum circuit is also reduced thanks to our Toffoli depth optimization strategy. To demonstrate the effectiveness of our proposed method, we evaluate its performance using various metrics such as the qubit count, quantum gates, and circuit depth, as well as the qubits-depth product. These metrics provide insight into the resource requirements and complexity of the method. Our work achieves the lowest Toffoli depth, full depth, and the best trade-off performance for quantum multiplication. Further, our multiplication is more effective when not used in stand-alone cases. We show this effectiveness by using our multiplication to the Itoh–Tsujii algorithm-based inversion of F(x8+x4+x3+x+1).

show abstract

Quantum search for scaled hash function preimages

Cited by 13 publications

References 39 publications

Hybrid Encryption Algorithm for Sensitive Information of College Physical Fitness in Cloud Storage Environment

Hybrid Encryption Algorithm for Sensitive Information of College Physical Fitness in Cloud Storage Environment

Converting of Boolean Expression to Linear Equations, Inequalities and QUBO Penalties for Cryptanalysis

Quantum Binary Field Multiplication with Optimized Toffoli Depth and Extension to Quantum Inversion

Contact Info

Product

Resources

About