Inicio > > Ciencias de la computación > Computational and Algorithmic Problems in Finite Fields
Computational and Algorithmic Problems in Finite Fields

Computational and Algorithmic Problems in Finite Fields

Igor Shparlinski

131,51 €
IVA incluido
Consulta disponibilidad
Editorial:
Springer Nature B.V.
Año de edición:
1992
Materia
Ciencias de la computación
ISBN:
9780792320579

Selecciona una librería:

  • Librería Samer Atenea
  • Librería Aciertas (Toledo)
  • Kálamo Books
  • Librería Perelló (Valencia)
  • Librería Elías (Asturias)
  • Donde los libros
  • Librería Kolima (Madrid)
  • Librería Proteo (Málaga)
¡Pregúntanos!
Sobre IBD

Series Editor’s Preface. Preface. Notations. Introduction. 1. Polynomial Factorization. 2. Finding Irreducible and Primitive Polynomials. 3. The Distribution of Irreducible and Primitive Polynomials. 4. Bases and Computation in Finite Fields. 5. Coding Theory and Algebraic Curves. 6. Elliptic Curves. 7. Recurrent Sequences in Finite Fields and Linear Cyclic Codes. 8. Finite Fields and Discreate Mathematics. 9. Congruences. 10. Some Related Problems. Appendix 1. Appendix 2. Appendix 3. Addendum. References. Index.

Artículos relacionados

Otros libros del autor

  • Cryptographic Applications of Analytic Number Theory
    Igor Shparlinski
    The book introduces new techniques that imply rigorous lower bounds on the com­ plexity of some number-theoretic and cryptographic problems. It also establishes certain attractive pseudorandom properties of various cryptographic primitives. These methods and techniques are based on bounds of character sums and num­ bers of solutions of some polynomial...
    Disponible

    133,28 €

  • Computational and Algorithmic Problems in Finite Fields
    Igor Shparlinski
    ’Et moi, ...• si j’avait su comment en revenir. je One service mathematics bas rendemI !be n’y semis point a1J6.’ human race. It bas put common sense back JulesVeme where it belongs. on tile topmost sbelf next to tile dusty canister labelled ’discarded nonsense’. The series is divergent; therefore we may be Eric T.BeIl able to do something with il O. ...
    Disponible

    66,45 €

  • Number Theoretic Methods in Cryptography
    Igor Shparlinski
    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 proposa...
    Disponible

    66,74 €

  • Finite Fields
    Igor Shparlinski
    This book is mainly devoted to some computational and algorithmic problems in finite fields such as, for example, polynomial factorization, finding irreducible and primitive polynomials, the distribution of these primitive polynomials and of primitive points on elliptic curves, constructing bases of various types and new applications of finite fields ...
    Disponible

    267,98 €

  • Cryptographic Applications of Analytic Number Theory
    Igor Shparlinski
    The book introduces new techniques that imply rigorous lower bounds on the com­ plexity of some number-theoretic and cryptographic problems. It also establishes certain attractive pseudorandom properties of various cryptographic primitives. These methods and techniques are based on bounds of character sums and num­ bers of solutions of some polynomial...
  • Finite Fields
    Igor Shparlinski
    This book is mainly devoted to some computational and algorithmic problems in finite fields such as, for example, polynomial factorization, finding irreducible and primitive polynomials, the distribution of these primitive polynomials and of primitive points on elliptic curves, constructing bases of various types and new applications of finite fields ...