Differential Power Analysis of the Picnic Signature Scheme [PDF]
, 2021 This work introduces the first differential side-channel analysis of the Picnic Signature Scheme, an alternate candidate in the ongoing competition for post-quantum cryptography by the National Institute of Standards and Technology (NIST).
Okan Seker +2 more
core
Implementing Grover oracles for quantum key search on AES and LowMC [PDF]
, 2023 Grover\u27s search algorithm gives a quantum attack against block ciphers by searching for a key that matches a small number of plaintext-ciphertext pairs. This attack uses $O(\sqrt{N})$ calls to the cipher to search a key space of size $N$.
Fernando Virdia +3 more
core
Lead, zinc and copper mineralisation in basal Carboniferous sediments at Westwater, south Scotland [PDF]
, 1977 A zioneo f lead, zinc and copperm ineralisatioins developedo ver a minimum I of 4 km of strikeo f basal Carboniferoucse mentstoneg roup sedimentsa nd immediatelyu nderlyingB irrenswarkL avas atwestwater,n ear Laqholm in south Scotland.
Davies, A. +5 more
core
Improved Quantum Analysis of SPECK and LowMC (Full Version) [PDF]
, 2023 As the prevalence of quantum computing is growing in leaps and bounds over the past few years, there is an ever-growing need to analyze the symmetric-key ciphers against the upcoming threat.
Anubhab Baksi +4 more
core
Memory-Efficient Single Data-Complexity Attacks on LowMC Using Partial Sets [PDF]
, 2022 The LowMC family of block ciphers was first proposed by Albrecht et al. in [ARS+15], specifically targeting adoption in FHE and MPC applications due to its low multiplicative complexity.
Andrea Caforio +3 more
core
New Attacks on LowMC Using Partial Sets in the Single-Data Setting
IACR Communications in CryptologyThe LowMC family of block ciphers was proposed by Albrecht et al. in Eurocrypt 2015, specifically targeting adoption in FHE and MPC applications due to its low multiplicative complexity. The construction operates a 3-bit quadratic S-box as the sole non-linear transformation in the algorithm.
Subhadeep Banik +2 more
openaire +1 more source
Cryptanalytic Applications of the Polynomial Method for Solving Multivariate Equation Systems over GF(2) [PDF]
, 2021 At SODA 2017 Lokshtanov et al. presented the first worst-case algorithms with exponential speedup over exhaustive search for solving polynomial equation systems of degree $d$ in $n$ variables over finite fields.
Itai Dinur
core
Improvements to the Linear Operations of LowMC: A Faster Picnic [PDF]
, 2019 Picnic is a practical approach to digital signatures where the security is primarily based on the existence of a one-way function, and the signature size strongly depends on the number of multiplications in the circuit describing that one-way function ...
Angela Promitzer +4 more
core
Boolean Functions with Multiplicative Complexity 3 and 4. [PDF]
Cryptogr Commun, 2020 Çalık Ç, Turan MS, Peralta R.
europepmc +1 more source
On the Complexity of Decomposable Randomized Encodings, Or: How Friendly Can a Garbling-Friendly PRF Be? [PDF]
, 2020 Ball, Marshall +4 more
core +1 more source