Publications

Dernière mise à jour : Novembre 2013 (Pascale Charpin).

2013

M. Abbara. Turbo-codes quantiques. Thèse de doctorat, École Polytechnique, Palaiseau, Avril 2013.

I. Andriyanova, D. Maurice and J.-P. Tillich. A family of quantum codes with performances close to the hashing bound under iterative decoding In Proceedings of the 2013 IEEE International Symposium on Information Theory, ISIT"13, Istambul, Turkey, July 2013.

D. Augot, A. Canteaut, G. Kyureghyan, F.I. Solovieva and Oyvind Ytrehus (Eds.). Special Issue in Coding and Cyptography . Designs, Codes and Cryptography, Springer-Verlag, Vol. 66, Issue 1-3, January 2013.

C. Boura and A. Canteaut. On the Influence of the Algebraic Degree of F -1 on the Algebraic Degree of
G ο F , IEEE Trans. Inform. Theory, In Press.

C. Boura and A. Canteaut. A new criterion for avoiding the propagation of linear relations through an S-box. In Proceedings of Fast Software Encryption, FSE 2013, Lecture Notes in Computer Science, Springer-Verlag. In Press.
Full version in Cryptology ePrint Archive, Report 2013/211.

A. Canteaut. On some algebraic properties of Keccak, In proceedings of Keccak & SHA-3 Day , Brussels, Belgium, March 2013. Invited talk.

A. Canteaut. Extended differential properties of cryptographic functions, In proceedings of The 11th International Conference on Finite Fields and their Applications - Fq11 -, Magdeburg, Germany, July 2013.
Invited talk.

A. Canteaut. Similarities between Encryption and Decryption: How far can we go?, slides . In proceedings of Selected Areas in Cryptography - SAC 2013 - Vancouver, Canada, Aout 2013. Invited talk.

A. Canteaut, M. Naya-Plasencia and B. Vayssière. Sieve-in-the-Middle: Improved MITM Attacks. In Proceedings of CRYPTO 2013, LNCS 8042, pp. 222-240, Springer-Verlag, 2013.
Full version in Cryptology ePrint Archive, Report 2013/324.

P. Charpin. PN and APN functions , Chapter 9.2 in Special functions over finite fields, Handbook of Finite Fields, Discr. Math. series, June 2013, G.L. Mullen and D. Panario (Eds.),
Chapman and Hall/CRC, June 2013.

P. Charpin, A. Pott and A. Winterhof (Eds.). Finite Fields and their Applications: character sums and polynomials, Radon Series on Computational and Applied Mathematics, Volume 11, De Gruyter, 2013.

P. Charpin and G. M. Kyureghyan.
A note on verifying the APN property in Cryptology ePrint Archive, Report 2013/475.

P. Charpin, G. M. Kyureghyan and V. Suder. Sparse Permutations with Low differential uniformity . To appear in Finite Fields Appl. .

A. Couvreur, P. Gaborit, V. Gauthier, A. Otmani, J.-P. Tillich. Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes. In proceedings of Workshop on Coding and Cryptography , WCC 13, pp. 180-92, April 15-19, Bergen, Norway.

A. Couvreur, A. Otmani, J.-P. Tillich. New Identities Relating Wild Goppa Codes. ArXiv:1310.3202, 2013.

J.-C. Faugère, V. Gauthier, A. Otmani, L. Perret and J.-P. Tillich. A Distinguisher for High Rate McEliece Cryptosystems. IEEE Trans. Inform. Theory , vol.59, n. 10, pp.6830-6844, Octobre 2013.

T. Fritz, A.B. Sainz, R Augusiak, J.B. Brask, R. Chaves, A. Leverrier and A. Acín. Local orthogonality as a multipartite principle for quantum correlations, Nature Communications 4, p. 2263, 2013.

T. Fritz, A. Leverrier and A.B. Sainz. Probabilistic models on contextuality scenarios , arXiv:1307.0145, 2013.

B. Gérard, V. Grosso, M. Naya-Plasencia and F.-X. Standaert. Block Ciphers that are Easier to Mask: How Far Can we Go? In Proceedings of CHES 2013, Lecture Notes in Computer Science, Springer-Verlag, to appear.

