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
Symmetric Ciphers for Fully Homomorphic Encryption [PDF]
, 2020 Fully homomorphic encryption is the latest addition to the world of cryptography. It is a type of encryption that allows operations to be done on ciphertexts, which is not possible with traditional encryption. The field has gained a lot of traction since
Thorvaldsen, Håkon
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
Search for WZ resonances in the fully leptonic channel using pp collisions at s=8 TeV with the ATLAS detector [PDF]
, 2014 A search for resonant WZ production in the ℓνℓ'ℓ' (ℓ,ℓ'=e,μ) decay channel using 20.3 fb-1 of s=8TeV pp collision data collected by the ATLAS experiment at LHC is presented.
ATLAS Collaboration +35 more
core +2 more sources
Efficient implementation of LowMC in HElib [PDF]
, 2019 Postponed access: the file will be accessible after 2019-05-29LowMC is a symmetric block cipher designed for fully homomorphic encryption. This thesis focuses on Martin Albrecht’s implementation of the cipher in the FHE library HElib, and how his ...
Francis, Isabel Thevahi
core
Linear Equivalence of Block Ciphers with Partial Non-Linear Layers: Application to LowMC [PDF]
, 2019 LowMC is a block cipher family designed in 2015 by Albrecht et al. It is optimized for practical instantiations of multi-party computation, fully homomorphic encryption, and zero-knowledge proofs.
A Bar-On +13 more
core +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
Cryptanalysis of Full LowMC and LowMC-M with Algebraic Techniques [PDF]
, 2021 In this paper, we revisit the difference enumeration technique for LowMC and develop new algebraic techniques to achieve efficient key-recovery attacks.
Fukang Liu, Takanori Isobe, Willi Meier
core
Efficient FPGA Implementations of LowMC and Picnic [PDF]
, 2019 Post-quantum cryptography has received increased attention in recent years, in particular, due to the standardization effort by NIST. One of the second-round candidates in the NIST post-quantum standardization project is Picnic, a post-quantum secure ...
A Canteaut +28 more
core +1 more source
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