Cantitate/Preț
Produs

Arithmetic of Finite Fields: First International Workshop, WAIFI 2007, Madrid, Spain, June 21-22, 2007, Proceedings: Lecture Notes in Computer Science, cartea 4547

Editat de Claude Carlet, Berk Sunar
en Limba Engleză Paperback – 11 iun 2007

Din seria Lecture Notes in Computer Science

Preț: 38657 lei

Nou

Puncte Express: 580

Preț estimativ în valută:
7398 7685$ 6145£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540730736
ISBN-10: 3540730737
Pagini: 374
Ilustrații: XI, 360 p. With online files/update.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.57 kg
Ediția:2007
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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 ).