Research Article
Lattice Based Tools for Cryptanalysis in Various Applications
420 downloads
@INPROCEEDINGS{10.1007/978-3-642-27299-8_55, author={R. Santosh Kumar and C. Narasimham and S. Pallam Setty}, title={Lattice Based Tools for Cryptanalysis in Various Applications}, proceedings={Advances in Computer Science and Information Technology. Networks and Communications. Second International Conference, CCSIT 2012, Bangalore, India, January 2-4, 2012. Proceedings, Part I}, proceedings_a={CCSIT PART I}, year={2012}, month={11}, keywords={attices Lattice Reduction RSA Coppersmith Subset Sum Simultaneous Diophantine Merkle-Hellman}, doi={10.1007/978-3-642-27299-8_55} }- R. Santosh Kumar
C. Narasimham
S. Pallam Setty
Year: 2012
Lattice Based Tools for Cryptanalysis in Various Applications
CCSIT PART I
Springer
DOI: 10.1007/978-3-642-27299-8_55
Abstract
Lattice reduction is a powerful concept for solving diverse problems involving point lattices. Lattice reduction has been successfully utilizing in Number Theory, Linear algebra and Cryptology. Not only the existence of lattice based cryptosystems of hard in nature, but also has vulnerabilities by lattice reduction techniques. In this survey paper, we are focusing on point lattices and then describing an introduction to the theoretical and practical aspects of lattice reduction. Finally, we describe the applications of lattice reduction in cryptanalysis like subset sum problem of low density, modular equations, Attacking RSA with small e by knowing parts of the message and Diophantine Approximation using LLL algorithm.
Copyright © 2012–2024 ICST
