Cryptanalysis of symmetric primitives over rings and a key recovery attack on \textsf{Rubato}

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Polynomial interpolation over the residue rings \(\mathbb Z_n\)
Differential cryptanalysis of DES-like cryptosystems
Exact solution of linear equations using p-adic expansions
Factoring modular polynomials
A new efficient algorithm for computing Gröbner bases \((F_4)\)
Efficient computation of zero-dimensional Gröbner bases by change of ordering
Rasta: a cipher with low ANDdepth and few ANDs per bit
\(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
On polynomial functions (mod m)
\textsc{Ciminion}: symmetric encryption based on Toffoli-gates over large finite fields
Mind the middle layer: the HADES design strategy revisited
Out of oddity -- new cryptanalytic techniques against symmetric primitives optimized for integrity proof systems
On a generalization of substitution-permutation networks: the HADES design strategy
\(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption
Algebraic cryptanalysis of STARK-friendly designs: application to MARVELlous and MiMC
Gaussian elimination is not optimal
An algebraic attack on ciphers with low-degree round functions: application to full MiMC
The Simon and Speck Block Ciphers on AVR 8-Bit Microcontrollers
A Generic Approach to Invariant Subspace Attacks: Cryptanalysis of Robin, iSCREAM and Zorro
MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity
Biclique Cryptanalysis of the Full AES
On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses
Query-Efficient Algorithms for Polynomial Interpolation over Composites
Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials
The Wide Trail Design Strategy
The interpolation attack on block ciphers
Higher Order Derivatives and Differential Cryptanalysis
The Complexity of MinRank
A Cryptanalysis of PRINTcipher: The Invariant Subspace Attack
Permutation polynomials modulo \(2^w\)
On polynomial functions Modulo \(p^e\) and faster bootstrapping for homomorphic encryption
Rinocchio: SNARKs for ring arithmetic
From Farfalle to \textsc{Megafono} via Ciminion: the PRF \textsc{Hydra} for MPC applications
Towards case-optimized hybrid homomorphic encryption. Featuring the \textsf{Elisabeth} stream cipher
Transciphering framework for approximate homomorphic encryption
Moz\(\mathbb{Z}_{2^k}\)arella: efficient vector-OLE and zero-knowledge proofs over \(\mathbb{Z}_{2^k}\)

This page was built for publication: Cryptanalysis of symmetric primitives over rings and a key recovery attack on \textsf{Rubato}