An improved affine equivalence algorithm for random permutations
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1231233 (Why is no real title available?)
- scientific article; zbMATH DE number 1303122 (Why is no real title available?)
- scientific article; zbMATH DE number 2009947 (Why is no real title available?)
- scientific article; zbMATH DE number 1559545 (Why is no real title available?)
- A Framework for Efficient and Composable Oblivious Transfer
- A construction of a cipher from a single pseudorandom permutation.
- A one round protocol for tripartite Diffie-Hellman
- A proof of security of Yao's protocol for two-party computation
- Algorithmic Cryptanalysis
- An improved affine equivalence algorithm for random permutations
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Constant-Round MPC with Fairness and Guarantee of Output Delivery
- Constant-round maliciously secure two-party computation in the RAM model
- Constructing symmetric ciphers using the CAST design procedure
- Cryptanalysis of a Generic Class of White-Box Implementations
- Cryptanalysis of reduced-round SIMON32 and SIMON48
- Cryptographic Schemes Based on the ASASA Structure: Black-Box, White-Box, and Public-Key (Extended Abstract)
- Efficient oblivious transfer protocols
- Founding Cryptography on Oblivious Transfer – Efficiently
- Fully homomorphic encryption using ideal lattices
- Garbled RAM from one-way functions
- Garbled RAM revisited
- Graph-theoretic algorithms for the ``isomorphism of polynomials problem
- Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms
- How to garble RAM programs?
- Identity-based encryption from the Diffie-Hellman assumption
- Key-recovery attacks on \(\mathsf {ASASA}\)
- Laconic oblivious transfer and its applications
- Limitations of the Even-Mansour construction
- Multi-identity and multi-key leveled FHE from learning with errors
- Multi-key FHE from LWE, revisited
- On Reverse-Engineering S-Boxes with Hidden Design Criteria or Structure
- On the Behaviors of Affine Equivalent Sboxes Regarding Differential and Linear Attacks
- On the Classification of 4 Bit S-Boxes
- On the classification of APN functions up to dimension five
- Perfect Non-interactive Zero Knowledge for NP
- Resettable statistical zero knowledge
- Secure multiparty RAM computation in constant rounds
- Smooth projective hashing and two-message oblivious transfer
- Theory of Cryptography
- Two round multiparty computation via multi-key FHE
- Two-round multiparty secure computation from minimal assumptions
- Two-round secure MPC from indistinguishability obfuscation
- Universally composable two-party and multi-party secure computation
- Witness encryption and its applications
Cited in
(13)- Improved Approximation Algorithm for the Number of Queries Necessary to Identify a Permutation
- \texttt{HAWKEYE} -- recovering symmetric cryptography from hardware circuits
- On self-equivalence encodings in white-box implementations
- About linear and affine equivalence of substitutions
- Collision-based attacks on white-box implementations of the AES block cipher
- A linear equivalence algorithm
- New algorithms of distance-increasing mappings from binary vectors to permutations by swaps
- Cryptanalytic time-memory-data trade-offs for FX-constructions and the affine equivalence problem
- Discovering affine equalities using random interpretation
- scientific article; zbMATH DE number 2009947 (Why is no real title available?)
- Extending permutation arrays: improving MOLS bounds
- An improved affine equivalence algorithm for random permutations
- On affine classification of permutations on the space \(\mathrm{GF}(2)^3\)
This page was built for publication: An improved affine equivalence algorithm for random permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1648807)
