A comprehensive review on collision-resistant hash functions on lattices
Authors:
- Nimish MishraNMNimish Mishra
- Sk Hafizul IslamSISk Hafizul Islam
- Sherali ZeadallySZSherali Zeadally
- 1 May 2021
- journal article
- research article
- Published by Elsevier in Journal of Information Security and Applications
- Vol. 58
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Sieve algorithms for the shortest vector problem are practicalJournal of Mathematical Cryptology, 2008
- Worst‐Case to Average‐Case Reductions Based on Gaussian MeasuresSIAM Journal on Computing, 2007
- The Hardness of the Closest Vector Problem With Preprocessing Over$ell_infty$NormIEEE Transactions on Information Theory, 2006
- New lattice-based cryptographic constructionsJournal of the ACM, 2004
- Almost Perfect Lattices, the Covering Radius Problem, and Applications to Ajtai's Connection FactorSIAM Journal on Computing, 2004
- The hardness of the closest vector problem with preprocessingIEEE Transactions on Information Theory, 2001
- Efficient cryptographic schemes provably as secure as subset sumJournal of Cryptology, 1996
- A hierarchy of polynomial time lattice basis reduction algorithmsTheoretical Computer Science, 1987
- Improved methods for calculating vectors of short length in a lattice, including a complexity analysisMathematics of Computation, 1985
- On the computation of lattice vectors of minimal length, successive minima and reduced bases with applicationsACM SIGSAM Bulletin, 1981