Results 11 to 20 of about 71 (49)
MRHS solver based on linear algebra and exhaustive search
Journal of Mathematical Cryptology, 2018 We show how to build a binary matrix from the MRHS representation of a symmetric-key cipher. The matrix contains the cipher represented as an equation system and can be used to assess a cipher’s resistance against algebraic attacks.
Håvard Raddum, Pavol Zajac
exaly +2 more sources
Provable Security of SP Networks with Partial Non-Linear Layers
IACR Transactions on Symmetric Cryptology, 2021 Motivated by the recent trend towards low multiplicative complexity blockciphers (e.g., Zorro, CHES 2013; LowMC, EUROCRYPT 2015; HADES, EUROCRYPT 2020; MALICIOUS, CRYPTO 2020), we study their underlying structure partial SPNs, i.e., Substitution ...
Chun Guo +4 more
doaj +1 more source
Cryptanalysis of Low-Data Instances of Full LowMCv2
IACR Transactions on Symmetric Cryptology, 2018 LowMC is a family of block ciphers designed for a low multiplicative complexity. The specification allows a large variety of instantiations, differing in block size, key size, number of S-boxes applied per round and allowed data complexity. The number of
Christian Rechberger +2 more
doaj +1 more source
Differential Attacks by Algebraic Solving on a Series of HE‐Friendly Stream Ciphers
IET Information Security, Volume 2026, Issue 1, 2026.In recent years, many symmetric encryption ciphers have been proposed for homomorphic encryption (HE) applications. Rasta and its variants Masta and Pasta have gradually become a self‐contained series of HE‐friendly stream ciphers. The feature of these ciphers is that a fresh affine layer is randomly generated for each encryption.
Xichao Hu +5 more
wiley +1 more source
Differential Fault Attacks on Privacy Protocols Friendly Symmetric‐Key Primitives: RAIN and HERA
IET Information Security, Volume 2024, Issue 1, 2024.As the practical applications of fully homomorphic encryption (FHE), secure multi‐party computation (MPC) and zero‐knowledge (ZK) proof continue to increase, so does the need to design and analyze new symmetric‐key primitives that can adapt to these privacy‐preserving protocols.
Lin Jiao +4 more
wiley +1 more source
High-Performance Hardware Implementation of MPCitH and Picnic3
Transactions on Cryptographic Hardware and Embedded SystemsPicnic is a post-quantum digital signature, the security of which relies solely on symmetric-key primitives such as block ciphers and hash functions instead of number theoretic assumptions. One of the main concerns of Picnic is the large signature size.
Guoxiao Liu +3 more
doaj +1 more source
Improving MPCitH with Preprocessing: Mask Is All You Need
Transactions on Cryptographic Hardware and Embedded SystemsThe MPC-in-the-head with preprocessing (MPCitH-PP) paradigm presents a novel approach for constructing post-quantum digital signatures like Picnic3.
Guowei Liu +6 more
doaj +1 more source
MathematicsArtificial intelligence (AI) agents increasingly need credentials such as application programming interface (API) keys and Secure Shell (SSH) credentials, but placing those secrets in the agent process exposes them to prompt injection, tool misuse, and ...
Shutong Jin, Ruiyi Guo, Ray C. C. Cheung
doaj +1 more source
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 +2 more sources
Efficient implementation of LowMC in HElib
, 2018 LowMC 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 implementation can be improved when encrypting a single plaintext.
openaire +2 more sources