Publications équipe CRYPTO 2012

Articles

• Jacques Patarin. Transfinite Cryptography. IJUC 8(1):61-72, 2012.

• Marine Minier and Mar’ıa Naya-Plasencia. A related key impossible differential attack against 22 rounds of the lightweight block cipher LBlock. Inf. Process. Lett. 112(16):624-629, 2012. (doi)

• Luca De Feo and Éric Schost. Fast arithmetics in Artin-Schreier towers over finite fields. J. Symb. Comput. 47(7):771-792, 2012. (doi)

• Anne Canteaut and Mar’ıa Naya-Plasencia. Parity-Check Relations on Combination Generators. IEEE Transactions on Information Theory 58(6):3900-3911, 2012. (doi)

• Anne Canteaut and Mar’ıa Naya-Plasencia. Correlation attacks on combination generators. Cryptography and Communications 4(3-4):147-171, 2012. (doi)

• Charles Bouillaguet, Pierre-Alain Fouque, Antoine Joux and Joana Treger. A family of weak keys in HFE and the corresponding practical key-recovery. J. Mathematical Cryptology 5(3-4):247-275, 2012. (doi)

• Charles Bouillaguet, Patrick Derbez, Orr Dunkelman, Pierre-Alain Fouque, Nathan Keller and Vincent Rijmen. Low-Data Complexity Attacks on AES. IEEE Transactions on Information Theory 58(11):7002-7017, 2012. (doi)

Inbooks

Marc Joye and Michael Tunstall (eds.). A Survey of Differential Fault Analysis Against Classical RSA Implementations, in Fault Analysis in Cryptography. Series Information Security and Cryptography, pages 111-124, Springer Berlin Heidelberg, 2012.

Inproceedings

• Jacques Patarin, Benjamin Gittins and Joana Treger. Increasing Block Sizes Using Feistel Networks: The Example of the AES. In Cryptography and Security: From Theory to Applications – Essays Dedicated to Jean-Jacques Quisquater on the Occasion of His 65th Birthday. 2012, 67-82.

• Jacques Patarin. Some Transfinite Generalisations of Gödel’s Incompleteness Theorem. In Computation, Physics and Beyond – International Workshop on Theoretical Computer Science, WTCS 2012, Dedicated to Cristian S. Calude on the Occasion of His 60th Birthday, Auckland, New Zealand, February 21-24, 2012, Revised Selected and Invited Papers. 2012, 183-193.

• Mar’ıa Naya-Plasencia and Thomas Peyrin. Practical Cryptanalysis of ARMADILLO2. In Fast Software Encryption – 19th International Workshop, FSE 2012, Washington, DC, USA, March 19-21, 2012. Revised Selected Papers. 2012, 146-162.

• Valérie Nachef, Jacques Patarin and Emmanuel Volte. Zero-Knowledge for Multivariate Polynomials. In Progress in Cryptology – LATINCRYPT 2012 – 2nd International Conference on Cryptology and Information Security in Latin America, Santiago, Chile, October 7-10, 2012. Proceedings. 2012, 194-213.

• Marcel Medwed, François-Xavier Standaert and Antoine Joux. Towards Super-Exponential Side-Channel Security with Efficient Leakage-Resilient PRFs. In Cryptographic Hardware and Embedded Systems – CHES 2012 – 14th International Workshop, Leuven, Belgium, September 9-12, 2012. Proceedings. 2012, 193-212.

• Avradip Mandal, Jacques Patarin and Yannick Seurin. On the Public Indifferentiability and Correlation Intractability of the 6-Round Feistel Construction. In Theory of Cryptography – 9th Theory of Cryptography Conference, TCC 2012, Taormina, Sicily, Italy, March 19-21, 2012. Proceedings. 2012, 285-302.

• Ronan Lashermes, Guillaume Reymond, Jean-Max Dutertre, Jacques Fournier, Bruno Robisson and Assia Tria. A DFA on AES Based on the Entropy of Error Distributions. In 2012 Workshop on Fault Diagnosis and Tolerance in Cryptography, Leuven, Belgium, September 9, 2012. 2012, 34-43.

• Rodolphe Lampe, Jacques Patarin and Yannick Seurin. An Asymptotically Tight Security Analysis of the Iterated Even-Mansour Cipher. In Advances in Cryptology – ASIACRYPT 2012 – 18th International Conference on the Theory and Application of Cryptology and Information Security, Beijing, China, December 2-6, 2012. Proceedings. 2012, 278-295.

• Rodolphe Lampe and Jacques Patarin. Analysis of Some Natural Variants of the PKP Algorithm. In SECRYPT 2012 – Proceedings of the International Conference on Security and Cryptography, Rome, Italy, 24-27 July, 2012, SECRYPT is part of ICETE – The International Joint Conference on e-Business and Telecommunications. 2012, 209-214.

• Antoine Joux and Vanessa Vitse. Cover and Decomposition Index Calculus on Elliptic Curves Made Practical – Application to a Previously Unreachable Curve over F$p^6$. In Advances in Cryptology – EUROCRYPT 2012 – 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cambridge, UK, April 15-19, 2012. Proceedings. 2012, 9-26.

