Computational and algorithmic problems in finite fields / Igor E. Shparlinski

• Autore: Shparlinski, Igor E.
• Pubblicazione: Dordrecht, : Kluwer, 1992
• Descrizione fisica: XII, 240 p. ; 25 cm
• Soggetto topico: 11-XX - Number theory [MSC 2020]; 94A60 - Cryptography [MSC 2020]; 11G20 - Curves over finite and local fields [MSC 2020]; 68Q25 - Analysis of algorithms and problem complexity [MSC 2020]; 11Y40 - Algebraic number theory computations [MSC 2020]; 11T71 Algebraic coding theory; cryptography [MSC 2020]; 11Txx - Finite fields and commutative rings (number-theoretic aspects) [MSC 2020]; 11T55 - Arithmetic theory of polynomial rings over finite fields [MSC 2020]; 11Y16 - Number-theoretic algorithms; complexity [MSC 2020]; 14G05 - Rational points [MSC 2020]; 11T06 - Polynomials over finite fields [MSC 2020]; 94B27 - Geometric methods (including applications of algebraic geometry) applied to coding theory [MSC 2020]
• Titolo autorizzato: Computational and algorithmic problems in finite fields
• ISBN: 978-07-923205-7-9
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Lingua di pubblicazione: Inglese
• Record Nr.: VAN0024455
• Lo trovi qui: Univ. Vanvitelli
• Localizzazioni e accesso elettronico: https://books.google.it/books?id=9MTrCAAAQBAJ&printsec=frontcover&hl=it#v=onepage&q&f=false
• Serie: Mathematics and its applications. Soviet series Dordrecht . -Reidel ; [poi] Kluwer ; 88