Number theoretic methods in cryptography : complexity lower bounds /
The book introduces new techniques which imply rigorous lower bounds on the complexity of some number theoretic and cryptographic problems. These methods and techniques are based on bounds of character sums and numbers of solutions of some polynomial equations over finite fields and residue rings. I...
| Main Author: | |
|---|---|
| Corporate Author: | |
| Format: | eBook |
| Language: | English |
| Published: |
Basel ; Boston :
Birkhäuser,
[1999]
|
| Series: | Progress in computer science and applied logic ;
v. 17. |
| Subjects: | |
| Online Access: | Connect to the full text of this electronic book |
| Summary: | The book introduces new techniques which imply rigorous lower bounds on the complexity of some number theoretic and cryptographic problems. These methods and techniques are based on bounds of character sums and numbers of solutions of some polynomial equations over finite fields and residue rings. It also contains a number of open problems and proposals for further research. |
|---|---|
| Item Description: | Electronic resource. |
| Physical Description: | 1 online resource (viii, 180 pages) |
| Format: | Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. |
| Bibliography: | Includes bibliographical references (pages [165]-177) and index. |
| ISBN: | 9783034886642 (electronic bk.) 3034886640 (electronic bk.) |