@ARTICLE{Jagielski_Adam_Optimal_2023, author={Jagielski, Adam}, volume={vol. 69}, number={No 2}, journal={International Journal of Electronics and Telecommunications}, pages={261-267}, howpublished={online}, year={2023}, publisher={Polish Academy of Sciences Committee of Electronics and Telecommunications}, 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.}, type={Article}, title={Optimal SAT Solver Synthesis of Quantum Circuits Representing Cryptographic Nonlinear Functions}, URL={http://www.czasopisma.pan.pl/Content/127355/PDF/8_4162_Jagielski_sk.pdf}, doi={10.24425/ijet.2023.144359}, keywords={quantum computing, circuit synthesis, cryptography, satisfiability problem}, }