Abstract
It is well known that lattices provide a very powerful technique for cryptology, see [421, 422] for very detailed surveys of most important achievements in both cryptanalysis and design of new cryptosystems. However traditionally only heuristic results have obtained with their help. Here we outline some tools which, combined with other number-theoretic techniques, allow us to give rigorous proofs to some of these results, see also a brief survey in [525].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Basel AG
About this chapter
Cite this chapter
Shparlinski, I. (2003). Lattices and the Hidden Number Problem. In: Shparlinski, I. (eds) Cryptographic Applications of Analytic Number Theory. Progress in Computer Science and Applied Logic, vol 22. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-8037-4_7
Download citation
DOI: https://doi.org/10.1007/978-3-0348-8037-4_7
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-0348-9415-9
Online ISBN: 978-3-0348-8037-4
eBook Packages: Springer Book Archive