home
sign in
my orders
my e-books
my trolley
my account
contact
keyword
isbn13
author
title
| can't find it |
Tell us the title, author
and / or ISBN number
*
Any other details such as author,
ISBN, title or genre. Please be specific
What is your email address?
*
Not a valid email address
| browse books |
Textbooks
books
antiques & collectibles
architecture
art
biography & autobiography
body, mind & spirit
business & economics
comics & graphic novels
computers
cooking
crafts & hobbies
drama
education
family & relationships
fiction
foreign language study
games
gardening
health & fitness
history
house & home
humor
juvenile fiction
juvenile nonfiction
language arts & disciplines
law
literary collections
literary criticism
mathematics
medical
music
nature
non-classifiable
performing arts
pets
philosophy
photography
poetry
political science
psychology
reference
religion
science
self-help
social science
sports & recreation
study aids
technology
transportation
travel
true crime
books
| book details |
Number Theoretic Methods in Cryptography: Complexity lower bounds
By (author)
Igor Shparlinski
| on special |
normal price: R 2 267.95
Price: R 2 153.95
| add to trolley |
processing...
| book description |
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.
| product details |
Normally shipped |
Available from overseas. Usually dispatched in 14 days
Publisher |
Springer Basel
Published date |
8 Oct 2012
Language |
Format |
Paperback / softback
Pages |
182
Dimensions |
235 x 155 x 0mm (L x W x H)
Weight |
0g
ISBN |
978-3-0348-9723-5
Readership Age |
BISAC |
mathematics / number theory
| other options |
| back |
| your trolley |
To view the items in your trolley please sign in.
| sign in |
| specials |
Helgoland: The Strange and Beautiful Story of Quantum Physics
Carlo Rovelli
Paperback / softback
208 pages
was: R 295.95
now: R 265.95
Available from overseas. Usually dispatched in 3 to 6 weeks
| more |
| add to trolley |
processing...
The Coming Wave: AI, Power and Our Future
Mustafa Suleyman
Paperback / softback
352 pages
was: R 295.95
now: R 265.95
Stock is usually dispatched in 6-12 days from date of order
| more |
| add to trolley |
processing...
The Order of Time
Carlo Rovelli
Paperback / softback
224 pages
was: R 295.95
now: R 265.95
Available from overseas. Usually dispatched in 3 to 6 weeks
Originally published in Italian: L'ordine del tempo (Milan: Adelphi Edizioni, 2017).
| more |
| add to trolley |
processing...
Copyright 2025
|
terms and conditions