This volume covers many topics, including number theory, Boolean functions, combinatorial geometry, and algorithms over finite fields. It contains many new, theoretical and applicable results, as well as surveys that were presented by the top specialists in these areas. New results include an answer to one of Serre's questions, posted in a letter to Top; cryptographic applications of the discrete logarithm problem related to elliptic curves and hyperelliptic curves; construction of function field towers; construction of new classes of Boolean cryptographic functions; and algorithmic applications of algebraic geometry.
Reihe
Sprache
Verlagsort
Zielgruppe
Für höhere Schule und Studium
Produkt-Hinweis
Maße
Höhe: 231 mm
Breite: 155 mm
Dicke: 30 mm
Gewicht
ISBN-13
978-981-279-342-3 (9789812793423)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Klassifikation
Herausgeber*in
Univ Of Mediterranee, France
Univ Of Sussex, Uk
Univ Of French Polynesia, France
On the Semiprimitivity of Cyclic Codes (Y Aubry & P Langevin); An Optimal Unramified Tower of Function Fields (K Brander); Galois Invariant Smoothness Basis (J-M Couveignes); Decoding of Scroll Codes (G Hitching & T Johnsen); Fuzzy Pairing-based CL-PKC (M Kiviharju); On Quadratic Extensions of Cyclic Projective Planes (H F Law & P Wong); On the Number of Boolean Resilient Functions (S Mesnager); Symmetric Cryptography and Algebraic Curves (F Voloch); Partitions of Vector Spaces over Finite Fields (Y Zelenyuk); and other papers.
