WCC 2007

International Workshop on Coding and Cryptography
April 16-20, 2007, Versailles (France)
Scientific program

9h00-10h00. Registration.
10h00. Welcome
10h05. Invited talk: Amin Shokrollahi.
10h55-11h20. Break.
11h20. General error locator polynomials for nth-root codes. Marta Giorgetti and Massimiliano Sala.
11h45. On LDPC Codes from (0,1)-Geometries Induced by Finite Inversive Spaces of Even Order. Mark Flanagan, Marcus Greferath, and Cornelia Roessing.
12h10. List Decoding of second order Reed-Muller Codes and its covering radius implications. Rafaël Fourquet and Cédric Tavernier.

14h45. Small weight codewords in the codes arising from the projective plane. V. Fack, Sz. L. Fancsali, L. Storme, G. Van de Voorde and J. Winne.
15h10. Characterization results on arbitrary (non-)weighted minihypers and on linear codes meeting the Griesmer bound. J. De Beule, K. Metsch and L. Storme.
15h35. On the Groebner test set of binary codes M. Borges-Quintana, M. A. Borges-Trenard and E. Martinez-Moro.
16h00-16h30. Break.
16h30. Skew Hadamard Designs and their Codes. Jon-Lark Kim and Patrick Solé.
16h55. Edge Local Complementation and Equivalence of Binary Linear Codes. Lars Eirik Danielsen and Matthew G. Parker.
17h20. Codes identifying sets of binary words with large radii. Tero Laihonen and Sanna Ranto.

9h30. Invited talk: Thomas Johansson.
10h20-10h50. Break.
10h50. Recognizing reducible structures in Hamming distance codes. Raphael Overbeck.
11h15. Error Correction Procedures for Advanced Encryption Standard. Mariusz Czapski and Maciej Nikodem.
11h40. Identity-based identification and signature schemes using correcting codes. P.-L. Cayrel, P. Gaborit and M. Girault.
12h05. Semantic Security for the McEliece Cryptosystem without Random Oracles, Easily. Ryo Nojima, Hideki Imai, Kazukuni Kobara and Kirill Morozov.

14h30. Balanced Boolean Functions with (more than) Maximum Algebraic Immunity. Deepak Kumar Dalai and Subhamoy Maitra.
14h55. On the 2^m-variable Symmetric Boolean Functions with Maximum Algebraic Immunity 2^m. Feng Liu and Keqin Feng.
15h20. Efficient Techniques to Find Algebraic Immunity of S-boxes Based on Power Mappings. Yassir Nawaz, Kishan Chand Gupta and Guang Gong.
15h45-16h15. Break.
16h15. On the intersection of additive extended and non-extended perfect codes. J. Rifa, F. Solov'eva and M. Villanueva.
16h40. A Family of Ternary Quasi-Perfect Codes. Danyo Danev and Stefan Dodunekov.
17h05. An algebraic approach to the classification of some non-linear codes. Eleonora Guerrini and Massimiliano Sala.

9h30. Idempotents in the Neighbourhood of Patterson-Wiedemann Functions having Walsh Spectra Zeros. Sumanta Sarkar and Subhamoy Maitra.
9h55. An algebraic description of Boolean functions. Massimiliano Sala and Ilaria Simoetti.
10h20. An association scheme of cubic bent functions. Christian Bey and Gohar M. Kyureghyan.
10h45-11h15. Break.
11h15. Linear Groups of Isometries with Poset Structures. Marcelo Firer, Luciano Panek, Hyun Kwang Kim and Jong Yoon Hyun.
11h40. Some Strategies to Find Self-Dual Representations of Identically Self-Dual Matroids.. Marc Heymann and Carles Padró.
12h05. Lattices and Bounds for Commutative Group. Rogerio M. Siqueira and Sueli I. R. Costa.
12h30. The trace of an optimal normal element and low complexity normal bases. Maria Christopoulou, Theo Garefalakis, Daniel Panario and David Thomson.

9h30. Invited talk: Serge Vaudenay.
10h20-10h50. Break.
10h50. On Non-negligible Bias of the First Output Byte of RC4 towards the First Three Bytes of the Secret Key. Goutam Paul, Siddheshwar Rathi and Subhamoy Maitra.
11h15. Solving MRHS linear equations.Extended abstract. Håvard Raddum and Igor Semaev.
11h40. Traitor tracing scheme with constant ciphertext rate against powerful pirates. Thomas Sirvent.
12h05. On solving sparse algebraic equations over finite fields. Extended abstract. Igor Semaev.

14h30. Efficient Public Key Encryption with Smallest Ciphertext Expansion from Factoring. Haifeng Qian, Yuan Zhou, Zhibin Li and Zecheng Wang.
14h55. Extractors for Binary Elliptic Curves. Reza Rezaeian Farashahi, Ruud Pellikaan and Andrey Sidorenko.
15h20. Constructions of Systematic Authentication Codes Using Additive Polynomials. Ferruh Ozbudak and Zulfukar Saygi.
15h45-16h15. Break.
16h15. On the Classification of APN Functions up to Dimension Five. Marcus Brinkmann and Gregor Leander.
16h40. Bundles, presemifields and nonlinear functions. K. J. Horadam and D. G. Farmer.
17h05. Another class of quadratic APN binomials over F_2ⁿ: the case n divisible by 4. Lilya Budaghyan, Claude Carlet, Gregor Leander.

9h30. Periodic Multisequences with Large Error Linear Complexity. Harald Niederreiter and Ayineedi Venkateswarlu.
9h55. k-Error Linear Complexity of Generalisations of Sidelnikov Sequences. Nina Brandstätter and Arne Winterhof.
10h20. Composition of Recursions and Nonlinear Complexity of Periodic Binary Sequences. G. Petrides and J. Mykkeltveit.
10h45-11h15. Break.
11h15. Asymptotically good codes. Conchita Martínez-Peréz and Wolfgang Willems.
11h40. On Kloosterman sums divisible by 3. Kseniya Garaschuk and Petr Lisonek.
12h05. Duality of Ring-Linear Codes and a Linear Programming Bound. Eimear Byrne, Marcus Greferath and Michael O'Sullivan

Last modified: April 11, 2007