Arithmetic of Finite Fields
Springer Berlin (Verlag)
9783642137969 (ISBN)
Invited Talk 1.- Recursive Towers of Function Fields over Finite Fields.- Efficient Finite Field Arithmetic.- High-Performance Modular Multiplication on the Cell Processor.- A Modified Low Complexity Digit-Level Gaussian Normal Basis Multiplier.- Type-II Optimal Polynomial Bases.- Pseudo-random Numbers and Sequences.- Pseudorandom Vector Sequences Derived from Triangular Polynomial Systems with Constant Multipliers.- Structure of Pseudorandom Numbers Derived from Fermat Quotients.- Boolean Functions.- Distribution of Boolean Functions According to the Second-Order Nonlinearity.- Hyper-bent Boolean Functions with Multiple Trace Terms.- Invited Talk 2.- On the Efficiency and Security of Pairing-Based Protocols in the Type 1 and Type 4 Settings.- Functions, Equations and Modular Multiplication.- Switching Construction of Planar Functions on Finite Fields.- Solving Equation Systems by Agreeing and Learning.- Speeding Up Bipartite Modular Multiplication.- Finite Field Arithmetic for Pairing Based Cryptography.- Constructing Tower Extensions of Finite Fields for Implementation of Pairing-Based Cryptography.- Delaying Mismatched Field Multiplications in Pairing Computations.- Invited Talk 3.- Regenerating Codes for Distributed Storage Networks.- Finite Fields, Cryptography and Coding.- On Rationality of the Intersection Points of a Line with a Plane Quartic.- Reflections about a Single Checksum.- Efficient Time-Area Scalable ECC Processor Using ?-Coding Technique.
| Erscheint lt. Verlag | 17.6.2010 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
| Zusatzinfo | 280 p. 41 illus. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Themenwelt | Mathematik / Informatik ► Informatik |
| Schlagworte | algebraic computation • Algebraic Geometry • algebraic number theory • Algorithm analysis and problem complexity • Algorithmic Number Theory • binary polynomials • Boolean functions • cell processor • classification • Complexity • Computational Algebra • Computational Number Theory • Computer Algebra • Cryptographic Codes • cryptography • curve-based cryptography • cyclic codes • discrete Fourier transform • distributed networking • ECC • Elliptic Curves • Factoring • Finite Fields • Galois field • Gröbner Bases • hyperelliptic curves • interpolation polynomials • lattices • Modular Multiplication • number-theoretic algorithms • number theoretic transform • pseudo random numbers • Public-Key Cryptography • random network coding • sequences • Switch • Symmetric functions |
| ISBN-13 | 9783642137969 / 9783642137969 |
| Zustand | Neuware |
| Informationen gemäß Produktsicherheitsverordnung (GPSR) | |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich