Cryptology ePrint Archive: Report 2019/687

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

Zhengfeng Ji and Youming Qiao and Fang Song and Aaram Yun

Abstract: 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 SS, or where s is randomly chosen from S and t is the result of applying a random group action of 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.

Category / Keywords: foundations / Group actions, isomorphism problems, signature schemes, pseudorandom functions, post-quantum cryptography

Date: received 10 Jun 2019, last revised 10 Jun 2019

Contact author: jizhengfeng at gmail com

Available format(s): PDF | BibTeX Citation

Note: 38 pages

Version: 20190611:082735 (All versions of this report)

Short URL: ia.cr/2019/687


[ Cryptology ePrint archive ]