Efficient Nyberg-Rueppel type of NTRU digital signature algorithm

DOI10.3906/mat-2102-116OpenAlexW4229818418MaRDI QIDQ5101024

Barış Bülent Kırlar, Ferdi Elverdi, Sedat Akleylek

Publication date: 2 September 2022

Published in: TURKISH JOURNAL OF MATHEMATICS (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3906/mat-2102-116

zbMATH Keywords

digital signaturemessage recoveryNTRUpost-quantum cryptography

Mathematics Subject Classification ID

Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Uses Software

• BLISS
• NTRU
• MaTRU
• NTRUSign

Cites Work

• NTRU over rings beyond \(\mathbb{Z}\)
• Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures
• Factoring polynomials with rational coefficients
• Message recovery for signature schemes based on the discrete logarithm problem
• Message transmission for GH-public key cryptosystem
• Fast LLL-type lattice reduction
• Lattice Signatures and Bimodal Gaussians
• Transcript Secure Signatures Based on Modular Lattices
• A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
• Elliptic Curve Cryptosystems
• A method for obtaining digital signatures and public-key cryptosystems
• Optimizing polynomial convolution for NTRUEncrypt
• Learning a Zonotope and More: Cryptanalysis of NTRUSign Countermeasures
• Efficient message transmission via twisted Edwards curves
• MaTRU: A New NTRU-Based Cryptosystem
• An Introduction to Mathematical Cryptography
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient Nyberg-Rueppel type of NTRU digital signature algorithm