The Ninth International Workshop on Coding and Cryptography 2015
April 13-17, 2015
Paris, France

Accepted papers

• A Code-Based Group Signature

  Quentin Alamélou and Olivier Blazy and Stephane Cauchie and Philippe Gaborit
  XLIM-DMI, Université de Limoges and XLIM-DMI, Université de Limoges and RD Worldline and XLIM-DMI, Université de Limoges

• A Generalization of Montucla's Rectangle-to-Rectangle Dissection to Higher Dimensions

  Antonio Campello and Vinay A. Vaishampayan
  University of Campinas and City University of New York

• Almost Cover-Free Codes and Designs

  D'yachkov Arkady Georgievich and Vorobyev Ilya Viktorovich and Polyanskii Nikita Andreevich and Shchukin Vladislav Yuryevich
  Lomonosov Moscow State University and Lomonosov Moscow State University and Lomonosov Moscow State University and Lomonosov Moscow State University

• A new constellation for space-time coding

  Robert, Gwezheneg
  IRMAR -- université de Rennes 1 and INRIA -- Saclay - Ile de France

• Antiderivative Functions over F2n

  Valentin SUDER
  University of Waterloo, Communications Security Lab

• Artin-Schreier extensions of normal bases

  David Thomson and Colin Weir
  Carleton University and Simon Fraser University

• Asymptotic Estimation of the Error Exponents of LDPC Code with Special Construction

  Pavel Rybin and Victor Zyablov
  IITP RAS and IITP RAS

• Asymptotic Strategies for GMD Decoding with Arbitrary Error-Erasure Tradeoff

  Joschi Brauchle and Vladimir Sidorenko
  Institute for Communications Engineering, Technische Universität München and Institute for Communications Engineering, Technische Universität München

• Better Algorithms for MSB-side RSA Reconstruction

  Pratibha Jagnere and Srijan Sanket and Anuj Chauhan and Ragesh Jaiswal
  Indian Institute of Technology Delhi and Indian Institute of Technology Delhi and Indian Institute of Technology Delhi and Indian Institute of Technology Delhi

• Cover-Free Codes and Frequency Hopping Multiple Access

  Mwawi Nyirenda and Siaw-Lynn Ng and Keith Martin
  Department of Information security, Royal Holloway College, University of London and Department of Information security, Royal Holloway College, University of London and Department of Information security, Royal Holloway College, University of London

• Cover-Free Codes and Separating System Codes

  D'yachkov Arkady Georgievich and Vorobyev Ilya Viktorovich and Polyanskii Nikita Andreevich and Shchukin Vladislav Yuryevich
  Lomonosov Moscow State University and Lomonosov Moscow State University and Lomonosov Moscow State University and Lomonosov Moscow State University

• Critical pairs for the Product Singleton Bound

  Diego Mirandola and Gilles Zémor
  CWI, Leiden University, Bordeaux University and Bordeaux University

• Cryptanalysis of an RSA variant with Moduli $N=p^rq^l$

  Yao Lu and Liqiang Peng and Santanu Sarkar
  State Key Laboratory of Information Security (SKLOIS) Institute of Information Engineering (IIE) and State Key Laboratory of Information Security (SKLOIS) Institute of Information Engineering (IIE) and Indian Institute of Technology Madras

• Embedding Distances into the Hamming Cube

  Rafael Gregorio Lucas D'Oliveira and Marcelo Firer
  IMECC - UNICAMP and IMECC - UNICAMP

• Energy bounds for codes and designs in $H(n,q)$

  Peter Boyvalenkov and Peter Dragnev and Douglas Hardin and Edward Saff and Maya Stoyanova
  Institute of Mathematics and Informatics, Bulgarian Academy of Sciences and Department of Mathematical Sciences, Indiana-Purdue University Fort Wayne and Center for Constructive Approximation, Department of Mathematics, Vanderbilt University and Center for Constructive Approximation, Department of Mathematics, Vanderbilt University and Faculty of Mathematics and Informatics, Sofia University

• Explicit Maximal and Minimal Curves over Finite Fields of Odd Characteristics

  Zulfukar SAYGI and Ferruh Ozbudak
  TOBB ETU and METU

• Fast decoding of dual multipoint codes from algebraic curves up to the Kirfel-Pellikaan bound

  Masaya Fujisawa and Shojiro Sakata
  Tokyo University of Science and Emeritus Professor, The University of Electro-Communications

