Cryptology ePrint Archive: Report 2018/675

A signature scheme from the finite field isomorphism problem

Jeffrey Hoffstein and Joseph H. Silverman and William Whyte and Zhenfei Zhang

Abstract: In a recent paper the authors and their collaborators proposed a new hard problem, called the finite field isomorphism problem, and they used it to construct a fully homomorphic encryption scheme. In this paper, we investigate how one might build a digital signature scheme from this new problem. Intuitively, the hidden field isomorphism allows us to convert short vectors in the underlying lattice of one field into generic looking vectors in an isomorphic field.

Category / Keywords: public-key cryptography / Digital signatures, finite field isomorphism problem, lattice-based signature

Original Publication (with minor differences): MathCrypt 2018

Date: received 12 Jul 2018

Contact author: zzhang at onboardsecurity com

Available format(s): PDF | BibTeX Citation

Version: 20180713:141000 (All versions of this report)

Short URL: ia.cr/2018/675


[ Cryptology ePrint archive ]