An improved affine equivalence algorithm for random permutations
type: Item
instance of: scholarly article
title: An improved affine equivalence algorithm for random permutations
zbMATH Open document ID: 1423.94067
DOI: 10.1007/978-3-319-78381-9_16
author: Itai Dinur
publication date: 2018-07-09T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6900686
zbMATH Keywords: affine equivalence problem
zbMATH Keywords: block cipher
zbMATH Keywords: Even-Mansour cipher
zbMATH Keywords: cryptanalysis
zbMATH Keywords: rank table
MaRDI profile type: Publication
full work available at URL: 978-3-319-78381-9 16
OpenAlex ID: W2794985459
cites work: Constructing symmetric ciphers using the CAST design procedure
cites work: Cryptographic Schemes Based on the ASASA Structure: Black-Box, White-Box, and Public-Key (Extended Abstract)
cites work: Q4434867
cites work: On Reverse-Engineering S-Boxes with Hidden Design Criteria or Structure
cites work: Graph-Theoretic Algorithms for the “Isomorphism of Polynomials” Problem
cites work: On the classification of APN functions up to dimension five
cites work: On the Behaviors of Affine Equivalent Sboxes Regarding Differential and Linear Attacks
cites work: Limitations of the Even-Mansour construction
cites work: A construction of a cipher from a single pseudorandom permutation.
cites work: Algorithmic Cryptanalysis
cites work: Q4222739
cites work: On the Classification of 4 Bit S-Boxes
cites work: Cryptanalysis of a Generic Class of White-Box Implementations
cites work: Key-Recovery Attacks on ASASA
cites work: Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
cites work: Q4249637
cites work: Cryptanalysis of Reduced-Round SIMON32 and SIMON48
cites work: Laconic oblivious transfer and its applications
cites work: Universally composable two-party and multi-party secure computation
cites work: Multi-identity and Multi-key Leveled FHE from Learning with Errors
cites work: Identity-based encryption from the Diffie-Hellman assumption
cites work: Theory of Cryptography
cites work: Fully homomorphic encryption using ideal lattices
cites work: Candidate indistinguishability obfuscation and functional encryption for all circuits
cites work: Two-Round Secure MPC from Indistinguishability Obfuscation
cites work: Secure Multiparty RAM Computation in Constant Rounds
cites work: Witness encryption and its applications
cites work: Garbled RAM Revisited
cites work: Garbled RAM From One-Way Functions
cites work: Constant-Round MPC with Fairness and Guarantee of Output Delivery
cites work: Perfect Non-interactive Zero Knowledge for NP
cites work: Resettable Statistical Zero Knowledge
cites work: Two-round multiparty secure computation from minimal assumptions
cites work: Smooth projective hashing and two-message oblivious transfer
cites work: Constant-Round Maliciously Secure Two-Party Computation in the RAM Model
cites work: Founding Cryptography on Oblivious Transfer – Efficiently
cites work: A one round protocol for tripartite Diffie-Hellman
cites work: How to Garble RAM Programs?
cites work: A proof of security of Yao's protocol for two-party computation
cites work: Two Round Multiparty Computation via Multi-key FHE
cites work: Efficient oblivious transfer protocols
cites work: Q4526994
cites work: Multi-key FHE from LWE, Revisited
cites work: A Framework for Efficient and Composable Oblivious Transfer
description: scientific article; zbMATH DE number 6900686