Optimal SAT Solver Synthesis of Quantum Circuits Representing Cryptographic Nonlinear Functions

• Autorzy: Jagielski Adam

Identyfikatory

DOI

10.24425/ijet.2023.144359

• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

quantum computing; circuit synthesis; cryptography; satisfiability problem

• Wydawca: Polish Academy of Sciences, Committee of Electronics and Telecommunication
• Czasopismo: International Journal of Electronics and Telecommunications
• Rocznik: 2023
• Tom: Vol. 69, No. 2
• Strony: 261--267
• Opis fizyczny: Bibliogr. 12 poz., rys., tab.

Twórcy

autor

Jagielski Adam

• Military University of Technology in Warsaw, Poland

Bibliografia

• [1] R. Wille and R. Drechsler, Towards a Design Flow for Reversible Logic. Dordrecht: Springer Netherlands, 2010. [Online]. Available: https://doi.org/10.1007/978-90-481-9579-4
• [2] C. Sinz, “Towards an Optimal CNF Encoding of Boolean Cardinality Constraints,” in Principles and Practice of Constraint Programming - CP 2005, D. Hutchison, T. Kanade, J. Kittler, J. M. Kleinberg, F. Mattern, J. C. Mitchell, M. Naor, O. Nierstrasz, C. Pandu Rangan, B. Steffen, M. Sudan, D. Terzopoulos, D. Tygar, M. Y. Vardi, G. Weikum, and P. van Beek, Eds. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005, vol. 3709, pp. 827-831. [Online]. Available: https://doi.org/10.1007/11564751_73
• [3] D. Miller, D. Maslov, and G. Dueck, “A transformation based algorithm for reversible logic synthesis,” in Proceedings - Design Automation Conference, Jul. 2003, pp. 318-323. [Online]. Available: https://doi.org/10.1109/DAC.2003.1219016
• [4] J. Daemen, S. Hoffert, M. Peeters, G. Van Assche, and R. Van Keer, “Xoodyak, a lightweight cryptographic scheme,” IACR Transactions on Symmetric Cryptology, pp. 60-87, Jun. 2020. [Online]. Available: https://doi.org/10.46586/tosc.v2020.iS1.60-87
• [5] T. Beyne, C. Yu Long, C. Dobraunig, and b. Mennink, “Elephant v2.” [Online]. Available: https://csrc.nist.gov/CSRC/media/Projects/lightweight-cryptography/documents/finalist-round/updated-spec-doc/elephant-spec-final.pdf
• [6] S. Banik, A. Chakraborti, T. Iwata, K. Minematsu, M. Nandi, T. Peyrin, Y. Sasaki, S. Meng Sim, and Y. Todo, “Gift-cofb v1.1.” [Online]. Available: https://csrc.nist.gov/CSRC/media/Projects/lightweight-cryptography/documents/finalist-round/updated-spec-doc/gift-cofb-spec-final.pdf
• [7] Z. Bao, A. Chakraborti, N. Datta, J. Guo, M. Nandi, T. Peyrin, and K. Yasuda, “Photon-beetle authenticated encryption and hash family.” [Online]. Available: https://csrc.nist.gov/CSRC/media/Projects/lightweight-cryptography/documents/finalist-round/updated-spec-doc/photon-beetle-spec-final.pdf
• [8] R. C.-W. Phan, “Mini advanced encryption standard (mini-aes): A testbed for cryptanalysis students,” Cryptologia, vol. 26, no. 4, pp. 283-306, Oct. 2002. [Online]. Available: https://doi.org/10.1080/0161-110291890948
• [9] V. Rijmen and P. S. L. M. Barreto, “The whirlpool hashing function,” 2003.
• [10] W. Hongjun, “The hash function jh,” 2011. [Online]. Available: https://www3.ntu.edu.sg/home/wuhj/research/jh/jh round3.pdf
• [11] C. Dobraunig, M. Eichlseder, F. Mendel, and M. Schl¨affer, “Ascon v1.2 submission to nist.” [Online]. Available: https://csrc.nist.gov/CSRC/media/Projects/lightweight-cryptography/documents/finalist-round/updated-spec-doc/ascon-spec-final.pdf
• [12] G. Bertoni, J. Daemen, M. Peeters, and G. Van Assche, “Keccak specifications.” [Online]. Available: http://keccak.noekeon.org/

Uwagi

Opracowanie rekordu ze środków MEiN, umowa nr SONP/SP/546092/2022 w ramach programu "Społeczna odpowiedzialność nauki" - moduł: Popularyzacja nauki i promocja sportu (2022-2023).