Arithmetic of Finite Fields
Springer Berlin (Verlag)
978-3-540-73073-6 (ISBN)
Structures in Finite Fields.- Explicit Factorizations of Cyclotomic and Dickson Polynomials over Finite Fields.- Some Notes on d-Form Functions with Difference-Balanced Property.- A Note on Modular Forms on Finite Upper Half Planes.- Efficient Implementation and Architectures.- A Coprocessor for the Final Exponentiation of the ? T Pairing in Characteristic Three.- VLSI Implementation of a Functional Unit to Accelerate ECC and AES on 32-Bit Processors.- Efficient Multiplication Using Type 2 Optimal Normal Bases.- Efficient Finite Field Arithmetic.- Effects of Optimizations for Software Implementations of Small Binary Field Arithmetic.- Software Implementation of Arithmetic in .- Complexity Reduction of Constant Matrix Computations over the Binary Field.- Towards Optimal Toom-Cook Multiplication for Univariate and Multivariate Polynomials in Characteristic 2 and 0.- Classification and Construction of Mappings over Finite Fields.- A Construction of Differentially 4-Uniform Functions from Commutative Semifields of Characteristic 2.- Complete Mapping Polynomials over Finite Field F 16.- On the Classification of 4 Bit S-Boxes.- The Simplest Method for Constructing APN Polynomials EA-Inequivalent to Power Functions.- Curve Algebra.- New Point Addition Formulae for ECC Applications.- Explicit Formulas for Real Hyperelliptic Curves of Genus 2 in Affine Representation.- The Quadratic Extension Extractor for (Hyper)Elliptic Curves in Odd Characteristic.- Cryptography.- On Kabatianskii-Krouk-Smeets Signatures.- Self-certified Signatures Based on Discrete Logarithms.- Attacking the Filter Generator over GF(2 m ).- Codes.- Cyclic Additive and Quantum Stabilizer Codes.- Determining the Number of One-Weight Cyclic Codes When Length and Dimension Are Given.- Error CorrectingCodes from Quasi-Hadamard Matrices.- Fast Computations of Gröbner Bases and Blind Recognitions of Convolutional Codes.- Discrete Structures.- A Twin for Euler's ? Function in .- Discrete Phase-Space Structures and Mutually Unbiased Bases.- Some Novel Results of p-Adic Component of Primitive Sequences over Z/(p d ).
Erscheint lt. Verlag | 11.6.2007 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
Zusatzinfo | XI, 360 p. With online files/update. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 569 g |
Themenwelt | Informatik ► Theorie / Studium ► Kryptologie |
Schlagworte | Algebraic Codes • algebraic computation • Algebraic Geometry • Algebraic Number Fields • Algorithm analysis and problem complexity • Algorithmic Number Theory • binary polynomials • Complexity • Computational Algebra • Computational Number Theory • Computer Algebra • Cryptographic Codes • cryptography • curve-based crypto • curve-based cryptography • Elliptic Curve Computations • error-correcting code • Error-correcting codes • Factoring • finite field • Finite Field Computations • Galois groups • Gröbner Bases • Modular Forms • number-theoretic algorithms • Optimization • self-certified PK signature • sequences • SIGNATUR |
ISBN-10 | 3-540-73073-7 / 3540730737 |
ISBN-13 | 978-3-540-73073-6 / 9783540730736 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich