pickabook books with huge discounts for everyone
pickabook books with huge discounts for everyone
Visit our new collection website www.collectionsforschool.co.uk
     
Email: Subscribe to news & offers:
Need assistance? Log In/Register


Item Details
Title: NUMBER THEORETIC METHODS IN CRYPTOGRAPHY
COMPLEXITY LOWER BOUNDS
By: Igor Shparlinski
Format: Paperback

List price: £54.99


We currently do not stock this item, please contact the publisher directly for further information.

ISBN 10: 3034897235
ISBN 13: 9783034897235
Publisher: SPRINGER BASEL
Pub. date: 15 February, 1999
Edition: Softcover reprint of the original 1st ed. 1999
Series: Progress in Computer Science and Applied Logic 17
Pages: 182
Synopsis: 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.
Illustrations: 2 black & white illustrations
Publication: Switzerland
Imprint: Springer Basel
Returns: Returnable
Some other items by this author:

TOP SELLERS IN THIS CATEGORY
Fermat's Last Theorem (Paperback)
HarperCollins Publishers
Our Price : £8.02
more details
Euclid's Elements (Hardback)
Green Lion Press
Our Price : £25.55
more details
Algebraic Number Theory (Paperback)
London Mathematical Society
Our Price : £45.00
more details
An Introduction to the Theory of Numbers (Paperback)
Oxford University Press
Our Price : £49.00
more details
A First Course in Modular Forms (Hardback)
Springer-Verlag New York Inc.
Our Price : £47.24
more details
BROWSE FOR BOOKS IN RELATED CATEGORIES
 MATHEMATICS AND SCIENCE
 mathematics
 number theory


Information provided by www.pickabook.co.uk
SHOPPING BASKET
  
Your basket is empty
  Total Items: 0
 






Early Learning
Little Worried Caterpillar (PB) Little Green knows she''s about to make a big change - transformingfrom a caterpillar into a beautiful butterfly. Everyone is VERYexcited! But Little Green is VERY worried. What if being a butterflyisn''t as brilliant as everyone says?Join Little Green as she finds her own path ... with just a littlehelp from her friends.
add to basket

Early Learning
add to basket

Picture Book
All the Things We Carry PB What can you carry?A pebble? A teddy? A bright red balloon? A painting you''ve made?A hope or a dream?This gorgeous, reassuring picture book celebrates all the preciousthings we can carry, from toys and treasures to love and hope. With comforting rhymes and fabulous illustrations, this is a warmhug of a picture book.
add to basket