Équipes actuelles : | ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MOCAH MoVe NPA PEQUAN PolSys QI RO SMA SYEL |
Ancienne équipe : | ACASA |
- M. Albrecht, C. Cid, Th. Dulien, J.‑Ch. Faugère, L. Perret : “Algebraic Precomputations in Differential Cryptanalysis”, Information Security and Cryptology: 6th International Conference, Inscrypt 2010, Revised Selected Papers, vol. 6584, Lecture Notes in Computer Science, Shanghai, China, pp. 387-403, (Springer Berlin / Heidelberg) [Albrecht 2011a]
- M. Albrecht, J.‑Ch. Faugère, P. Farshim, L. Perret : “Polly Cracker, Revisited”, ASIACRYPT 2011 - 17th International Conference on the Theory and Application of Cryptology and Information Security, vol. 7073, Lecture Notes in Computer Science, Seoul, Korea, Republic of, pp. 179-196, (Springer) [Albrecht 2011b]
- M. Albrecht, P. Farshim, K. Paterson, G. Watson : “On Cipher-Dependent Related-Key Attacks in the Ideal Cipher Model”, Fast Software Encryption 2011, FSE, vol. 6733, Lecture Notes in Computer Science, Lyngby, Denmark, pp. 128-145, (Springer) [Albrecht 2011c]
- F. Armknecht, D. Augot, L. Perret, Ah. Sadeghi : “On Constructing Homomorphic Encryption Schemes from Coding Theory”, 13th IMA International Conference on Cryptography and Coding, vol. 7089, Lecture Notes in Computer Science, Oxford, United Kingdom, pp. 23-40, (Springer) [Armknecht 2011]
- L. Bettale, J.‑Ch. Faugère, L. Perret : “Cryptanalysis of Multivariate and Odd-Characteristic HFE Variants”, Public Key Cryptography - PKC 2011, vol. 6571, Lecture Notes in Computer Science, Taormina, Italy, pp. 441-458, (Springer Berlin / Heidelberg) [Bettale 2011]
- Ch. Bouillaguet, J.‑Ch. Faugère, P.‑A. Fouque, L. Perret : “Practical Cryptanalysis of the Identification Scheme Based on the Isomorphism of Polynomial With One Secret Problem”, 14th IACR International Conference on Practice and Theory of Public Key Cryptography - PKC 2011, vol. 6571, Lecture Notes in Computer Science, Taormina, Italy, pp. 473-493, (Springer) [Bouillaguet 2011]
- J.‑Ch. Faugère : “Solving efficiently structured polynomial systems and Applications in Cryptology”, The 15th workshop on Elliptic Curve Cryptography ECC 2011, Nancy, France [Faugère 2011a]
- J.‑Ch. Faugère, Ch. Goyet, G. Renault : “Algebraic Side Channel Analysis”, COSADE'11: The 2nd International Workshop on Constructive Side-Channel Analysis and Secure Design, Darmstadt, Germany, pp. 1-6 [Faugère 2011b]
- J.‑Ch. Faugère, Ch. Mou : “Fast algorithm for change of ordering of zero-dimensional Gröbner bases with sparse multiplication matrices”, Proceedings of the 36th international symposium on Symbolic and algebraic computation, San Jose, United States, pp. 115-122, (ACM) [Faugère 2011c]
- J.‑Ch. Faugère, V. Gauthier‑Umana, A. Otmani, L. Perret, J.‑P. Tillich : “A distinguisher for high rate McEliece cryptosystems”, ITW 2011- IEEE Information Theory Workshop, Paraty, Brazil, pp. 282-286, (IEEE) [Faugère 2011f]
- A. Greuet, M. Safey El Din : “Deciding reachability of the infimum of a multivariate polynomial.”, ISSAC 2011 - 36th International Symposium on Symbolic and Algebraic Computation, San Jose, United States, pp. 131-138, (ACM) [Greuet 2011]