A signature scheme from the finite field isomorphism problem

Jeffrey Hoffstein, Joseph H. Silverman, 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.

Available format(s)
Category
Public-key cryptography
Publication info
Published elsewhere. MINOR revision.MathCrypt 2018
Keywords
Digital signaturesfinite field isomorphism problemlattice-based signature
Contact author(s)
zzhang @ onboardsecurity com
History
Short URL
https://ia.cr/2018/675

CC BY

BibTeX

@misc{cryptoeprint:2018/675,
author = {Jeffrey Hoffstein and Joseph H.  Silverman and William Whyte and Zhenfei Zhang},
title = {A signature scheme from the finite field isomorphism problem},
howpublished = {Cryptology ePrint Archive, Paper 2018/675},
year = {2018},
note = {\url{https://eprint.iacr.org/2018/675}},
url = {https://eprint.iacr.org/2018/675}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.