Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
From MaRDI portal
Publication:2876885
DOI10.1007/3-540-68339-9_4zbMath1301.94125OpenAlexW1821087317MaRDI QIDQ2876885
Publication date: 20 August 2014
Published in: Advances in Cryptology — EUROCRYPT ’96 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-68339-9_4
hidden field equations (HFE)isomorphism of polynomials (IP)new families of asymmetric algorithmsrepair of Matsumoto-Imai algorithm
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)
Related Items (only showing first 100 items - show all)
Efficient key recovery for all HFE signature variants ⋮ Stronger bounds on the cost of computing Gröbner bases for HFE systems ⋮ Post-quantum secure inner product functional encryption using multivariate public key cryptography ⋮ Computational quantum key distribution (CQKD) on decentralized ledger and blockchain ⋮ Combinatorial Rank Attacks Against the Rectangular Simple Matrix Encryption Scheme ⋮ Generalization of Isomorphism of Polynomials with Two Secrets and Its Application to Public Key Encryption ⋮ Practical Cryptanalysis of k-ary $$C^*$$ ⋮ A Rank Attack Against Extension Field Cancellation ⋮ Multivariate Encryption Schemes Based on Polynomial Equations over Real Numbers ⋮ Solving the problem of blockwise isomorphism of polynomials with circulant matrices ⋮ (Short paper) Simple matrix signature scheme ⋮ Boolean ring cryptographic equation solving ⋮ An application of algebraic geometry to encryption: tame transformation method ⋮ A new perturbation algorithm and enhancing security of SFLASH signature scheme ⋮ Cryptanalysis of a public key cryptosystem based on boolean permutations ⋮ New Ideas to Build Noise-Free Homomorphic Cryptosystems ⋮ Evaluation of Solving Time for Multivariate Quadratic Equation System Using XL Algorithm Over Small Finite Fields on GPU ⋮ Asymmetric Cryptography with a Hidden Monomial ⋮ A Secure Variant of the SRP Encryption Scheme with Shorter Private Key ⋮ The Shortest Signatures Ever ⋮ Last Fall Degree, HFE, and Weil Descent Attacks on ECDLP ⋮ MI-T-HFE, A New Multivariate Signature Scheme ⋮ On the security of stepwise triangular systems ⋮ On tameness of Matsumoto-Imai central maps in three variables over the finite field \(\mathbb F_2\) ⋮ Security analysis on an ElGamal-like multivariate encryption scheme based on isomorphism of polynomials ⋮ An improved affine equivalence algorithm for random permutations ⋮ On enumeration of polynomial equivalence classes ⋮ Cryptanalysis of RGB, a mixed multivariate signature scheme ⋮ Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic ⋮ Practical post-quantum signature schemes from isomorphism problems of trilinear forms ⋮ General linear group action on tensors: a candidate for post-quantum cryptography ⋮ New complexity estimation on the rainbow-band-separation attack ⋮ Computing border bases using mutant strategies ⋮ Key-recovery attacks on \(\mathsf{ASASA}\) ⋮ Isomorphism testing of read-once functions and polynomials ⋮ Enhanced matrix power function for cryptographic primitive construction ⋮ Permutation polynomials over finite fields involving \(x+x^q+\cdots +x^{q^{a-1}}\) ⋮ Efficient public-key operation in multivariate schemes ⋮ Dembowski-Ostrom polynomials from reversed Dickson polynomials ⋮ Cryptanalytic time-memory-data trade-offs for FX-constructions and the affine equivalence problem ⋮ From 5-Pass $$\mathcal {MQ}$$-Based Identification to $$\mathcal {MQ}$$-Based Signatures ⋮ First fall degree and Weil descent ⋮ On the last fall degree of zero-dimensional Weil descent systems ⋮ When does \(G(x)+\gamma \, \text{Tr}(H(x))\) permute \(\mathbb F_{p^n}\)? ⋮ Cryptanalysis of the TRMS Signature Scheme of PKC’05 ⋮ Characteristic set algorithms for equation solving in finite fields ⋮ On the relation between the MXL family of algorithms and Gröbner basis algorithms ⋮ Extended multivariate public key cryptosystems with secure encryption function ⋮ On the equivalence of two post-quantum cryptographic families ⋮ The complexity of solving Weil restriction systems ⋮ The degree of regularity of a quadratic polynomial ⋮ Improvements of algebraic attacks for solving the rank decoding and MinRank problems ⋮ Square-Vinegar Signature Scheme ⋮ Nonlinear Piece In Hand Perturbation Vector Method for Enhancing Security of Multivariate Public Key Cryptosystems ⋮ MXL2: Solving Polynomial Equations over GF(2) Using an Improved Mutant Strategy ⋮ Towards factoring in \(\mathrm{SL}(2,\mathbb F_{2^n})\) ⋮ Revisiting the Cubic UOV Signature Scheme ⋮ EFLASH: a new multivariate encryption scheme ⋮ Public key compression for constrained linear signature schemes ⋮ A general construction for monoid-based knapsack protocols ⋮ Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing ⋮ Poly-Dragon: an efficient multivariate public key cryptosystem ⋮ SimpleMatrix -- a multivariate public key cryptosystem (MPKC) for encryption ⋮ Monkey: Black-Box Symmetric Ciphers Designed for MONopolizing KEYs ⋮ A public-key encryption scheme based on non-linear indeterminate equations ⋮ A multivariate cryptosystem inspired by random linear codes ⋮ Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects ⋮ Unnamed Item ⋮ Kipnis-Shamir Attack on HFE Revisited ⋮ Unnamed Item ⋮ Dembowski-Ostrom polynomials and reversed Dickson polynomials ⋮ Cryptanalysis of the extension field cancellation cryptosystem ⋮ A Multivariate Encryption Scheme with Rainbow ⋮ QUAD: A multivariate stream cipher with provable security ⋮ A new encryption scheme for multivariate quadratic systems ⋮ Square, a New Multivariate Encryption Scheme ⋮ An improved signature model of multivariate polynomial public key cryptosystem against key recovery attack ⋮ Recent Developments in Multivariate Public Key Cryptosystems ⋮ Hybrid MQ Signature for Embedded Device ⋮ Cryptanalytic applications of the polynomial method for solving multivariate equation systems over \(\mathrm{GF}(2)\) ⋮ A public key cryptosystem using a group of permutation polynomials ⋮ Determinant Equivalence Test over Finite Fields and over Q ⋮ Analysis of multivariate encryption schemes: application to Dob ⋮ Multivariate public key cryptosystem from Sidon spaces ⋮ Practical complexities of probabilistic algorithms for solving Boolean polynomial systems ⋮ On enumeration of polynomial equivalence classes and their application to MPKC ⋮ General Fault Attacks on Multivariate Public Key Cryptosystems ⋮ On Provable Security of UOV and HFE Signature Schemes against Chosen-Message Attack ⋮ Roots of Square: Cryptanalysis of Double-Layer Square and Square+ ⋮ Efficient Algorithms for Supersingular Isogeny Diffie-Hellman ⋮ Security analysis via algebraic attack against ``a new encryption scheme for multivariate quadratic system ⋮ Why you cannot even hope to use Gröbner bases in cryptography: an eternal golden braid of failures ⋮ Chosen ciphertext attack on ZHFE ⋮ Determining whether a given cryptographic function is a permutation of another given cryptographic function -- a problem in intellectual property ⋮ A new post-quantum multivariate polynomial public key encapsulation algorithm ⋮ On Dynamical Systems of Large Girth or Cycle Indicator and Their Applications to Multivariate Cryptography ⋮ The Complexity of Public-Key Cryptography ⋮ Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case ⋮ On the effect of projection on rank attacks in multivariate cryptography ⋮ Verifying post-quantum signatures in 8 kB of RAM
This page was built for publication: Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
