A signature scheme from the finite field isomorphism problem

DOI10.1515/jmc-2015-0050zbMath1450.94051OpenAlexW3036684589MaRDI QIDQ2191202

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

Publication date: 24 June 2020

Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/jmc-2015-0050

zbMATH Keywords

NTRU latticelattice-based signaturefinite field isomorphism problem

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (1)

On the hardness of the finite field isomorphism problem

Uses Software

• Magma
• BLISS
• BKZ
• NTRU
• NTRUSign

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures
• Probabilistic algorithm for testing primality
• Riemann's hypothesis and tests for primality
• The Magma algebra system. I: The user language
• Fully homomorphic encryption from the finite field isomorphism problem
• Lattice Signatures and Bimodal Gaussians
• Lattice Signatures without Trapdoors
• Transcript Secure Signatures Based on Modular Lattices
• Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
• BKZ 2.0: Better Lattice Security Estimates
• A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
• Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
• Learning a Zonotope and More: Cryptanalysis of NTRUSign Countermeasures

This page was built for publication: A signature scheme from the finite field isomorphism problem