Cryptanalysis of symmetric primitives over rings and a key recovery attack on \textsf{Rubato}
From MaRDI portal
Publication:6145950
Recommendations
- \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption
- scientific article; zbMATH DE number 1759791
- Algebraic attacks on Rasta and Dasta using low-degree equations
- On the homomorphic computation of symmetric cryptographic primitives
- Algebraic analysis of the Simon block cipher family
Cites work
- scientific article; zbMATH DE number 1722685 (Why is no real title available?)
- scientific article; zbMATH DE number 417582 (Why is no real title available?)
- scientific article; zbMATH DE number 638938 (Why is no real title available?)
- scientific article; zbMATH DE number 1455090 (Why is no real title available?)
- scientific article; zbMATH DE number 1394292 (Why is no real title available?)
- scientific article; zbMATH DE number 1418251 (Why is no real title available?)
- scientific article; zbMATH DE number 1418284 (Why is no real title available?)
- A Cryptanalysis of PRINTcipher: The Invariant Subspace Attack
- A generic approach to invariant subspace attacks: cryptanalysis of Robin, iSCREAM and Zorro
- A new efficient algorithm for computing Gröbner bases (F₄)
- Algebraic cryptanalysis of STARK-friendly designs: application to MARVELlous and MiMC
- An algebraic attack on ciphers with low-degree round functions: application to full MiMC
- Biclique Cryptanalysis of the Full AES
- Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials
- Differential cryptanalysis of DES-like cryptosystems
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Exact solution of linear equations using p-adic expansions
- Factoring modular polynomials
- From Farfalle to \textsc{Megafono} via Ciminion: the PRF \textsc{Hydra} for MPC applications
- Gaussian elimination is not optimal
- Higher Order Derivatives and Differential Cryptanalysis
- MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity
- Mind the middle layer: the HADES design strategy revisited
- Moz\(\mathbb{Z}_{2^k}\)arella: efficient vector-OLE and zero-knowledge proofs over \(\mathbb{Z}_{2^k}\)
- On a generalization of substitution-permutation networks: the HADES design strategy
- On polynomial functions (mod m)
- On polynomial functions Modulo \(p^e\) and faster bootstrapping for homomorphic encryption
- On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses
- Out of oddity -- new cryptanalytic techniques against symmetric primitives optimized for integrity proof systems
- Permutation polynomials modulo \(2^w\)
- Polynomial interpolation over the residue rings Z_n
- Query-Efficient Algorithms for Polynomial Interpolation over Composites
- Rasta: a cipher with low ANDdepth and few ANDs per bit
- Rinocchio: SNARKs for ring arithmetic
- The Wide Trail Design Strategy
- The \textsc{Simon} and \textsc{Speck} block ciphers on AVR 8-bit microcontrollers
- The complexity of MinRank
- The interpolation attack on block ciphers
- Towards case-optimized hybrid homomorphic encryption. Featuring the \textsf{Elisabeth} stream cipher
- Transciphering framework for approximate homomorphic encryption
- \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
- \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption
- \textsc{Ciminion}: symmetric encryption based on Toffoli-gates over large finite fields
This page was built for publication: Cryptanalysis of symmetric primitives over rings and a key recovery attack on \textsf{Rubato}
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6145950)
