Pith. sign in

REVIEW

In-place implementation of Quantum-Gimli

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2007.06319 v2 pith:JW4UH5PA submitted 2020-07-13 cs.CR quant-ph

classification cs.CRquant-ph
keywords implementationin-placeallowsancillaapplicationsboundcandidatecircuit
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Pith tools