Abstract is missing.
- Interpolation of the Double Discrete LogarithmGerasimos C. Meletiou, Arne Winterhof. 1-10 [doi]
- Finite Dedekind SumsYoshinori Hamahata. 11-18 [doi]
- Transitive q-Ary Functions over Finite Fields or Finite Sets: Counts, Properties and ApplicationsMarc Mouffron. 19-35 [doi]
- Fast Point Multiplication on Elliptic Curves without PrecomputationMarc Joye. 36-46 [doi]
- Optimal Extension Field Inversion in the Frequency DomainSelçuk Baktir, Berk Sunar. 47-61 [doi]
- Efficient Finite Fields in the Maxima Computer Algebra SystemFabrizio Caruso, Jacopo D Aurizio, Alasdair McAndrew. 62-76 [doi]
- Modular Reduction in GF(2:::n:::) without Pre-computational PhaseM. Knezevic, Kazuo Sakiyama, Junfeng Fan, Ingrid Verbauwhede. 77-87 [doi]
- Subquadratic Space Complexity Multiplication over Binary Fields with Dickson Polynomial RepresentationM. Anwar Hasan, Christophe Negre. 88-102 [doi]
- Digit-Serial Structures for the Shifted Polynomial Basis Multiplication over Binary Extension FieldsArash Hariri, Arash Reyhani-Masoleh. 103-116 [doi]
- Some Theorems on Planar MappingsGohar M. M. Kyureghyan, Alexander Pott. 117-122 [doi]
- Classifying 8-Bit to 8-Bit S-Boxes Based on Power Mappings from the Point of DDT and LAT DistributionsBora Aslan, M. Tolga Sakalli, Ercan Bulus. 123-133 [doi]
- EA and CCZ Equivalence of Functions over GF(2:::n:::)K. J. Horadam. 134-143 [doi]
- On the Number of Two-Weight Cyclic Codes with Composite Parity-Check PolynomialsGerardo Vega. 144-156 [doi]
- On Field Size and Success Probability in Network CodingOlav Geil, Ryutaroh Matsumoto, Casper Thomsen. 157-173 [doi]
- Montgomery Ladder for All Genus 2 Curves in Characteristic 2Sylvain Duquesne. 174-188 [doi]
- On Cryptographically Significant Mappings over GF(2:::n:::)Enes Pasalic. 189-204 [doi]