Custom cover image
Custom cover image

Arithmetic of Finite Fields : Third International Workshop, WAIFI 2010, Istanbul, Turkey, June 27-30, 2010. Proceedings / edited by M. Anwar Hasan, Tor Helleseth

By: Contributor(s): Resource type: Ressourcentyp: Buch (Online)Book (Online)Language: English Series: SpringerLink Bücher | Lecture notes in computer science ; 6087Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010Description: Online-Ressource (280p. 41 illus, digital)ISBN:
  • 9783642137976
  • 1280387386
Subject(s): Genre/Form: Additional physical formats: 9783642137969 | Buchausg. u.d.T.: Arithmetic of finite fields. Berlin : Springer, 2010. X, 268 S.DDC classification:
  • 005.131
  • 005.11 23
  • 004
  • 510
MSC: MSC: *11-06 | 11Txx | 00B25LOC classification:
  • QA76.9.M35
  • QA247.3
DOI: DOI: 10.1007/978-3-642-13797-6Online resources: Summary: 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.PPN: PPN: 1649787723Package identifier: Produktsigel: ZDB-2-LNC | ZDB-2-SCS | ZDB-2-SXCS | ZDB-2-SEB
No physical items for this record
KIT – The University in the Helmholtz Association                         Home | Impressum | Datenschutz | Barrierefreiheit | KIT