• Hasse-Weil Bound for Additive Cyclic Codes

  Cem Güneri and Ferruh Özbudak and Funda Özdemir
  Faculty of Engineering and Natural Sciences, Sabancı University, 34956 , İstanbul, Turkey and Department of Mathematics and Institute of Applied Mathematics, Middle East Technical University, 06531, Ankara, Turkey and Faculty of Engineering and Natural Sciences, Sabancı University, 34956 , İstanbul, Turkey

• Hiding the carriers in the polynomial Naccache Stern knapsack cryptosystem

  Giacomo Micheli and Joachim Rosenthal and Reto Schnyder
  University of Zurich and University of Zurich and University of Zurich

• Improved Elliptic Curve Hashing and Point Representation

  Taechan Kim and Mehdi Tibouchi
  NTT Secure Platform Laboratories and NTT Secure Platform Laboratories

• Improving Impossible Differential Attacks against Rijndael-160 and Rijndael-224

  Marine Minier
  Université de Lyon, INRIA, INSA-Lyon, CITI-INRIA, F-69621, Villeurbanne, France

• Improving the Security and Efficiency of Block Ciphers based on LS-Designs

  Anthony Journault and François-Xavier Standaert and Kerem Varici
  UCL Crypto Group and UCL Crypto Group and UCL Crypto Group

• List and Probabilistic Unique Decoding of High-Rate Folded Gabidulin Codes

  Hannes Bartz
  Institute for Communications Engineering, Technische Universität München

• Lower Bound of the Covering Radius of Binary Irreducible Goppa Codes

  Sergey Bezzateev and Natalia Shekhunova
  Saint Petersburg State University of Aerospace Instrumentation and Saint Petersburg State University of Aerospace Instrumentation

• MacWilliams Extension Theorem for MDS additive codes

  Serhii DYSHKO
  IMATH, Universite de Toulon

• Multicomponent Network Codes for Channel with Random Linear Transformations and Packet Errors

  Alexander Shishkin
  Moscow Institute of Physics and Technology (State University)

• New Distinguishers for Reduced Round Trivium and Trivia-SC using Cube Testers (Extended Abstract)

  Anubhab Baksi and Subhamoy Maitra and Santanu Sarkar
  Indian Statistical Institute and Indian Statistical Institute and Indian Institute of Technology Madras

• On algebraic cryptanalysis of ciphers with low multiplicative complexity

  Pavol Zajac
  Slovak University of Technology in Bratislava

