ECO: Exact Computing
L'équipe ECO est un jeune groupe s'intéressant aux aspects calculatoires de problèmes mathématiques. En particulier, nos travaux sont issus du calcul formel, de la cryptographie et de la théorie algorithmique des nombres.
Membres
Permanents
- Pascal Giorgi, Maître de Conférences UM
- Bruno Grenet, Maître de Conférences UM
- Eleonora Guerrini, Maître de Conférences UM
- Laurent Imbert, Directeur de Recherche CNRS
- Romain Lebreton, Maître de Conférences UM
Non permanents
- Ilaria Zappatore, Doctorant
Publications depuis 2014 - Evaluation 2019
Articles de revues internationales
2018
- A probabilistic algorithm for verifying polynomial middle product in linear timePascal GiorgiInformation Processing Letters, Elsevier, 2018, 139, pp.30-34.
- Simultaneous conversions with the Residue Number System using linear algebraJavad Doliskani, Pascal Giorgi, Romain Lebreton, Éric SchostACM Transactions on Mathematical Software, Association for Computing Machinery, 2018, 44 (3), pp.#27.
2017
- Randomized Mixed-Radix Scalar MultiplicationEleonora Guerrini, Laurent Imbert, Théo WinterhalterIEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2017, In press. <10.1109/TC.2017.2750677>
2016
- GPU-Accelerated Generation of Correctly Rounded Elementary FunctionsPierre Fortin, Mourad Gouicem, Stef GraillatACM Transactions on Mathematical Software, Association for Computing Machinery, 2016, 43 (3), pp.22:1--22:26.
- Solving the Table Maker's Dilemma on Current SIMD ArchitecturesChristophe Avenel, Pierre Fortin, Mourad Gouicem, Zaidi SamiaScalable Computing : Practice and Experience, West University of Timisoara, 2016, 17 (3). <10.12694/scpe.v17i3.1183>
- Bounded-degree factors of lacunary multivariate polynomialsBruno GrenetJournal of Symbolic Computation, Elsevier, 2016, Special issue on the conference ISSAC 2014: Symbolic computation and computer algebra, 75, pp.171-192.
- On Optimal Nonlinear Systematic CodesEleonora Guerrini, Alessio Meneghetti, Massimiliano SalaIEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2016, 62 (6), pp.3103-3112.
- Deterministic root finding over finite fields using Graeffe transformsBruno Grenet, Joris Van Der Hoeven, Grégoire LecerfApplicable Algebra in Engineering, Communication and Computing, Springer Verlag, 2016, 27 (3), pp.237-257.
- A simple and fast online power series multiplication and its analysisRomain Lebreton, Éric SchostJournal of Symbolic Computation, Elsevier, 2016, 72, pp.231-251.
2015
- Lacunaryx: Computing bounded-degree factors of lacunary polynomialsBruno GrenetACM Communications in Computer Algebra, Association for Computing Machinery (ACM), 2015, Issue 194, 49 (4), pp.121-124.
- Relaxed Hensel lifting of triangular setsRomain LebretonJournal of Symbolic Computation, Elsevier, 2015, Effective Methods in Algebraic Geometry, 68, pp.230-258.
- Vertical and horizontal correlation attacks on RNS-based exponentiationsGuilherme Perin, Laurent Imbert, Philippe Maurine, Lionel TorresJournal of Cryptographic Engineering, Springer, 2015, 5 (3), pp.171-185.
2014
- On the maximal weight of (p,q)-ary chain partitions with bounded partsFilippo Disanto, Laurent Imbert, Fabrice PhilippeIntegers : Electronic Journal of Combinatorial Number Theory, State University of West Georgia, Charles University, and DIMATIA, 2014, 14, pp.A37.
- Some Bounds on the Size of CodesEmanuele Bellini, Eleonora Guerrini, Massimiliano SalaIEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2014, 60 (3), pp.1475-1480.
- Block Wiedemann algorithm on multicore architecturesBastien ViallaACM Communications in Computer Algebra, Association for Computing Machinery (ACM), 2014, 47 (3/4), pp.102 - 103.
- Relaxing order basis computationPascal Giorgi, Romain LebretonACM Communications in Computer Algebra, Association for Computing Machinery (ACM), 2014, 47 (3/4), pp.100-101.
Communications internationales
2018
- Certification of minimal approximant basesPascal Giorgi, Vincent NeigerISSAC: International Symposium on Symbolic and Algebraic Computation, Jul 2018, New York, United States. 43rd International Symposium on Symbolic and Algebraic Computation, pp.167-174, 2018.
2017
- Encryption Switching Protocols Revisited: Switching Modulo $p$Guilhem Castagnos, Laurent Imbert, Fabien LaguillaumieCRYPTO, Aug 2017, Santa Barbara, United States. 37th International Cryptology Conference, LNCS (10401), pp.255-287, 2017, Advances in Cryptology – CRYPTO 2017.
- Algorithms for structured linear systems solving and their implementationSeung Gyu Hyun, Romain Lebreton, Éric SchostISSAC: International Symposium on Symbolic and Algebraic Computation, Jul 2017, Kaiserslautern, Germany. 42nd International Symposium on Symbolic and Algebraic Computation, pp.205-212, 2017.
2016
- Recursive double-size fixed precision arithmeticAlexis Breust, Christophe Chabot, Jean-Guillaume Dumas, Laurent Fousse, Pascal GiorgiICMS: International Congress of Mathematical Software, Jul 2016, Berlin, Germany. 5th International Congress of Mathematical Software, LNCS (9725), pp.223--231, 2016, Mathematical Software.
2015
- Minimizing the number of bootstrappings in fully homomorphic encryptionMarie Paindavoine, Bastien ViallaSAC: Selected Areas in Cryptography, Aug 2015, Sackville, NB, Canada. 22nd International Conference on Selected Areas in Cryptography, LNCS (9566), pp.25-43, 2015, Revised Selected Papers.
- Parallel Algebraic Linear Algebra Dedicated InterfaceThierry Gautier, Jean-Louis Roch, Ziad Sultan, Bastien ViallaPASCO: International Workshop on Parallel Symbolic Computation, Jul 2015, Bath, United Kingdom. 7th International Workshop on Parallel Symbolic Computation, pp.34-43, 2015.
- Randomized Root Finding over Finite FFT-fields using Tangent Graeffe TransformsBruno Grenet, Joris Van Der Hoeven, Grégoire LecerfKazuhiro Yokoyama. ISSAC: International Symposium on Symbolic and Algebraic Computation, Jul 2015, Bath, United Kingdom. ACM, 40th International Symposium on Symbolic and Algebraic Computation, pp.197-204, 2015.
- Randomizing Scalar Multiplication using Exact Covering Systems of CongruencesLaurent ImbertExplicit Methods for Abelian Varieties: Kick-off Workshop, May 2015, Calgary, Canada. 2015. <https://www.pims.math.ca/scientific-event/150525-emavkw>
2014
- Generating Optimized Sparse Matrix Vector Product over Finite FieldsPascal Giorgi, Bastien ViallaHong, Hoon; Yap, Chee. ICMS: International Congress on Mathematical Software, Aug 2014, Séoul, South Korea. Springer Berlin Heidelberg, 4th International Congress on Mathematical Software, LNCS (8592), pp.685-690, 2014, Mathematical Software.
- Elements of Design for Containers and Solutions in the LinBox LibraryBrice Boyer, Jean-Guillaume Dumas, Pascal Giorgi, Clément Pernet, B. David SaundersHoon Hong; Chee Yap. ICMS: International Congress on Mathematical Software, Aug 2014, Seoul, South Korea. Springer, 4th International Congress of Mathematical Software, LNCS (8592), pp.654-662, 2014, Mathematical Software – ICMS 2014.
- Online order basis algorithm and its impact on the block Wiedemann algorithmPascal Giorgi, Romain LebretonISSAC: International Symposium on Symbolic and Algebraic Computation, Jul 2014, Kobe, Japan. ACM, 39th International Symposium on Symbolic and Algebraic Computation, pp.202-209, 2014.
- Proxy Re-Encryption Scheme Supporting a Selection of DelegateesJulien Devigne, Eleonora Guerrini, Fabien LaguillaumieAFRICACRYPT: Cryptology in Africa, May 2014, Marrakech, Morocco. 7th International Conference on Cryptology in Africa, LNCS (8469), pp.13-30, 2014, Progress in Cryptology – AFRICACRYPT 2014.
- Attacking Randomized Exponentiations Using Unsupervised LearningGuilherme Perin, Laurent Imbert, Lionel Torres, Philippe MaurineCOSADE: Constructive Side-Channel Analysis and Secure Design, Apr 2014, Paris, France. 5th International Workshop on Constructive Side-Channel Analysis and Secure Design, LNCS (8622), pp.144-160, 2014, Constructive Side-Channel Analysis and Secure Design.
Dernière mise à jour le 30/01/2019