Muutke küpsiste eelistusi

Arithmetic of Finite Fields: Third International Workshop, WAIFI 2010, Istanbul, Turkey, June 27-30, 2010, Proceedings 2010 ed. [Pehme köide]

Edited by , Edited by
  • Formaat: Paperback / softback, 280 pages, kaal: 428 g, 41 Illustrations, black and white; 280 p. 41 illus., 1 Paperback / softback
  • Sari: Theoretical Computer Science and General Issues 6087
  • Ilmumisaeg: 17-Jun-2010
  • Kirjastus: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3642137962
  • ISBN-13: 9783642137969
  • Pehme köide
  • Hind: 48,70 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 57,29 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
  • Formaat: Paperback / softback, 280 pages, kaal: 428 g, 41 Illustrations, black and white; 280 p. 41 illus., 1 Paperback / softback
  • Sari: Theoretical Computer Science and General Issues 6087
  • Ilmumisaeg: 17-Jun-2010
  • Kirjastus: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3642137962
  • ISBN-13: 9783642137969
These are the proceedings of WAIFI 2010,the Third International Workshop on theArithmeticofFiniteFields,heldinIstanbul,Turkey,duringJune27-30,2010. The ?rst workshop, WAIFI 2007, was held in Madrid, Spain, and then WAIFI 2008 was held in Siena, Italy. In 2008, the workshop series was made biannual and it is now being held every even year, bringing together mathematicians, computer scientists, engineers and physicists who are doing research on various aspects of ?nite ?eld arithmetic. This year the workshop received 33 submissions, each of which was reviewed by at least three reviewerswho were either members of the ProgramCommittee of the workshop or external reviewers chosen by the members. Once the review phase was over, the Program Committee had online discussions over a period of several days. In the end, a total of 15 papers representing both theoretical and practical aspects of ?nite ?eld arithmetic were accepted for presentation. These accepted papers are part of these proceedings. In addition to the presentations of these papers, we were fortunate to have three invited talks given by P. Vijay Kumar,Alfred Menezes andHenning Stichtenoth. Thepapers,whichthe invited talks were based on, are also part of the proceedings. We are very grateful to the members of the Program Committee for their dedication, professionalism and careful work with the review and selection p- cess. We also sincerely thank the external reviewers who contributed with their special expertise to review papers for this workshop.
Invited Talk 1
Recursive Towers of Function Fields over Finite Fields
1(6)
Henning Stichtenoth
Efficient Finite Field Arithmetic
High-Performance Modular Multiplication on the Cell Processor
7(18)
Joppe W. Bos
A Modified Low Complexity Digit-Level Gaussian Normal Basis Multiplier
25(16)
Reza Azarderakhsh
Arash Reyhani-Masoleh
Type-II Optimal Polynomial Bases
41(21)
Daniel J. Bernstein
Tanja Lange
Pseudo-random Numbers and Sequences
Pseudorandom Vector Sequences Derived from Triangular Polynomial Systems with Constant Multipliers
62(11)
Alina Ostafe
Structure of Pseudorandom Numbers Derived from Fermat Quotients
73(13)
Zhixiong Chen
Alina Ostafe
Arne Winterhof
Boolean Functions
Distribution of Boolean Functions According to the Second-Order Nonlinearity
86(11)
Stephanie Dib
Hyper-bent Boolean Functions with Multiple Trace Terms
97(17)
Sihem Mesnager
Invited Talk 2
On the Efficiency and Security of Pairing-Based Protocols in the Type 1 and Type 4 Settings
114(21)
Sanjit Chatterjee
Darrel Hankerson
Alfred Menezes
Functions, Equations and Modular Multiplication
Switching Construction of Planar Functions on Finite Fields
135(16)
Alexander Pott
Yue Zhou
Solving Equation Systems by Agreeing and Learning
151(15)
Thorsten Ernst Schilling
Havard Raddum
Speeding Up Bipartite Modular Multiplication
166(14)
Miroslav Knezevic
Frederik Vercauteren
Ingrid Verbauwhede
Finite Field Arithmetic for Pairing Based Cryptography
Constructing Tower Extensions of Finite Fields for Implementation of Pairing-Based Cryptography
180(16)
Naomi Benger
Michael Scott
Delaying Mismatched Field Multiplications in Pairing Computations
196(19)
Craig Costello
Colin Boyd
Juan Manuel Gonzalez Nieto
Kenneth Koon-Ho Wong
Invited Talk 3
Regenerating Codes for Distributed Storage Networks
215(9)
Nihar B. Shah
K.V. Rashmi
P. Vijay Kumar
Kannan Ramchandran
Finite Fields, Cryptography and Coding
On Rationality of the Intersection Points of a Line with a Plane Quartic
224(14)
Roger Oyono
Christophe Ritzenthaler
Reflections about a Single Checksum
238(12)
Ulrich Tamm
Efficient Time-Area Scalable ECC Processor Using μ-Coding Technique
250(19)
Mohamed N. Hassan
Mohammed Benaissa
Author Index 269