Cryptanalysis of symmetric primitives over rings and a key recovery attack on \textsf{Rubato}
From MaRDI portal
Publication:6145950
DOI10.1007/978-3-031-38548-3_11MaRDI QIDQ6145950FDOQ6145950
Qingju Wang, Irati Manterola Ayala, Håvard Raddum, Morten Øygarden, Lorenzo Grassi, Martha Norberg Hovd
Publication date: 2 February 2024
Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)
algebraic cryptanalysiscomposite moduluskey recovery attack\textsf{Rubato}arithmetization oriented primitives
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Gaussian elimination is not optimal
- Exact solution of linear equations using p-adic expansions
- Higher Order Derivatives and Differential Cryptanalysis
- A Cryptanalysis of PRINTcipher: The Invariant Subspace Attack
- Differential cryptanalysis of DES-like cryptosystems
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Biclique Cryptanalysis of the Full AES
- Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials
- On polynomial functions (mod m)
- The Wide Trail Design Strategy
- The interpolation attack on block ciphers
- On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses
- The Simon and Speck Block Ciphers on AVR 8-Bit Microcontrollers
- A Generic Approach to Invariant Subspace Attacks: Cryptanalysis of Robin, iSCREAM and Zorro
- Query-Efficient Algorithms for Polynomial Interpolation over Composites
- Permutation polynomials modulo \(2^w\)
- Polynomial interpolation over the residue rings \(\mathbb Z_n\)
- \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
- Rasta: a cipher with low ANDdepth and few ANDs per bit
- Out of oddity -- new cryptanalytic techniques against symmetric primitives optimized for integrity proof systems
- Algebraic cryptanalysis of STARK-friendly designs: application to MARVELlous and MiMC
- MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity
- Factoring modular polynomials
- On polynomial functions Modulo \(p^e\) and faster bootstrapping for homomorphic encryption
- \textsc{Ciminion}: symmetric encryption based on Toffoli-gates over large finite fields
- Mind the middle layer: the HADES design strategy revisited
- On a generalization of substitution-permutation networks: the HADES design strategy
- An algebraic attack on ciphers with low-degree round functions: application to full MiMC
- The Complexity of MinRank
- \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption
- Transciphering framework for approximate homomorphic encryption
- Rinocchio: SNARKs for ring arithmetic
- Moz\(\mathbb{Z}_{2^k}\)arella: efficient vector-OLE and zero-knowledge proofs over \(\mathbb{Z}_{2^k}\)
- 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
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)