Abstract is missing.
- Subspace CodesAzadeh Khaleghi, Danilo Silva, Frank R. Kschischang. 1-21 [doi]
- On Linear Programming Decoding on a Quantized Additive White Gaussian Noise ChannelEirik Rosnes. 22-37 [doi]
- Codes as Modules over Skew Polynomial RingsDelphine Boucher, Felix Ulmer. 38-55 [doi]
- On Higher Weights and Code ExistenceHans Georg Schaathun. 56-64 [doi]
- Mass Formula for Even Codes overKoichi Betsumiya, Rowena Alma L. Betty, Akihiro Munemasa. 65-77 [doi]
- On the Classification of Self-dual -CodesMasaaki Harada, Akihiro Munemasa. 78-90 [doi]
- On Linear Codes from Maximal CurvesStefania Fanali. 91-111 [doi]
- On Linear Cryptanalysis with Many Linear ApproximationsBenoît Gérard, Jean-Pierre Tillich. 112-132 [doi]
- Bivium as a Mixed-Integer Linear Programming ProblemJulia Borghoff, Lars R. Knudsen, Mathias Stolpe. 133-152 [doi]
- Security of Cyclic Double Block Length Hash FunctionsEwan Fleischmann, Michael Gorski, Stefan Lucks. 153-175 [doi]
- Another Glance at Double-Length HashingOnur Özen, Martijn Stam. 176-201 [doi]
- Geometric Ideas for Cryptographic Equation Solving in Even CharacteristicSean Murphy, Maura B. Paterson. 202-221 [doi]
- Provably Secure Code-Based Threshold Ring SignaturesLéonard Dallot, Damien Vergnaud. 222-235 [doi]
- A New Protocol for the Nearby Friend ProblemSanjit Chatterjee, Koray Karabina, Alfred Menezes. 236-251 [doi]
- Distributing the Key Distribution Centre in Sakai-Kasahara Based SystemsMartin Geisler, Nigel P. Smart. 252-262 [doi]
- Key Predistribution Schemes and One-Time Broadcast Encryption Schemes from Algebraic Geometry CodesHao Chen, San Ling, Carles Padró, Huaxiong Wang, Chaoping Xing. 263-277 [doi]
- Attribute-Based Encryption Supporting Direct/Indirect Revocation ModesNuttapong Attrapadung, Hideki Imai. 278-300 [doi]
- Certificate-Free Attribute AuthenticationDalia Khader, Liqun Chen, James H. Davenport. 301-325 [doi]
- Comparing with RSAJulien Cathalo, David Naccache, Jean-Jacques Quisquater. 326-335 [doi]
- Double-Exponentiation in Factor-4 Groups and Its ApplicationsKoray Karabina. 336-350 [doi]
- Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete LogarithmsAntoine Joux, Reynald Lercier, David Naccache, Emmanuel Thomé. 351-367 [doi]
- An Improvement to the Gaudry-Schost Algorithm for Multidimensional Discrete Logarithm ProblemsSteven D. Galbraith, Raminder S. Ruprai. 368-382 [doi]
- On Designs and Multiplier Groups Constructed from Almost Perfect Nonlinear FunctionsYves Edel, Alexander Pott. 383-401 [doi]
- A New Family of Hyper-Bent Boolean Functions in Polynomial FormSihem Mesnager. 402-417 [doi]
- The Rayleigh Quotient of Bent FunctionsLars Eirik Danielsen, Matthew G. Parker, Patrick Solé. 418-432 [doi]
- Cache Timing Analysis of LFSR-Based Stream CiphersGregor Leander, Erik Zenner, Philip Hawkes. 433-445 [doi]
- Optimal Recovery of Secret Keys from Weak Side Channel TracesWerner Schindler, Colin D. Walter. 446-468 [doi]
- Practical Zero-Knowledge Proofs for Circuit EvaluationEssam Ghadafi, Nigel P. Smart, Bogdan Warinschi. 469-494 [doi]