Abstract is missing.
- Recursive Towers of Function Fields over Finite FieldsHenning Stichtenoth. 1-6 [doi]
- High-Performance Modular Multiplication on the Cell ProcessorJoppe W. Bos. 7-24 [doi]
- A Modified Low Complexity Digit-Level Gaussian Normal Basis MultiplierReza Azarderakhsh, Arash Reyhani-Masoleh. 25-40 [doi]
- Type-II Optimal Polynomial BasesDaniel J. Bernstein, Tanja Lange. 41-61 [doi]
- Pseudorandom Vector Sequences Derived from Triangular Polynomial Systems with Constant MultipliersAlina Ostafe. 62-72 [doi]
- Structure of Pseudorandom Numbers Derived from Fermat QuotientsZhixiong Chen, Alina Ostafe, Arne Winterhof. 73-85 [doi]
- Distribution of Boolean Functions According to the Second-Order NonlinearityStéphanie Dib. 86-96 [doi]
- Hyper-bent Boolean Functions with Multiple Trace TermsSihem Mesnager. 97-113 [doi]
- On the Efficiency and Security of Pairing-Based Protocols in the Type 1 and Type 4 SettingsSanjit Chatterjee, Darrel Hankerson, Alfred Menezes. 114-134 [doi]
- Switching Construction of Planar Functions on Finite FieldsAlexander Pott, Yue Zhou. 135-150 [doi]
- Solving Equation Systems by Agreeing and LearningThorsten Ernst Schilling, Håvard Raddum. 151-165 [doi]
- Speeding Up Bipartite Modular MultiplicationMiroslav Knezevic, Frederik Vercauteren, Ingrid Verbauwhede. 166-179 [doi]
- Constructing Tower Extensions of Finite Fields for Implementation of Pairing-Based CryptographyNaomi Benger, Michael Scott. 180-195 [doi]
- Delaying Mismatched Field Multiplications in Pairing ComputationsCraig Costello, Colin Boyd, Juan Manuel González Nieto, Kenneth Koon-Ho Wong. 196-214 [doi]
- Regenerating Codes for Distributed Storage NetworksNihar B. Shah, K. V. Rashmi, P. Vijay Kumar, Kannan Ramchandran. 215-223 [doi]
- On Rationality of the Intersection Points of a Line with a Plane QuarticRoger Oyono, Christophe Ritzenthaler. 224-237 [doi]
- Reflections about a Single ChecksumUlrich Tamm. 238-249 [doi]
- Efficient Time-Area Scalable ECC Processor Using ::::µ::::-Coding TechniqueMohamed N. Hassan, Mohammed Benaissa. 250-268 [doi]