Minimize the randomness in Rasta-like designs: how far can we go? Application to \textsc{Pasta}

DOI10.1007/978-3-031-82841-6_9MaRDI QIDQ6970667zbMATH OpenFDO

Authors Lorenzo Grassi, Fukang Liu, Christian Rechberger, Fabian Schmid, Roman Walch, Qingju Wang

Publication date 17 June 2025

Full work available at URL https://doi.org/10.1007/978-3-031-82841-6_9

zbMATH Keywords

\textsc{Pasta}\textsc{Pasta}\textsuperscript{\texttt{v2}}\textsf{HHE}interweaving matrixRasta

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• (Leveled) fully homomorphic encryption without bootstrapping
• \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption
• \texttt{Horst} meets \textit{Fluid}-SPN: Griffin for zero-knowledge applications
• Algebraic attacks on Rasta and Dasta using low-degree equations
• Ciphers for MPC and FHE
• Cryptanalysis of \texttt{Elisabeth-4}
• Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials
• Cryptanalysis of symmetric primitives over rings and a key recovery attack on \textsf{Rubato}
• Cryptanalysis of the FLIP family of stream ciphers
• Cube Attacks on Tweakable Black Box Polynomials
• Differential and Linear Cryptanalysis Using Mixed-Integer Linear Programming
• FASTA -- a stream cipher for fast FHE evaluation
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Homomorphic encryption for arithmetic of approximate numbers
• Homomorphic evaluation of the AES circuit
• scientific article; zbMATH DE number 1682693 (Why is no real title available?)
• scientific article; zbMATH DE number 503238 (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?)
• Improved filter permutators for efficient FHE: better instances and implementations
• MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity
• New design techniques for efficient arithmetization-oriented hash functions: \texttt{Anemoi} permutations and \texttt{Jive} compression mode
• On a generalization of substitution-permutation networks: the HADES design strategy
• On lattices, learning with errors, random linear codes, and cryptography
• Optimized interpolation attacks on lowMC
• Out of oddity -- new cryptanalytic techniques against symmetric primitives optimized for integrity proof systems
• Rasta: a cipher with low ANDdepth and few ANDs per bit
• Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
• The interpolation attack on block ciphers
• The inverse of \(\chi\) and its applications to Rasta-like ciphers
• The LED block cipher
• The PHOTON family of lightweight hash functions
• The Wide Trail Design Strategy
• Transciphering framework for approximate homomorphic encryption
• Trivium: A Stream Cipher Construction Inspired by Block Cipher Design Principles
• YuX: finite field multiplication based block ciphers for efficient FHE evaluation
• Zero correlation linear cryptanalysis with reduced data complexity

This page was built for publication: Minimize the randomness in Rasta-like designs: how far can we go? Application to \textsc{Pasta}

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6970667)