• On asymptotically good ramp secret sharing schemes

  Olav Geil and Stefano Martin and Umberto Mart{\'i}nez-Pe\~{n}as and Ryutaroh Matsumoto and Diego Ruano
  Aalborg University and Aalborg University and Aalborg University and Tokyo Institute of Technology and Aalborg University

• On codes for multiple access adder channel with noise and feedback

  Grigory Kabatiansky and Vladimir Gritsenko and Vladimir Lebedev and Alexey Maevskiy
  IITP RAS and IITP RAS and IITP RAS and IITP RAS

• On Distinct Known Plaintext Attacks

  Céline Blondeau and Kaisa Nyberg
  Aalto University and Aalto University

• On one class of permutation polynomials over finite fields of characteristic two

  Leonid A. Bassalygo and Victor A. Zinoviev
  Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences and Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences

• On Some Permutation Binomials and Trinomials Over $\F_{2^n}$

  Srimanta Bhattacharya and Sumanta Sarkar
  Center of Excellence in Cryptology, Indian Statistical Institute, Kolkata, India. and Center of Excellence in Cryptology, Indian Statistical Institute, Kolkata, India.

• On the Direct Construction of Recursive MDS Matrices

  Kishan Chand Gupta and Sumit Kumar Pandey and Ayineedi Venkateswarlu
  Applied Statistics Unit, Indian Statistical Institute, Kolkata and C.R. RAO AIMSCS, Hyderabad and Computer Science Unit, Indian Statistical Institute - Chennai Centre

• On the Griesmer bound for nonlinear codes

  Emanuele Bellini and Alessio Meneghetti
  Telsy S.p.A. and University of Trento

• On the nonlinearity of idempotent quadratic functions and the weight distribution of subcodes of Reed-Muller codes

  Nurdagül Anbar and Wilfried Meidl and Alev Topuzoglu
  Technical University of Denmark, Matematiktorvet, Building 303B, DK-2800, Lyngby, Denmark and Johann Radon Institute for Computational and Applied Mathematics, Austrian Academy of Sciences, Linz, Austria and Sabanc University, MDBF, Orhanl, Tuzla, 34956 Istanbul, Turkey

• On the typical values of the cross-correlation measure

  László Mérai
  RICAM

• Optimal software-implemented Itoh--Tsujii inversion for GF($2^m$)

  Jeremy Maitin-Shepard
  University of California, Berkeley

• Powers of Subfield Polynomials, Cyclic Codes and Algebraic Attacks with Applications to the WG Stream Ciphers

  Sondre Rønjom
  Nasjonal sikkerhetsmyndighet, Rødskiferveien 20, 1352 Kolsås, Norway

• Proof of a Conjectured Three-Valued Family of Weil Sums of Binomials

  Katz, Daniel and Langevin, Philippe
  California State University, Northridge, and Institut de Mathématiques de Toulon, Université de Toulon.

• Redefining the Transparency Order

  Kaushik Chakraborty and Sumanta Sarkar and Subhamoy Maitra and Bodhisatwa Mazumdar and Debdeep Mukhopadhyay and Emmanuel Prouff
  SECRET Team, INRIA, Rocquencourt and Indian Statistical Institute, Kolkata and Indian Statistical Institute, Kolkata and Indian Institute of Technology, Kharagpur and Indian Institute of Technology, Kharagpur and Agence nationale de la sécurité des systèmes d'information (ANSSI)

• Reflection Ciphers

  Christina Boura and Anne Canteaut and Lars R. Knudsen and Gregor Leander
  Université de Versailles and Inria and DTU and Ruhr-Universität Bochum

• Related-Key Linear Hull Distinguishers for Key-Alternating Block Ciphers

  Andrey Bogdanov and Vincent Rijmen and Elmar Tischhauser
  Technical University of Denmark and Katholieke Universiteit Leuven and Technical University of Denmark

• Revisiting Roos Bias in RC4 Key Scheduling Algorithm

  Santanu Sarkar and Ayineedi Venkateswarlu
  Department of Mathematics, Indian Institute of Technology Madras and Computer Science Unit, Indian Statistical Institute - Chennai Centre

• Salsa20 Cryptanalysis: New Moves and Revisiting Old Styles

  Subhamoy Maitra and Goutam Paul and Willi Meier
  Indian Statistical Institute and Indian Statistical Institute and FHNW

• Security Proof of the Canonical Form of Self-Synchronizing Stream Cipher

  Brandon Dravie and Philippe Guillot and Gilles Millérioux
  Université de Lorraine and Laboratoire Analyse, Géométrie et Applications and Université de Lorraine

• Solving Shift Register Problems over Skew Polynomial Rings using Module Minimisation

  Wenhui Li and Johan S. R. Nielsen and Sven Puchinger and Vladimir Sidorenko
  Institute of Communications Engineering, Ulm University and GRACE Project, INRIA Saclay & LIX, Ecole Polytechnique and Institute of Communications Engineering, Ulm University and Institute for Communications Engineering, TU München

• Symmetric Disjunctive List-Decoding Codes

  D'yachkov Arkady Georgievich and Vorobyev Ilya Viktorovich and Polyanskii Nikita Andreevich and Shchukin Vladislav Yuryevich
  Lomonosov Moscow State University and Lomonosov Moscow State University and Lomonosov Moscow State University and Lomonosov Moscow State University

• The Main Conjecture for Near-MDS Codes

  Ivan Landjev and Assia Rousseva
  New Bulgarian University and Sofia University

• The second and the third smallest arrangements of hyperplanes in finite projective spaces

  Daniele Bartoli and Leo Storme
  Department of Mathematics, Ghent University and Department of Mathematics, Ghent University

• Towards a General Construction of Recursive MDS Diffusion Layers

  Kishan Chand Gupta and Sumit Kumar Pandey and Ayineedi Venkateswarlu
  Applied Statistics Unit, Indian Statistical Institute, Kolkata, and CR RAO AIMSCS, Hyderabad, and Computer Science Unit, Indian Statistical Institute, Chennai - Centre

• Two Algebraic Manipulation Detection Codes Based on a Scalar Product Operation

  Maksim Alekseev
  St.Petersburg State University of Aerospace Instrumentation

• Upper bound on the performance of an order statistics-based decoder

  Dmitry Osipov
  Institute for Information Transmission Problems Russian Academy of Sciences

• Vectorial quadratic bent functions as a product of two linearized polynomials

  Alexander Pott and Enes and Amela Muratovic-Ribic and Samed Bajric
  University Otto-von-Guericke, Faculty of Mathematics, Magdeburg, and University of Primorska, FAMNIT and IAM, Koper and University of Sarajevo, Department of Mathematics, Zmaja od Bosne 33-35, 71000 Sarajevo and University of Primorska, FAMNIT, Koper, Slovenia