Number Theoretic Methods in Cryptography: Complexity lower bounds

Author:   Igor Shparlinski
Publisher:   Birkhauser Verlag AG
Edition:   1999 ed.
Volume:   17
ISBN:  

9783764358884


Pages:   182
Publication Date:   15 February 1999
Format:   Hardback
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Our Price $340.56 Quantity:  
Add to Cart

Share |

Number Theoretic Methods in Cryptography: Complexity lower bounds


Add your own review!

Overview

Full Product Details

Author:   Igor Shparlinski
Publisher:   Birkhauser Verlag AG
Imprint:   Birkhauser Verlag AG
Edition:   1999 ed.
Volume:   17
Dimensions:   Width: 15.50cm , Height: 1.20cm , Length: 23.50cm
Weight:   1.000kg
ISBN:  

9783764358884


ISBN 10:   3764358882
Pages:   182
Publication Date:   15 February 1999
Audience:   College/higher education ,  Professional and scholarly ,  Undergraduate ,  Postgraduate, Research & Scholarly
Format:   Hardback
Publisher's Status:   Active
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Table of Contents

I Preliminaries.- 1 Introduction.- 2 Basic Notation and Definitions.- 3 Auxiliary Results.- II Approximation and Complexity of the Discrete Logarithm.- 4 Approximation of the Discrete Logarithm Modulo p.- 5 Approximation of the Discrete Logarithm Modulo p — 1.- 6 Approximation of the Discrete Logarithm by Boolean Functions.- 7 Approximation of the Discrete Logarithm by Real and Complex Polynomials.- III Complexity of Breaking the Diffie-Hellman Cryptosystem.- 8 Polynomial Approximation and Arithmetic Complexity of the Diffie-Hellman Key.- 9 Boolean Complexity of the Diffie-Hellman Key.- IV Other Applications.- 10 Trade-off between the Boolean and Arithmetic Depths of Modulo p Functions.- 11 Special Polynomials and Boolean Functions.- 12 RSA and Blum-Blum-Shub Generators of Pseudo-Random Numbers.- V Concluding Remarks.- 13 Generalizations and Open Questions.- 14 Further Directions.

Reviews

This volume gives a thorough treatment of the complexity of the discrete logarithm problem in a prime field, as well as related problems. The final chapter on further directions gives an interesting selection of problems. --Zentralblatt Math


This volume gives a thorough treatment of the complexity of the discrete logarithm problem in a prime field, as well as related problems. The final chapter on further directions gives an interesting selection of problems. <p>--Zentralblatt Math


Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List