Rasta: a cipher with low ANDdepth and few ANDs per bit
From MaRDI portal
Publication:1673415
DOI10.1007/978-3-319-96884-1_22zbMath1444.94064OpenAlexW2953015727MaRDI QIDQ1673415
Lorenzo Grassi, Maria Eichlseder, Gregor Leander, Virginie Lallemand, Christian Rechberger, Eik List, Christoph Dobraunig, Florian Mendel
Publication date: 12 September 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-96884-1_22
Related Items (24)
Interpolation cryptanalysis of unbalanced Feistel networks with low degree round functions ⋮ Exploring crypto dark matter: new simple PRF candidates and their applications ⋮ Transciphering, using FiLIP and TFHE for an efficient delegation of computation ⋮ Integral attacks on Pyjamask-96 and round-reduced Pyjamask-128 ⋮ FASTA -- a stream cipher for fast FHE evaluation ⋮ \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption ⋮ Improved filter permutators for efficient FHE: better instances and implementations ⋮ Coefficient grouping: breaking Chaghri and more ⋮ Lighter is better: a lighter multi-client verifiable outsourced computation with hybrid homomorphic encryption ⋮ Cryptanalysis of Ciminion ⋮ Algebraic meet-in-the-middle attack on LowMC ⋮ Towards case-optimized hybrid homomorphic encryption. Featuring the \textsf{Elisabeth} stream cipher ⋮ Cryptanalysis of symmetric primitives over rings and a key recovery attack on \textsf{Rubato} ⋮ Algebraic attacks on Rasta and Dasta using low-degree equations ⋮ Transciphering framework for approximate homomorphic encryption ⋮ Coefficient grouping for complex affine layers ⋮ New cryptanalysis of LowMC with algebraic techniques ⋮ Boolean Functions for Homomorphic-Friendly Stream Ciphers ⋮ Boolean functions with multiplicative complexity 3 and 4 ⋮ \textsc{Ciminion}: symmetric encryption based on Toffoli-gates over large finite fields ⋮ The inverse of \(\chi\) and its applications to Rasta-like ciphers ⋮ Out of oddity -- new cryptanalytic techniques against symmetric primitives optimized for integrity proof systems ⋮ Efficient homomorphic conversion between (ring) LWE ciphertexts ⋮ On a generalization of substitution-permutation networks: the HADES design strategy
This page was built for publication: Rasta: a cipher with low ANDdepth and few ANDs per bit
