Pith. sign in

REVIEW 1 major objections 43 references

Qubit Optimized Quantum Implementation of SLIM

T0 review · 1 major / 0 minor · reviewed 2026-05-23 · grok-4.3

Challenge this review Download PDF Read on arXiv ↗

Pith's one-line read A quantum circuit for the SLIM block cipher uses fewer qubits than other implementations in its class.

desk verdict SLIM quantum implementation claims minimal qubits but lacks any verifiable details or comparisons. read the letter →

arxiv 2412.10835 v1 submitted 2024-12-14 quant-ph cs.CR

Hasan Ozgur Cildiroglu , Oguz Yayla This is my paper
classification quant-phcs.CR
keywords quantumimplementationSLIMcipherqubitoptimizationblockFeistelstructurelightweightcryptographycircuitresistance
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper describes a quantum implementation of SLIM, a lightweight block cipher with 32-bit plaintext and 80-bit key arranged in a Feistel structure. The design achieves a lower qubit count than other quantum block-cipher circuits handling 64-128 bit blocks while claiming to retain the original security level and efficiency. A reader would care because quantum computers threaten many existing cryptosystems, and any cipher that runs with reduced quantum resources could become practical for future secure protocols. The work centers on an innovative circuit layout that trims qubit requirements during the encryption and decryption steps.

What carries the argument

The qubit-minimizing quantum circuit design for the Feistel-structured SLIM cipher.

What would settle it

An independent simulation or hardware execution that either requires more qubits than stated or produces incorrect encryption/decryption output would falsify the minimal-qubit claim.

Watch

Extended reading notes

Core claim

The authors construct a quantum circuit for SLIM that minimizes qubit usage compared with other block-cipher implementations in the 64-128-bit range, while preserving the cipher's cryptographic strength and efficiency, thereby positioning SLIM as a resource-efficient candidate for quantum-resistant encryption.

Load-bearing premise

The proposed quantum circuit for SLIM is functionally correct, free of implementation errors, and preserves the cipher's security properties.

Editorial extensions

If this is right

  • SLIM becomes a viable lightweight option for quantum-resistant encryption protocols.
  • Reduced qubit counts enable more efficient use of limited quantum hardware resources.
  • The same minimization approach may extend to other Feistel-based lightweight ciphers.
  • Block ciphers can maintain security while operating under tighter quantum resource constraints.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Similar qubit-reduction techniques could be tested on other lightweight ciphers to compare total resource costs.
  • Running the circuit on current quantum simulators would provide an independent check of the claimed qubit count.
  • If the design scales, it might lower barriers for deploying post-quantum cryptography on early fault-tolerant machines.
  • The work leaves open whether the same optimizations affect circuit depth or gate count in addition to qubit number.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

1 major / 0 minor

Summary. The manuscript presents a quantum implementation of the SLIM lightweight Feistel block cipher (32-bit plaintext, 80-bit key) that claims to achieve a minimal qubit count relative to other block-cipher quantum circuits in the 64-128-bit class while preserving cryptographic strength and efficiency.

Significance. If the implementation details and qubit counts were verified, the result would be relevant to resource-efficient quantum cryptography for lightweight ciphers. The work would supply a concrete data point on qubit-optimized circuits for Feistel designs in the post-quantum setting.

major comments (1)
  1. [Abstract] Abstract: the central claim that the implementation 'utiliz[es] a minimal number of qubits' is asserted without any circuit diagram, gate-count table, explicit qubit total, comparison data against other 64-128-bit BC circuits, verification procedure, or error analysis. This absence renders the minimal-qubit assertion unevaluable and is load-bearing for the paper's primary contribution.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the constructive feedback. We address the major comment below and outline revisions that will make the central claim directly evaluable while preserving the manuscript's focus.

read point-by-point responses

  1. Referee: [Abstract] Abstract: the central claim that the implementation 'utiliz[es] a minimal number of qubits' is asserted without any circuit diagram, gate-count table, explicit qubit total, comparison data against other 64-128-bit BC circuits, verification procedure, or error analysis. This absence renders the minimal-qubit assertion unevaluable and is load-bearing for the paper's primary contribution.

    Authors: We agree that the abstract, being a high-level summary, does not itself contain the supporting details required to evaluate the minimal-qubit claim. The body of the manuscript presents the Feistel-based quantum circuit for the 32-bit/80-bit SLIM instance, including the qubit allocation arising from the optimized design. To address the concern directly, we will revise the abstract to state the explicit total qubit count achieved and note the comparison class (other 64-128-bit block-cipher circuits). In the main text we will add or expand a gate-count and qubit-usage table, include a concise description of the verification approach used for the circuit, and clarify that the work targets the ideal (noiseless) circuit model, so no error analysis is performed. These changes will be incorporated in the revised version. revision: yes

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity

