This volume covers many topics including number theory, Boolean functions, combinatorial geometry, and algorithms over finite fields. This book contains many interesting theoretical and applicated new results and surveys presented by the best specialists in these areas, such as new results on Serre's questions, answering a question in his letter to Top; new results on cryptographic applications of the discrete logarithm problem related to elliptic curves and hyperellyptic curves, including computation of the discrete logarithm; new results on function field towers; the construction of new classes of Boolean cryptographic functions; and algorithmic applications of algebraic geometry.
FREE Two-Day Shipping for Students. Learn more |
Book Description
Special Offers and Product Promotions
- Buy $50 in qualifying physical textbooks, get $5 in Amazon MP3 Credit. Here's how (restrictions apply)
Product Details
Would you like to update product info or give feedback on images?
|
Customer Reviews
|
There are no customer reviews yet.
|
|||
|
Video reviews
|
Inside This Book
(learn more)
Key Phrases - Statistically Improbable Phrases (SIPs):
(learn more)
trace zero varieties, discrete logarithms, pseudorandom points, pole cancellation algorithm, computing endomorphism rings, degré binaire, group law algorithms, superelliptic cubics, rational flex, decoding using syndromes, cyclic projective planes, vector bundle extensions, unramified tower, numerical normal form, last nonzero coordinate, smoothness basis, abelian threefolds, des fonctions booléennes, bilinear complexity, cyclic difference set, typical divisor, cyclic collineation, irreducible cyclic codes, foliation structure, smooth plane quartic Key Phrases - Capitalized Phrases (CAPs): (learn more)
Lecture Notes, Brauer Groups, New York, Jacobian Group Law Algorithms, Computer Science, Fuzzy Pairings-Based, France E-mail, Information Theory, Call Expand, London Math, Journal of Cryptology, Springer Verlag, Partitions of Vector Spaces, Chinese Remainder Theorem, Cambridge University Press, Run Algorithm, Fast Jacobian, Fourier Coefficients, Main Theorem, Picard Explicit, Jean-Pierre Serre, Coding Theory, Jaap Top, University Essen, Ritzenthaler Table Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Surprise Me!
trace zero varieties, discrete logarithms, pseudorandom points, pole cancellation algorithm, computing endomorphism rings, degré binaire, group law algorithms, superelliptic cubics, rational flex, decoding using syndromes, cyclic projective planes, vector bundle extensions, unramified tower, numerical normal form, last nonzero coordinate, smoothness basis, abelian threefolds, des fonctions booléennes, bilinear complexity, cyclic difference set, typical divisor, cyclic collineation, irreducible cyclic codes, foliation structure, smooth plane quartic Key Phrases - Capitalized Phrases (CAPs): (learn more)
Lecture Notes, Brauer Groups, New York, Jacobian Group Law Algorithms, Computer Science, Fuzzy Pairings-Based, France E-mail, Information Theory, Call Expand, London Math, Journal of Cryptology, Springer Verlag, Partitions of Vector Spaces, Chinese Remainder Theorem, Cambridge University Press, Run Algorithm, Fast Jacobian, Fourier Coefficients, Main Theorem, Picard Explicit, Jean-Pierre Serre, Coding Theory, Jaap Top, University Essen, Ritzenthaler Table Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Surprise Me!
Tag this product(What's this?)Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items. |
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
