你好! Shipping to Taiwan with premium packaging for just NT$300 

Ship to
Taiwan
0

My Account

  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional

menu

Select your country

Americas

Europe

Rest of the world

portada Number Theoretic Methods in Cryptography: Complexity Lower Bounds
Type
Physical Book
Author
Publisher
Language
English
Pages
182
Format
Paperback
Dimensions
23.4x15.6x1.1 cm
Weight
0.29 kg.
ISBN13
9783034897235
Categories

Number Theoretic Methods in Cryptography: Complexity Lower Bounds

Igor Shparlinski (Author) · Birkhauser · Paperback

Number Theoretic Methods in Cryptography: Complexity Lower Bounds - Shparlinski, Igor

Cheaper New Book Imported to Taiwan
Delivery: 16 Oct - 29 Oct Shipping: 13 to 17 business days.
NT$ 1,860
Faster New Book Imported to Taiwan
Delivery: 07 Oct - 15 Oct Shipping: 6 to 7 business days.
NT$ 2,372
NT$ 1,860

Choose the list to add your product or create one New List

Go to My Wishlists
Calculate shipping cost

Synopsis "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. It also contains a number of open problems and proposals for further research. We obtain several lower bounds, exponential in terms of logp, on the de- grees and orders of - polynomials; - algebraic functions; - Boolean functions; - linear recurring sequences; coinciding with values of the discrete logarithm modulo a prime p at suf- ficiently many points (the number of points can be as small as pI/He). These functions are considered over the residue ring modulo p and over the residue ring modulo an arbitrary divisor d of p - 1. The case of d = 2 is of special interest since it corresponds to the representation of the right- most bit of the discrete logarithm and defines whether the argument is a quadratic residue. We also obtain non-trivial upper bounds on the de- gree, sensitivity and Fourier coefficients of Boolean functions on bits of x deciding whether x is a quadratic residue. These results are used to obtain lower bounds on the parallel arithmetic and Boolean complexity of computing the discrete logarithm. For example, we prove that any unbounded fan-in Boolean circuit. of sublogarithmic depth computing the discrete logarithm modulo p must be of superpolynomial size.

Customers reviews

More customer reviews
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)

Frequently Asked Questions about the Book

Is the book original?

All books in our catalog are Original.

In what language is the book written?

The book is written in English.

What is the format of this book?

The binding of this edition is Paperback.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews