WHIRLBOB, the Whirlpool Based Variant of STRIBOB: Lighter, Faster, and Constant Time

MJO Saarinen, BB Brumley - Secure IT Systems: 20th Nordic Conference …, 2015 - Springer
WHIRLBOB, also known as STRIBOBr2, is an AEAD (Authenticated Encryption with
Associated Data) algorithm derived from STRIBOBr1 and the Whirlpool hash algorithm …

EMOMA: Exact match in one memory access

S Pontarelli, P Reviriego… - IEEE Transactions on …, 2018 - ieeexplore.ieee.org
An important function in modern routers and switches is to perform a lookup for a key. Hash-
based methods, and in particular cuckoo hash tables, are popular for such lookup …

[引用][C] Almost inverses and fast NTRU key creation

JH Silverman - NTRU Cryptosystems,(Technical Note# 014), 1999

Linea Prover Documentation

L Prover - Cryptology ePrint Archive, 2022 - eprint.iacr.org
Rollup technology today promises long-term solutions to the scalability of the blockchain.
Among a thriving ecosystem, Consensys has launched the Linea zkEVM Rollup network for …

Secure keyed hashing on programmable switches

S Yoo, X Chen - Proceedings of the ACM SIGCOMM 2021 Workshop on …, 2021 - dl.acm.org
Cyclic Redundancy Check (CRC) is a computationally inexpensive function readily
available in many high-speed networking devices, and thus it is used extensively as a hash …

Power circuits: a new arithmetization for GKR-styled sumcheck

L Soukhanov - Cryptology ePrint Archive, 2023 - eprint.iacr.org
Abstract Goldwasser-Kalai-Rothblum protocol (GKR) for layered circuits is a sumcheck-
based argument of knowledge for layered circuits, running in $\sim 2\mu\ell $ amount of …

Lossy trapdoor permutations with improved lossiness

B Auerbach, E Kiltz, B Poettering… - Cryptology ePrint …, 2018 - eprint.iacr.org
Lossy trapdoor functions (Peikert and Waters, STOC 2008 and SIAM J. Computing 2011)
imply, via black-box transformations, a number of interesting cryptographic primitives …

Secure Range-Searching Using Copy-And-Recurse

E Kushnir, G Moshkowich, H Shaul - Cryptology ePrint Archive, 2023 - eprint.iacr.org
Abstract {\em Range searching} is the problem of preprocessing a set of points $ P $, such
that given a query range $\gamma $ we can efficiently compute some function $ f …

SNARKs for C: Verifying program executions succinctly and in zero knowledge

E Ben-Sasson, A Chiesa, D Genkin, E Tromer… - Annual cryptology …, 2013 - Springer
An argument system for NP is a proof system that allows efficient verification of NP
statements, given proofs produced by an untrusted yet computationally-bounded prover …

Verifiable random permutations

Y Dodis, P Puniya - Cryptology ePrint Archive, 2006 - eprint.iacr.org
Abstract Pseudorandom Functions (PRFs), introduced by Goldreich, Goldwasser and Micali,
allow one to efficiently simulate the computation of a function which is indistinguishable from …