full rationale

The paper reports a concrete quantum circuit implementation for the 32-bit SLIM Feistel cipher, emphasizing qubit count minimization as an engineering outcome. No derivation chain, equations, predictions, or first-principles results appear in the provided text that could reduce to their own inputs by construction. The central claim is an implementation result rather than a fitted or self-referential theoretical step, and no load-bearing self-citations or ansatzes are invoked. This is the standard case for circuit-design papers and receives the default non-circularity finding.

Assumptions & free parameters 0 free parameters · 0 assumptions · 0 invented entities

Abstract supplies no equations, parameters, or background assumptions that can be audited; ledger entries are therefore empty.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Qubit Optimized Quantum Implementation of SLIM." pith.science (2026). https://pith.science/paper/2412.10835

@misc{pith2026241210835,
  author       = {Pith},
  title        = {Pith review of: Qubit Optimized Quantum Implementation of SLIM},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/2412.10835}},
  note         = {Machine review of arXiv:2412.10835}
}
read the original abstract

The advent of quantum computing has profound implications for current technologies, offering advancements in optimization while posing significant threats to cryptographic algorithms. Public-key cryptosystems relying on prime factorization or discrete logarithms are particularly vulnerable, whereas block ciphers (BCs) remain secure through increased key lengths. In this study, we introduce a novel quantum implementation of SLIM, a lightweight block cipher optimized for 32-bit plaintext and an 80-bit key, based on a Feistel structure. This implementation distinguishes itself from other BC quantum implementations in its class (64-128-bit) by utilizing a minimal number of qubits while maintaining robust cryptographic strength and efficiency. By employing an innovative design that minimizes qubit usage, this work highlights SLIM's potential as a resource-efficient and secure candidate for quantum-resistant encryption protocols.

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

43 extracted references · 43 canonical work pages

  1. [1]

    SIAM J Comput 26(5), 1484–1509 (1997)

    Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J Comput 26(5), 1484–1509 (1997)

    work page 1997

  2. [2]

    In: Proc of the 28th Annual ACM Symposium on Theory of Computing (STOC), ACM, (1996)

    Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proc of the 28th Annual ACM Symposium on Theory of Computing (STOC), ACM, (1996)

    work page 1996

  3. [3]

    RIMS Kokyuroku 2000(1166) (2000)

    Yamamura, A., Ishizuka, H.: Quantum cryptanalysis of block ciphers (Algebraic systems, formal languages and computations). RIMS Kokyuroku 2000(1166) (2000)

    work page 2000

  4. [4]

    In: Proceedings of the 35th IEEE Symposium on the Foundations of Computer Science (FOCS), pp

    Simon, D.: On the power of quantum computation. In: Proceedings of the 35th IEEE Symposium on the Foundations of Computer Science (FOCS), pp. 116–123 (1994) 13

    work page 1994

  5. [5]

    Dowling, J.P., Gerard, J.M.: Quantum technology: the second quantum revolu- tion. Phil. Trans. R. Soc. A 361, 1655–1674 (2003)

    work page 2003

  6. [6]

    Reviews of Modern Physics 83(3), 863–883 (2011)

    Polkovnikov, A., Sengupta, K., Silva, A., Vengalattore, M.: Colloquium: Nonequi- librium dynamics of closed interacting quantum systems. Reviews of Modern Physics 83(3), 863–883 (2011)

    work page 2011

  7. [7]

    Nature 549(7671) (2017)

    Harrow, A.W., Montanaro, A.: Quantum computational supremacy. Nature 549(7671) (2017)

    work page 2017

  8. [8]

    FIPS 197 (2001)

    Daemen, J., Rijmen, V.: Specification for the Advanced Encryption Standard (AES). FIPS 197 (2001)

    work page 2001

