Submission Deadline
January 19, 2015
Authors Notification
March 2, 2015
Final Extended Abstract
March 13, 2015

June 16
Website is up

December 11
Submission server is open

January 7
Registration is open

January 13

March 10
Program
Monday April 13
09:00  09:05 Welcome
09:05  10:45 Symmetric cryptography I
Anne Canteaut
Redefining the Transparency Order
Security Proof of the Canonical Form of SelfSynchronizing Stream Cipher
New Distinguishers for Reduced Round Trivium and TriviaSC using Cube Testers
Revisiting Roos Bias in RC4 Key Scheduling Algorithm
10:45  11:15 Coffee break
11:15  12:05 Invited talk (Daniel Katz)
Tor Helleseth
Finite Field Power Permutations and ThreeValued Weil Sums of Binomials
12:05  14:00 Lunch
14:00  15:40 Discrete mathematics and cryptography
Sihem Mesnager
Antiderivative Functions over 𝔽_{2n}
Improved Elliptic Curve Hashing and Point Representation
Optimal softwareimplemented ItohTsujii inversion for GF(2^{m})
Vectorial quadratic bent functions as a product of two linearized polynomials
15:40  16:10 Coffee break
16:10  18:15 Coding theory
Gregory Kabatiansky
HasseWeil Bound for Additive Cyclic Codes
Fast decoding of dual multipoint codes from algebraic curves up to the KirfelPellikaan bound
On asymptotically good ramp secret sharing schemes
Two Algebraic Manipulation Detection Codes Based on a Scalar Product
MacWilliams Extension Theorem for MDS additive codes
Tuesday April 14
09:00  10:40 Finite fields
Alexander Pott
On one class of permutation polynomials over finite fields of characteristic two
On Some Permutation Binomials and Trinomials Over 𝔽_{2n}
ArtinSchreier extensions of normal bases
Explicit Maximal and Minimal Curves over Finite Fields of Odd Characteristics
10:40  11:10 Coffee break
11:10  12:00 Invited talk (Swastik Kopparty)
JeanPierre Tillich
High rate locally decodable and locally testable codes: theory and applications
12:00  14:00 Lunch
14:00  15:40 Decoding
Daniel Augot
Symmetric Disjunctive ListDecoding Codes
Solving Shift Register Problems over Skew Polynomial Rings using Module Minimisation
Asymptotic Strategies for GMD Decoding with Arbitrary ErrorErasure Tradeoff
List and Probabilistic Unique Decoding of HighRate Folded Gabidulin Codes
15:40  16:10 Coffee break
16:10  17:50 Bounds in coding theory
Vladimir Sidorenko
Critical pairs for the Product Singleton Bound
The Main Conjecture for NearMDS Codes
Lower Bound of the Covering Radius of Binary Irreducible Goppa Codes
On the Griesmer bound for nonlinear codes
Wednesday April 15
09:00  11:05 Codes and information theory
Joachim Rosenthal
On codes for multiple access adder channel with noise and feedback
Multicomponent Network Codes for Channel with Random Linear Transformations and Packet Errors
Upper bound on the performance of an order statisticsbased decoder
Asymptotic Estimation of the Error Exponents of LDPC Code with Special Construction
On the typical values of the crosscorrelation measure
11:05  11:35 Coffee break
11:35  12:50 Symmetric cryptography II
Willi Meier
Reflection Ciphers
Improving Impossible Differential Attacks against Rijndael160 and Rijndael224
On Distinct Known Plaintext Attacks
12:50  14:50 Lunch
19:30  Gala Dinner at "Le Train Bleu"
Thursday April 16
09:00  10:40 Codes and cryptography
Ferruh Ozbudak
Proof of a Conjectured ThreeValued Family of Weil Sums of Binomials
On the nonlinearity of idempotent quadratic functions and the weight distribution of subcodes of ReedMuller codes
On the Direct Construction of Recursive MDS Matrices
Towards a General Construction of Recursive MDS Diffusion Layers
10:40  11:10 Coffee break
11:10  12:00 Invited talk (Emmanuel Thomé)
Nicolas Sendrier
Computing discrete logarithms in small characteristic finite fields in quasipolynomial time
12:00  14:00 Lunch
14:00  15:40 Public key cryptography
Pierre Loidreau
Better Algorithms for MSBside RSA Reconstruction
Hiding the carriers in the polynomial Naccache Stern knapsack cryptosystem
Cryptanalysis of an RSA variant with Moduli N=p^{r}q^{l}
A CodeBased Group Signature
15:40  16:10 Coffee break
16:10  18:15 Combinatorics and coding
Alev Topuzoglu
Embedding Distances into the Hamming Cube
A new constellation for spacetime coding
The second and the third smallest arrangements of hyperplanes in finite projective spaces
A Generalization of Montucla's RectangletoRectangle Dissection to Higher Dimensions
Energy bounds for codes and designs in H(n,q)
Friday April 17
09:00  10:40 Symmetric cryptography III
Marine Minier
On algebraic cryptanalysis of ciphers with low multiplicative complexity
Improving the Security and Efficiency of Block Ciphers based on LSDesigns
Salsa20 Cryptanalysis: New Moves and Revisiting Old Styles
RelatedKey Linear Hull Distinguishers for KeyAlternating Block Ciphers
10:40  11:10 Coffee break
11:10  12:25 Cover free codes
Ivan Landjev