Program

Show only session names

Monday April 13

09:00 - 09:05 Welcome

09:05 - 10:45 Symmetric cryptography I

Redefining the Transparency Order

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

New Distinguishers for Reduced Round Trivium and Trivia-SC 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)

Finite Field Power Permutations and Three-Valued Weil Sums of Binomials

12:05 - 14:00 Lunch

14:00 - 15:40 Discrete mathematics and cryptography

Antiderivative Functions over 𝔽_2ⁿ

Improved Elliptic Curve Hashing and Point Representation

Optimal software-implemented Itoh--Tsujii 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

Hasse-Weil Bound for Additive Cyclic Codes

Fast decoding of dual multipoint codes from algebraic curves up to the Kirfel-Pellikaan 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

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

On Some Permutation Binomials and Trinomials Over 𝔽_2ⁿ

Artin-Schreier 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)

High rate locally decodable and locally testable codes: theory and applications

12:00 - 14:00 Lunch

14:00 - 15:40 Decoding

Symmetric Disjunctive List-Decoding Codes

Solving Shift Register Problems over Skew Polynomial Rings using Module Minimisation

Asymptotic Strategies for GMD Decoding with Arbitrary Error-Erasure Tradeoff

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

15:40 - 16:10 Coffee break

16:10 - 17:50 Bounds in coding theory

Critical pairs for the Product Singleton Bound

The Main Conjecture for Near-MDS 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

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 statistics-based decoder

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

On the typical values of the cross-correlation measure

11:05 - 11:35 Coffee break

11:35 - 12:50 Symmetric cryptography II

Reflection Ciphers

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

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

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

On the nonlinearity of idempotent quadratic functions and the weight distribution of subcodes of Reed-Muller 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é)

Computing discrete logarithms in small characteristic finite fields in quasi-polynomial time

12:00 - 14:00 Lunch

14:00 - 15:40 Public key cryptography

Better Algorithms for MSB-side RSA Reconstruction

Hiding the carriers in the polynomial Naccache Stern knapsack cryptosystem

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

A Code-Based Group Signature

15:40 - 16:10 Coffee break

16:10 - 18:15 Combinatorics and coding

Embedding Distances into the Hamming Cube

A new constellation for space-time coding

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

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

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

Friday April 17

09:00 - 10:40 Symmetric cryptography III

On algebraic cryptanalysis of ciphers with low multiplicative complexity

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

Salsa20 Cryptanalysis: New Moves and Revisiting Old Styles

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

10:40 - 11:10 Coffee break

11:10 - 12:25 Cover free codes

Cover-Free Codes and Frequency Hopping Multiple Access

Almost Cover-Free Codes and Designs

Cover-Free Codes and Separating System Codes

12:25 - 14:25 Lunch