Show all 43 references
  1. [9]

    Science China Physics, Mechanics and Astronomy 65(9), 290–311 (2022)

    Li, Z., Cai, B., Sun, H., Liu, H., Wan, L., Qin, S., Wen, Q., Gao, F.: Novel quantum circuit implementation of advanced encryption standard with low costs. Science China Physics, Mechanics and Astronomy 65(9), 290–311 (2022)

    2022

  2. [10]

    In: Agrawal, S., Lin, D

    Huang, Z., Sun, S.: Synthesizing Quantum Circuits of AES with Lower T-depth and Less Qubits. In: Agrawal, S., Lin, D. (eds.) Advances in Cryptology – ASIACRYPT 2022, pp. 614–644. Springer, Cham (2022). Springer

    2022

  3. [11]

    Quantum information processing 17, 1–30 (2018)

    Almazrooie, M., Samsudin, A., Abdullah, R., Mutter, K.N.: Quantum reversible circuit of AES-128. Quantum information processing 17, 1–30 (2018)

    2018

  4. [13]

    EPJ Quantum Technology 9(1), 24 (2022)

    Luo, Q.-b., Yang, G.-w., Li, X.-y., Li, Q.: Quantum reversible circuits for multiplicative inverse. EPJ Quantum Technology 9(1), 24 (2022)

    2022

  5. [14]

    IEEE Transactions on Quantum Engineering 1, 1–12 (2020)

    Langenberg, B., Pham, H., Steinwandt, R.: Reducing the cost of implementing the advanced encryption standard as a quantum circuit. IEEE Transactions on Quantum Engineering 1, 1–12 (2020)

    2020

  6. [15]

    Physical Review A—Atomic, Molecular, and Optical Physics 87(4), 042302 (2013)

    Selinger, P.: Quantum circuits of T-depth one. Physical Review A—Atomic, Molecular, and Optical Physics 87(4), 042302 (2013)

    2013

  7. [16]

    In: 2019 32nd IEEE International System-on-Chip Conference (SOCC), pp

    Dasu, V.A., Baksi, A., Sarkar, S., Chattopadhyay, A.: LIGHTER-R: optimized reversible circuit implementation for SBoxes. In: 2019 32nd IEEE International System-on-Chip Conference (SOCC), pp. 260–265 (2019). IEEE

    2019

  8. [17]

    Quantum Inf

    Anand, R., Maitra, A., Mukhopadhyay, S.: Grover on SIMON. Quantum Inf. Process. 19, 1–17 (2020)

    2020

  9. [18]

    In: 2021 25th International Symposium on VLSI Design and Test (VDAT), pp

    Saravanan, P., Jenitha, J., Aasish, S., Sanjana, S.: Quantum circuit design of RECTANGLE lightweight cipher. In: 2021 25th International Symposium on VLSI Design and Test (VDAT), pp. 1–4 (2021). IEEE 14

    2021

  10. [19]

    Quantum Information Processing 22(9), 347 (2023)

    Jing, X., Li, Y., Zhao, G., Xie, H., Wang, Q.: Quantum circuit implementa- tion and resource analysis of LBlock and LiCi. Quantum Information Processing 22(9), 347 (2023)

    2023

  11. [20]

    IEEE Access 11, 66767–66776 (2023)

    Paramasivam, S., Jenitha, J., Sanjana, S., Haghparast, M.: Compact quantum cir- cuit design of PUFFIN and PRINT lightweight ciphers for quantum key recovery attack. IEEE Access 11, 66767–66776 (2023)

    2023

  12. [21]

    Quantum Information Processing 23(5), 177 (2024)

    Luo, Q.B., Li, Q., Li, X.Y., Yang, G.W., Shen, J., Zheng, M.: Quantum circuit implementations of SM4 block cipher optimizing the number of qubits. Quantum Information Processing 23(5), 177 (2024)

    2024

  13. [22]

    Cryptology ePrint Archive (2023)

    Chun, M., Baksi, A., Chattopadhyay, A.: DORCIS: Depth optimized quantum implementation of substitution boxes. Cryptology ePrint Archive (2023)

    2023

  14. [23]

    IEEE Access 10, 59661–59674 (2022)

    Lee, W.-K., Jang, K., Song, G., Kim, H., Hwang, S.O., Seo, H.: Efficient imple- mentation of lightweight hash functions on GPU and quantum computers for IoT applications. IEEE Access 10, 59661–59674 (2022)

    2022

  15. [24]

    Scientific American 228(5), 15–23 (1973)

    Feistel, H.: Cryptography and Computer Privacy. Scientific American 228(5), 15–23 (1973)

    1973

  16. [25]

    NBS 46-3 (1999)

    FIPS: Data Encryption Standard. NBS 46-3 (1999)

    1999

  17. [26]

    NBS 197 (2001)

    FIPS: Advanced Encryption Standard. NBS 197 (2001)

    2001

  18. [27]

    Jaques, S., Naehrig, M., Roetteler, M., Virdia, F.: Implementing Grover oracles for quantum key search on AES and LowMC. In: Advances in Cryptology– EUROCRYPT 2020: 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia...

    2020

  19. [28]

    arXiv 2020

    Schlieper, L.: In-place implementation of Quantum-Gimli. arXiv 2020. arXiv:2007.06319

    2020

  20. [29]

    Pal, O., Jain, M., Murthy, B., Thakur, V.: Quantum and Post-Quantum Cryptography, pp. 45–58. Wiley Online Library (2022)

    2022

  21. [30]

    In: Proc

    Chauhan, A.K., Sanadhya, S.K.: Quantum resource estimates of Grover’s key search on ARIA. In: Proc. Int. Conf. Secur. Privacy Appl. Cryptogr. Eng., pp. 238–258 (2020)

    2020

  22. [31]

    In: Cryptographic Hardware and Embedded Systems-CHES 2007: 9th International Workshop, Vienna, Austria, September 10-13, 2007

    Bogdanov, A., Knudsen, L.R., Leander, G., Paar, C., Poschmann, A., Robshaw, M.J., Seurin, Y., Vikkelsoe, C.: PRESENT: An ultra-lightweight block cipher. In: Cryptographic Hardware and Embedded Systems-CHES 2007: 9th International Workshop, Vienna, Austria, September 10-13, 200...

    2007

  23. [32]

    In: Cryptographic Hardware and Embedded Systems-CHES 2006: 8th International Workshop, Yokohama, Japan, October 10-13, 2006

    Hong, D., Sung, J., Hong, S., Lim, J., Lee, S., Koo, B.-S., Lee, C., Chang, D., Lee, J., Jeong, K., Kim, H., Kim, J., Seongtaek, C.: HIGHT: A new block cipher suitable for low-resource device. In: Cryptographic Hardware and Embedded Systems-CHES 2006: 8th International Worksho...

    2006

  24. [33]

    In: Proc

    Knudsen, L.R., Leander, G., et.al.: PRINT-cipher: A block cipher for ic-printing. In: Proc. 12th Int. Workshop in Lecture Notes in Computer Science, vol. 6225. USA (2010)

    2010

  25. [34]

    In: Rogaway, P

    Guo, J., Peyrin, T., et.al: The PHOTON family of lightweight hash functions. In: Rogaway, P. (ed.) Proc. 31st Annu. Int. Cryptol. Conf. (CRYPTO), in Lecture Notes in Computer Science, vol. 6841, pp. 222–239. Springer, Santa Barbara, CA, USA (2011)

    2011

  26. [35]

    In: Proc

    Beaulieu, R., Shors, D., et.al: The SIMON and SPECK lightweight block ciphers. In: Proc. 52nd Annu. Design Autom. Conf., p. 175 (2015)

    2015

  27. [36]

    In: Proc

    Zhang, W., Bao, Z., et.al.: RECTANGLE: A bit-slice ultra-lightweight block cipher suitable for multiple platforms. In: Proc. IACR, p. 84 (2014)

    2014

  28. [37]

    In: Proc

    Cheng, H., Heys, H.M., et.al: PUFFIN: A novel compact block cipher targeted to embedded digital systems. In: Proc. 11th EUROMICRO Conf. Digit. Syst. Des. Archit. Methods Tools, pp. 383–390 (2008)

    2008

  29. [38]

    Wu, W., Zhang, L.: LBlock: a lightweight block cipher. In: App. Cryp. Net. Sec. 9th Int. Conf. ACNS 2011, Nerja, Spain, pp. 327–344 (2011)

    2011

  30. [39]

    Patil, J., Bansod, G., Kant, K.S.: LiCi: A new ultra-lightweight block cipher. In: Int. Conf. on Emerging Trends and Innov ICT, pp. 40–45 (2017)

    2017

  31. [40]

    IEEE Access 8, 203747–203757 (2020)

    Aboushosha, B., Ramadan, R.A., Dwivedi, A.D., El-Sayed, A., Dessouky, M.M.: SLIM: A lightweight block cipher for internet of health things. IEEE Access 8, 203747–203757 (2020)

    2020

  32. [41]

    Cryptography and Communications, 1–21 (2023)

    Yadav, T., Kumar, M., Kumar, A., Pal, S.K.: A practical-quantum differential attack on block ciphers. Cryptography and Communications, 1–21 (2023)

    2023

  33. [42]

    NIST: Project for Post-Quantum Cryptography Standardization (2016)

    2016

  34. [43]

    In: 2023 2nd International Con- ference on Vision Towards Emerging Trends in Communication and Networking Technologies (ViTECoN), pp

    Mohanapriya, R., Kumar, N.: Optimized Implementation of S-box and Inverse S-box for PRESENT Lightweight Block Cipher. In: 2023 2nd International Con- ference on Vision Towards Emerging Trends in Communication and Networking Technologies (ViTECoN), pp. 1–5 (2023). IEEE

    2023

  35. [44]

    Quantum Information and Computation 9(5), 461–486 (2009) 16

    Shende, V.V., Markov, I.L.: On the CNOT-cost of TOFFOLI gates. Quantum Information and Computation 9(5), 461–486 (2009) 16

    2009

Pith tools

Reviewed May 23, 2026 · model on record in the stance chip above.