default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWAIFI 2010: Istanbul, Turkey
- M. Anwar Hasan, Tor Helleseth:
Arithmetic of Finite Fields, Third International Workshop, WAIFI 2010, Istanbul, Turkey, June 27-30, 2010. Proceedings. Lecture Notes in Computer Science 6087, Springer 2010, ISBN 978-3-642-13796-9
Invited Talk 1
- Henning Stichtenoth:
Recursive Towers of Function Fields over Finite Fields. 1-6
Efficient Finite Field Arithmetic
- Joppe W. Bos:
High-Performance Modular Multiplication on the Cell Processor. 7-24 - Reza Azarderakhsh, Arash Reyhani-Masoleh:
A Modified Low Complexity Digit-Level Gaussian Normal Basis Multiplier. 25-40 - Daniel J. Bernstein, Tanja Lange:
Type-II Optimal Polynomial Bases. 41-61
Pseudo-random Numbers and Sequences
- Alina Ostafe
:
Pseudorandom Vector Sequences Derived from Triangular Polynomial Systems with Constant Multipliers. 62-72 - Zhixiong Chen, Alina Ostafe, Arne Winterhof:
Structure of Pseudorandom Numbers Derived from Fermat Quotients. 73-85
Boolean Functions
- Stéphanie Dib:
Distribution of Boolean Functions According to the Second-Order Nonlinearity. 86-96 - Sihem Mesnager:
Hyper-bent Boolean Functions with Multiple Trace Terms. 97-113
Invited Talk 2
- Sanjit Chatterjee, Darrel Hankerson, Alfred Menezes:
On the Efficiency and Security of Pairing-Based Protocols in the Type 1 and Type 4 Settings. 114-134
Functions, Equations and Modular Multiplication
- Alexander Pott, Yue Zhou:
Switching Construction of Planar Functions on Finite Fields. 135-150 - Thorsten Ernst Schilling, Håvard Raddum:
Solving Equation Systems by Agreeing and Learning. 151-165 - Miroslav Knezevic, Frederik Vercauteren, Ingrid Verbauwhede:
Speeding Up Bipartite Modular Multiplication. 166-179
Finite Field Arithmetic for Pairing Based Cryptography
- Naomi Benger, Michael Scott:
Constructing Tower Extensions of Finite Fields for Implementation of Pairing-Based Cryptography. 180-195 - Craig Costello, Colin Boyd, Juan Manuel González Nieto, Kenneth Koon-Ho Wong:
Delaying Mismatched Field Multiplications in Pairing Computations. 196-214
Invited Talk 3
- Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar, Kannan Ramchandran:
Regenerating Codes for Distributed Storage Networks. 215-223
Finite Fields, Cryptography and Coding
- Roger Oyono, Christophe Ritzenthaler:
On Rationality of the Intersection Points of a Line with a Plane Quartic. 224-237 - Ulrich Tamm:
Reflections about a Single Checksum. 238-249 - Mohamed N. Hassan, Mohammed Benaissa:
Efficient Time-Area Scalable ECC Processor Using µ-Coding Technique. 250-268
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-24 21:37 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
