Finite Fields: Theory and Computation: The Meeting Point of Number Theory, Computer Science, Coding Theory and Cryptography

Author:   Igor Shparlinski
Publisher:   Kluwer Academic Publishers
Edition:   1999 ed.
Volume:   477
ISBN:  

9780792356622


Pages:   528
Publication Date:   31 May 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 |

Finite Fields: Theory and Computation: The Meeting Point of Number Theory, Computer Science, Coding Theory and Cryptography


Overview

This is a survey of achievements in the theory and applications of finite fields and in many related areas such as algebraic number theory, theoretical computer science, coding theory and cryptography. Topics treated include polynomial factorization over finite fields, the finding and distribution of irreducible primitive and other special polynomials, constructing special bases of extensions of finite fields, curves and exponential sums, and linear recurrent sequences. Besides a general overview of the area, its results and methods, it suggests a number of interesting research problems of various levels of difficulty.

Full Product Details

Author:   Igor Shparlinski
Publisher:   Kluwer Academic Publishers
Imprint:   Kluwer Academic Publishers
Edition:   1999 ed.
Volume:   477
Dimensions:   Width: 15.60cm , Height: 3.00cm , Length: 23.40cm
Weight:   2.060kg
ISBN:  

9780792356622


ISBN 10:   0792356624
Pages:   528
Publication Date:   31 May 1999
Audience:   College/higher education ,  Professional and scholarly ,  Postgraduate, Research & Scholarly ,  Professional & Vocational
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

Reviews

'...the book can yet be highly recommended as encyclopaedia on these topics, in particular because many Russian papers are incorporated which are hardly accessible.' Monatschafte fur Mathematik, 132:1 (2001)


'...the book can yet be highly recommended as encyclopaedia on these topics, in particular because many Russian papers are incorporated which are hardly accessible.' Monatschafte fur Mathematik, 132:1 (2001)


'...the book can yet be highly recommended as encyclopaedia on these topics, in particular because many Russian papers are incorporated which are hardly accessible.' Monatschafte fur Mathematik, 132:1 (2001)


Author Information

Tab Content 6

Author Website:  

Countries Available

All regions
Latest Reading Guide

NOV RG 20252

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List