Exponential Sums and Lattice Reduction: Applications to Cryptography

Igor E. Shparlinski ()
Additional contact information
Igor E. Shparlinski: Macquarie University, Department of Computing

A chapter in Finite Fields with Applications to Coding Theory, Cryptography and Related Areas, 2002, pp 286-298 from Springer

Abstract: Abstract We describe a rather surprising, yet powerful, combination of two famous number theoretic techniques: bounds of exponential sums and lattice reduction algorithms. This combination has led to a number of cryptographic applications, helping to make rigorous several heuristic approaches and provides a two edge sword to defend and attack. It can be used prove important security results and also to create powerful attacks. The examples of the first group include results about the bit security of the Diffie-Hellman key exchange system, of the Shamir message passing scheme and of the XTR and LUC cryptosystems. The examples of the second group include attacks on the Digital Signature Scheme and its modifications which are provably insecure under certain conditions.

Keywords: Hash Function; Elliptic Curve; Signature Scheme; Polynomial Time Algorithm; Primitive Root (search for similar items in EconPapers)
Date: 2002
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-59435-9_23

Ordering information: This item can be ordered from
http://www.springer.com/9783642594359

DOI: 10.1007/978-3-642-59435-9_23

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().