Optimal SAT Solver Synthesis of Quantum Circuits Representing Cryptographic Nonlinear Functions

Authors

  • Adam Jagielski Military University of Technology in Warsaw, Poland

DOI:

https://doi.org/10.24425/ijet.2023.144359

Abstract

In this article we present a procedure that allows to synthesize optimal circuit representing any reversible function within reasonable size limits. The procedure allows to choose either the NCT or the MCT gate set and specify any number of ancillary qubits to be used in the circuit. We will explore efficacy of this procedure by synthesizing various sources of nonlinearity used in contemporary symmetric ciphers and draw conclusions about properties of those transformations in quantum setting. In particular we will try to synthesize optimal circuit representing ASCON cipher SBOX which recently won NIST competition for Lightweight Cryptography standard.

Published

2023-05-31

How to Cite

Jagielski, Adam. “Optimal SAT Solver Synthesis of Quantum Circuits Representing Cryptographic Nonlinear Functions”. International Journal of Electronics and Telecommunications, vol. 69, no. 2, May 2023, doi:10.24425/ijet.2023.144359.

Issue

Section

Artykuły