• Jérémy Jean, Mar’ıa Naya-Plasencia and Thomas Peyrin. Improved Rebound Attack on the Finalist Grøstl. In Fast Software Encryption – 19th International Workshop, FSE 2012, Washington, DC, USA, March 19-21, 2012. Revised Selected Papers. 2012, 110-126.

• Nadia El Mrabet and Nicolas Gama. Efficient Multiplication over Extension Fields. In Arithmetic of Finite Fields – 4th International Workshop, WAIFI 2012, Bochum, Germany, July 16-19, 2012. Proceedings. 2012, 136-151.

• Maria Christofi and Aline Gouget. Formal Verification of the mERA-Based eServices with Trusted Third Party Protocol. In Information Security and Privacy Research – 27th IFIP TC 11 Information Security and Privacy Conference, SEC 2012, Heraklion, Crete, Greece, June 4-6, 2012. Proceedings. 2012, 299-314.

• Maria Christofi, Boutheina Chetali, Louis Goubin and David Vigilant. Formal verification of an implementation of CRT-RSA Vigilant’s algorithm. In First International Workshop on Security Proofs for Embedded Systems, 2012, PROOFS 2012, Leuven, Belgium, September 13, 2012. 2012.

• Claude Carlet, Louis Goubin, Emmanuel Prouff, Michaël Quisquater and Matthieu Rivain. Higher-Order Masking Schemes for S-Boxes. In Fast Software Encryption – 19th International Workshop, FSE 2012, Washington, DC, USA, March 19-21, 2012. Revised Selected Papers. 2012, 366-384.

• Alexandre Berzati, Cécile Canovas-Dumas and Louis Goubin. Secret Key Leakage from Public Key Perturbation of DLP-Based Cryptosystems. In Cryptography and Security: From Theory to Applications – Essays Dedicated to Jean-Jacques Quisquater on the Occasion of His 65th Birthday. 2012, 233-247.

• Anja Becker, Antoine Joux, Alexander May and Alexander Meurer. Decoding Random Binary Linear Codes in $2^(n/20)$: How 1+1=0 Improves Information Set Decoding. In Advances in Cryptology – EUROCRYPT 2012 – 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cambridge, UK, April 15-19, 2012. Proceedings. 2012, 520-536.

Misc

• Antoine Rojat. Review of cryptanalysis of RSA and its variants by Jason Hinek, in SIGACT News, vol. 43, pp. 16-18. 2012.

• Michaël Quisquater. The Hidden Side of Jean-Jacques Quisquater, in Cryptography and Security: From Theory to Applications – Essays Dedicated to Jean-Jacques Quisquater on the Occasion of His 65th Birthday, pp. 1-2. 2012.

• Antoine Joux. A Tutorial on High Performance Computing Applied to Cryptanalysis – (Invited Talk Abstract). Advances in Cryptology – EUROCRYPT 2012 – 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cambridge, UK, April 15-19, 2012. Proceedings, 2012.

• Nicolas Gama. Lattice reduction algorithms and Applications in Cryptology. CryptoBG, 2012.

• Louis Goubin. Post-Quantum Cryptography and Quantum Algorithms. Lorentz Center, Leiden, Pays-Bas.

• Luca De Feo. Isogeny graphs in cryptography. YACC, Centre Igesa, Porquerolles, France.

PhdThesis

• Anja Becker. La technique de représentation – Application à des problèmes difficiles en cryptographie. Thèse, Université de Versailles-St Quentin, 2012.

Techreport

• Jérôme Plût. Slope filtration on Banach-Colmez spaces. 2012.

• Emmanuel Volte, Jacques Patarin and Valérie Nachef. Zero Knowledge with Rubik’s Cubes. IACR Cryptology ePrint Archive, 2012/174. (pdf)

• Valérie Nachef, Jacques Patarin and Emmanuel Volte. Zero-Knowledge for Multivariate Polynomials. IACR Cryptology ePrint Archive, 2012/239. (pdf)

• Rodolphe Lampe and Jacques Patarin. Security of Feistel Schemes with New and Various Tools. IACR Cryptology ePrint Archive, 2012/131. (pdf)

• Antoine Joux. Faster index calculus for the medium prime case. Application to 1175-bit and 1425-bit finite fields. IACR Cryptology ePrint Archive, 2012/720. (pdf)

• Anne Canteaut, Thomas Fuhr, Mar’ıa Naya-Plasencia, Pascal Paillier, Jean-René Reinhard and Marion Videau. A Unified Indifferentiability Proof for Permutation- or Block Cipher-Based Hash Functions. IACR Cryptology ePrint Archive, 2012/363. (pdf)

• Charles Bouillaguet, Patrick Derbez and Pierre-Alain Fouque. Automatic Search of Attacks on round-reduced AES and Applications. IACR Cryptology ePrint Archive, 2012/069. (pdf)

• Anja Becker, Antoine Joux, Alexander May and Alexander Meurer. Decoding Random Binary Linear Codes in $2^n/20$: How 1+1=0 Improves Information Set Decoding. IACR Cryptology ePrint Archive, 2012/026. (pdf)