Sparse polynomial multiplication for lattice-based cryptography with small complexity
Authors:
- 24 November 2015
- journal article
- research article
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 72 (2) , 438-450
Abstract
No abstract availableKeywords
Funding Information
- TÜBİTAK (2219, 2214-A)
- Deutsche Forschungsgemeinschaft (Crossing)
This publication has 16 references indexed in Scilit:
- Lattice Signatures and Bimodal Gaussians2013
- Software Speed Records for Lattice-Based SignaturesLecture Notes in Computer Science, 2013
- Efficient Implementation of NTRU Cryptosystem Using Sliding Window MethodsIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2013
- Towards Efficient Arithmetic for Lattice-Based Cryptography on Reconfigurable Hardware2012
- On Ideal Lattices and Learning with Errors over Rings2010
- Sliding Window Method for NTRU2007
- NTRU in Constrained Devices2001
- NTRU: A ring-based public key cryptosystem1998
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Journal on Computing, 1997
- The fast Fourier transform in a finite fieldMathematics of Computation, 1971