J. Jean, M. Naya-Plasencia, and T. Peyrin. Multiple limited-birthday distinguishers and applications, In proceedings of Selected Areas in Cryptography
- SAC 2013 - Vancouver, Canada, Aout 2013.

J. Jean, M. Naya-Plasencia, and T. Peyrin. Improved cryptanalysis of AES-like permutations, Journal of Cryptology. To appear.

P. Jouguet, S. Kunz-Jacques, A. Leverrier, P. Grangier and E. Diamanti. Experimental demonstration of long-distance continuous-variable quantum key distribution, Nature Photonics 7, p. 378–381, 2013.

G. M. Kyureghyan. Special mappings of finite fields. In Finite Fields and Their Applications. Character Sums and Polynomials , Radon Series on Computational and Applied Mathematics, Degruyter. In press.

G. M. Kyureghyan and V. Suder. On inversion in Z(2^n-1). arXiv:1303.0716v1 [math.NT]

http://arxiv.org/abs/1303.0716. To appear in Finite Fields Appl. .

G. M. Kyureghyan and V. Suder. On inversion in Z(2^n-1), In proceedings of The 11th International Conference on Finite Fields and their Applications - Fq11 -, Magdeburg, Germany, July 2013.

V. Lallemand. Am\'eliorations des attaques diff\'erentielles sur KLEIN , Rapport de stage (Master thesis), Septembre 2013. Direction: Maria Naya-Plasencia.

G. Landais and J.-P. Tillich. An efficient attack of a McEliece cryptosystem variant based on convolutional codes. Post-Quantum Cryptography - PQCrypto 2013 -, Limoges (France), June 4-7, LNCS 7932, pp. 102--117, Springer-Verlag.

A. Leverrier, R. Garcia-Patron, R. Renner and N.J. Cerf. Security of Continuous-Variable Quantum Key Distribution Against General Attack. Physical Review Letters, vol. 110, p. 030502, 2013

A. Leverrier and R. Garcia-Patrón. Does Boson Sampling need Fault-Tolerance? arXiv:1309.4687, 2013.

R. Misoczki, J.-P. Tillich, N. Sendrier, and P.S.L. M. Barreto. MDPC-McEliece: New McEliece Variants from Moderate Density Parity-Check Codes In Proceedings of the 2013 IEEE International Symposium on Information Theory, ISIT"13, Istambul, Turkey, July 2013.

M. Naya-Plasencia. "Meet-in-the-middle" through an S-box. In Early Symmetric Crypto seminar , January 2013, Luxembourg.

M. Naya-Plasencia. First practical results on reduced-round Keccak and unaligned rebound attack. In Keccak and SHA-3 day , March 2013, Belgium.

M. Naya-Plasencia. Cryptanalysis of lightweight block ciphers. In Summer school on Design and Security of Cryptographic Functions, Algorithms and Devices , July 2013, Albena, Bulgaria.

S. Pironio, L. Masanes, A. Leverrier and A. Acín. Security of Device-Independent Quantum Key Distribution in the Bounded-Quantum-Storage Model , Physical Review X 3 (3), p. 031007, 2013.

C. Rechberger, C. Boura, B. Mennik and M. Naya-Plasencia. Final Hash Functions Status Report (D.SYM.11). In Proceedings of ECRYPTII. Report on the SHA-3 competition,

N. Sendrier and D.E. Simos. How easy is code equivalence over Fq?. In proceedings of Workshop on Coding and Cryptography , WCC 13, April 15-19, Bergen, Norway.

N. Sendrier and D.E. Simos. The Hardness of Code Equivalence over Fq and its Application to Code-based Cryptography. Post-Quantum Cryptography - PQCrypto 2013 -, Limoges (France), June 4-7, Springer-Verlag, to appear.

J.P.~Tillich and G.~Zémor. Quantum LDPC codes with positive rate and minimum distance proportional to the square root of the blocklength, IEEE Trans. Inform. Theory, In Press.