General Linear Group Action on Tensors: A Candidate for Post-Quantum Cryptography

06/11/2019
by   Zhengfeng Ji, et al.
0

Starting from the one-way group action framework of Brassard and Yung (Crypto '90), we revisit building cryptography based on group actions. Several previous candidates for one-way group actions no longer stand, due to progress both on classical algorithms (e.g., graph isomorphism) and quantum algorithms (e.g., discrete logarithm). We propose the general linear group action on tensors as a new candidate to build cryptography based on group actions. Recent works (Futorny--Grochow--Sergeichuk, Lin. Alg. Appl., 2019) suggest that the underlying algorithmic problem, the tensor isomorphism problem, is the hardest one among several isomorphism testing problems arising from areas including coding theory, computational group theory, and multivariate cryptography. We present evidence to justify the viability of this proposal from comprehensive study of the state-of-art heuristic algorithms, theoretical algorithms, and hardness results, as well as quantum algorithms. We then introduce a new notion called pseudorandom group actions to further develop group-action based cryptography. Briefly speaking, given a group G acting on a set S, we assume that it is hard to distinguish two distributions of (s, t) either uniformly chosen from S× S, or where s is randomly chosen from S and t is the result of applying a random group action of g∈ G on s. This subsumes the classical decisional Diffie-Hellman assumption when specialized to a particular group action. We carefully analyze various attack strategies that support the general linear group action on tensors as a candidate for this assumption. Finally, we establish the quantum security of several cryptographic primitives based on the one-way group action assumption and the pseudorandom group action assumption.

READ FULL TEXT
research
01/04/2023

Cryptographic Group and Semigroup Actions

We consider actions of a group or a semigroup on a set, which generalize...
research
12/26/2017

Quantum Learning Algorithms and Post-Quantum Cryptography

Quantum algorithms have demonstrated promising speed-ups over classical ...
research
06/05/2023

On the complexity of isomorphism problems for tensors, groups, and polynomials III: actions by classical groups

We study the complexity of isomorphism problems for d-way arrays, or ten...
research
04/25/2023

SPDH-Sign: towards Efficient, Post-quantum Group-based Signatures

In this paper, we present a new diverse class of post-quantum group-base...
research
06/08/2018

Provably Secure Integration Cryptosystem on Non-Commutative Group

Braid group is a very important non-commutative group. It is also an imp...
research
07/22/2023

Quantum Money from Abelian Group Actions

We give a candidate construction of public key quantum money, and even a...
research
06/30/2019

Isomorphism problems for tensors, groups, and cubic forms: completeness and reductions

In this paper we consider the problems of testing isomorphism of tensors...

Please sign up or login with your details

Forgot password? Click here to reset