We describe a new proposal for a trap-door one-way function. The new proposal belongs to the "multivariate quadratic" family but the trap-door is different from existing methods, and is simpler

Schulman, Leonard J.

English

Caltech Authors - Main

Cryptography from tensor problems

This manuscript describes a proposal for a new trap-door
one-way function of the multivariate-quadratic type. It was
first posted to the IACR preprint server in May
2012. Subsequently, Enrico Thomae and Christopher Wolf were
able to to determine that a small-minors MinRank attack
works against this scheme. I would like to thank them for
their close study of the proposal. The manuscript follows as
originally posted, with the addition of a few references and
a brief description of the successful attack (end of
Section 4.1)

Leonard J.  Schulman

Cryptology ePrint Archive

A distinguisher for high rate McEliece cryptosystems.

A fast quantum mechanical algorithm for database search.

A method for  codewords of small weight.

A method for finding codewords of small weight.

A new algorithm for  minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511.

A note on the complexity of cryptography.

A public-key cryptosystem based on algebraic coding theory.

A public-key cryptosystem with worst-case/average-case equivalence.

A subexponential time algorithm for the dihedral hidden subgroup problem with polynomial space.

A subexponential-time quantum algorithm for the dihedral hidden subgroup.

About the XL Algorithm over GF(2). In

Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gro¨bner Bases. In

Almost perfect lattices, the covering radius problem, and applications to Ajtai's connection factor.

Almost perfect lattices, the covering radius problem, and applications to Ajtai’s connection factor.

An algorithm for  the permutation between two equivalent binary codes.

An algorithm for finding the permutation between two equivalent binary codes.

An improvement on rank of explicit tensors.

Asymptotic behaviour of the degree of regularity of semi-regular polynomial systems.

Attacking and Defending the McEliece Cryptosystem.

Attacks on the birational permutation signature schemes.

Breaking the Coppersmith-Winograd barrier.

Comparison Between XL and Gr obner Basis Algorithms. In

Complexity of Lattice Problems.

Computing loci of rank defects of linear matrices using Gr obner bases and applications to cryptology. In

Computing loci of rank defects of linear matrices using Gro¨bner bases and applications to cryptology. In

Cryptanalysis of block ciphers with overde systems of equations.

Cryptanalysis of HFE with Internal Perturbation.

Cryptanalysis of MinRank.

Cryptanalysis of the HFE public key cryptosystem.

Cryptanalysis of the ttm cryptosystem.

Cryptoanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt'88. In

Cryptoanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt’88. In

Cryptoanalysis of the Original McEliece Cryptosystem. In

Ecient algorithms for solving overde systems of multivariate polynomial equations.

Exponential algorithmic speedup by a quantum walk.

Fast polynomial factorization and modular composition in small characteristic.

Field extension and trilinear aggregating, uniting and canceling for the acceleration of matrix multiplications.

Finding the permutation between equivalent linear codes: The support splitting algorithm.

Gaussian elimination is not optimal.

Generalized compact knapsacks, cyclic lattices, and ecient one-way functions.

Generalized compact knapsacks, cyclic lattices, and efficient one-way functions.

Generating hard instances of lattice problems (extended abstract).

Global properties of tensor rank. Linear Algebra and its Applications,

Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms. In

Hidden subgroup states are almost orthogonal. (LANL preprint quant-ph/9901034),

Inverting HFE Is Quasipolynomial. In

Knapsack-type cryptosystems and algebraic coding theory.

Lattice-based cryptography. In

Limitations of quantum coset states for graph isomorphism.

Lower bounds for matrix product.

Matrix multiplication via arithmetic progressions.

MutantXL: solving multivariate polynomial equations for cryptanalysis. Dagstuhl seminar proceedings 09031,

MXL2: Solving Polynomial Equations over GF(2) Using an Improved Mutant Strategy. In PQCrypto,

New combinations of methods for the acceleration of matrix multiplication.

New fast algorithms for matrix operations.

New lattice-based cryptographic constructions.

Normal subgroup reconstruction and quantum computation using group representations.

O(n2.7799) complexity for n*n approximate matrix multiplication.

On quantum algorithms for noncommutative hidden subgroups.

On the asymptotic complexity of matrix multiplication.

On the complexity of matrix multiplication.

On the complexity of solving quadratic boolean systems. arXiv:1112.6263,

On the impossibility of a quantum sieve algorithm for graph isomorphism.

On the maximum rank of a tensor product.

On the power of quantum computation.

On the relation between the MXL family of algorithms and Gr obner basis algorithms. Cryptology ePrint Archive,

On the Security of HFE, HFEv- and Quartz.

Optimal measurements for the dihedral hidden subgroup problem.

Partial and total matrix multiplication.

Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer.

Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem.

Polynomial-time quantum algorithms for Pell’s equation and the principal ideal problem.

Proposal of a Signature Scheme Based on STS Trapdoor.

Public quadratic polynomial-tuples for ecient signatureveri and message-encryption.

Public quadratic polynomial-tuples for efficient signatureverification and message-encryption.

Quantum computation and lattice problems.

Quantum Cryptanalysis of Hidden Linear Functions (Extended Abstract). In

Quantum mechanical algorithms for the nonabelian hidden subgroup problem.

Relative bilinear complexity and matrix multiplication.

Shor's discrete logarithm quantum algorithm for elliptic curves.

Shor’s discrete logarithm quantum algorithm for elliptic curves.

Short Signatures, Provable Security, Generic Attacks and

Solving systems of multivariate quadratic equations or: from relinearization to MutantXL. Cryptology ePrint Archive 2010/596.

Some properties of disjoint sums of tensors related to matrix multiplication.

Strassen's algorithm is not optimal.

Strassen’s algorithm is not optimal.

Strengths and weaknesses of quantum computing.

Taxonomy of public key schemes based on the problem of multivariate quadratic equations. Cryptology ePrint Archive, Report

Ten Lectures on the Probabilistic Method.

Tensor rank is NP-complete.

Tensor rank: some lower and upper bounds. (Preprint arXiv:1102.0072v1),

The asymptotic spectrum of tensors and the exponent of matrix multiplication.

The computational complexity of some problems of linear algebra.

The security of Hidden Field Equations

The security of the birational permutation signature schemes.

The symmetric group de strong fourier sampling.

The symmetric group defies strong fourier sampling.

Theoretical Analysis of XL over Small Fields. In

Using Strassen's algorithm to accelerate the solution of linear systems.

Worst-case to average-case reductions based on Gaussian measures.

Cryptography from tensor problems

Abstract

Similar works

Full text

Available Versions

Caltech Authors - Main

Cryptology ePrint Archive