We present an in-place implementation of the cryptographic permutation \textbf{Gimli}, a NIST round 2 candidate for lightweight cryptography, and provide an upper bound for the required quantum resource in depth and gate-counts. In particular, we do not use any ancilla qubits and the state that our circuit produces is not entangled with any input. This offers further freedom in the usability and allows for a widespread use in different applications in a plug-and-play manner.

翻译：我们展示了加密式变异化 \ textbf{Gimli} 的本地实施,这是NIST第二回合的轻量加密候选软件,并且提供了所需的量子资源深度和门数的上限。 特别是,我们不使用任何 ⁇ 和我们的电路生产状态没有与任何输入相纠缠。 这为可用性提供了进一步的自由,并允许以插接和播放方式在不同应用中广泛使用。