An improved affine equivalence algorithm for random permutations
From MaRDI portal
Publication:1648807
DOI10.1007/978-3-319-78381-9_16zbMath1423.94067OpenAlexW2794985459MaRDI QIDQ1648807
Publication date: 9 July 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-78381-9_16
Related Items (3)
On self-equivalence encodings in white-box implementations ⋮ An improved affine equivalence algorithm for random permutations ⋮ Cryptanalytic time-memory-data trade-offs for FX-constructions and the affine equivalence problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smooth projective hashing and two-message oblivious transfer
- On the classification of APN functions up to dimension five
- A proof of security of Yao's protocol for two-party computation
- A construction of a cipher from a single pseudorandom permutation.
- Constructing symmetric ciphers using the CAST design procedure
- An improved affine equivalence algorithm for random permutations
- Two-round multiparty secure computation from minimal assumptions
- Identity-based encryption from the Diffie-Hellman assumption
- Laconic oblivious transfer and its applications
- A one round protocol for tripartite Diffie-Hellman
- Key-Recovery Attacks on ASASA
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
- Resettable Statistical Zero Knowledge
- Cryptographic Schemes Based on the ASASA Structure: Black-Box, White-Box, and Public-Key (Extended Abstract)
- Garbled RAM From One-Way Functions
- Cryptanalysis of Reduced-Round SIMON32 and SIMON48
- On the Behaviors of Affine Equivalent Sboxes Regarding Differential and Linear Attacks
- Secure Multiparty RAM Computation in Constant Rounds
- Constant-Round Maliciously Secure Two-Party Computation in the RAM Model
- Multi-key FHE from LWE, Revisited
- Constant-Round MPC with Fairness and Guarantee of Output Delivery
- Multi-identity and Multi-key Leveled FHE from Learning with Errors
- On Reverse-Engineering S-Boxes with Hidden Design Criteria or Structure
- Universally composable two-party and multi-party secure computation
- Perfect Non-interactive Zero Knowledge for NP
- A Framework for Efficient and Composable Oblivious Transfer
- Founding Cryptography on Oblivious Transfer – Efficiently
- Cryptanalysis of a Generic Class of White-Box Implementations
- Limitations of the Even-Mansour construction
- Graph-Theoretic Algorithms for the “Isomorphism of Polynomials” Problem
- How to Garble RAM Programs?
- Fully homomorphic encryption using ideal lattices
- Algorithmic Cryptanalysis
- Garbled RAM Revisited
- On the Classification of 4 Bit S-Boxes
- Witness encryption and its applications
- Two Round Multiparty Computation via Multi-key FHE
- Two-Round Secure MPC from Indistinguishability Obfuscation
- Theory of Cryptography
This page was built for publication: An improved affine equivalence algorithm for random permutations
