.:. Consultation > Liste par discipline > Arithmétique des ordinateurs .:.

14 documents classés par : Date Titre Nom du premier auteur Type de documents Date de dépôt

1 - 2

Théorie algorithmique des nombres et applications à la cryptanalyse de primitives cryptographiques Thomé E. Université de Lorraine (13/12/2012), Jean-Yves Marion (Pr.) [tel-00765982 - version 2]

Finding ECM-friendly curves through a study of Galois properties Barbulescu R., Bos J. W., Bouvier C., Kleinjung T., Montgomery P. L. Dans ANTS-X 10th Algorithmic Number Theory Symposium - 2012 (2012) [hal-00671948 - version 2]

The functions erf and erfc computed with arbitrary precision and explicit error bounds Chevillard S. Information and Computation 216 (2012) 72 -- 95 [ensl-00356709 - version 3]

Multi-precision computation of the complex error function Molin P. (03/2011) [hal-00580855 - version 1]

Fast architectures for the $\eta_T$ pairing over small-characteristic supersingular elliptic curves Beuchat J.-L., Detrey J., Estibals N., Okamoto E., Rodríguez-Henríquez F. IEEE Transactions on Computers 60, 2 (2011) 266-281 [inria-00424016 - version 2]

Efficient and accurate computation of upper bounds of approximation errors Chevillard S., Harrison J., Joldes M. Maria, Lauter C. Journal of Theoretical Computer Science (TCS) 412, 16 (2011) 1523-1543 [ensl-00445343 - version 2]

Evaluating a constant expression in multiple precision with a guaranteed error bound Chevillard S. N° RR-7443 (2010) [inria-00537935 - version 1]

Sollya: an environment for the development of numerical codes Chevillard S., Joldes M. Maria, Lauter C. In Third International Congress on Mathematical Software - ICMS 2010 6327 (2010) 28 -- 31 [hal-00761644 - version 1]

Hardware Accelerator for the Tate Pairing in Characteristic Three Based on Karatsuba-Ofman Multipliers Beuchat J.-L., Detrey J., Estibals N., Okamoto E., Rodríguez-Henríquez F. Dans 11th International Workshop on Cryptographic Hardware and Embedded Systems - CHES 2009 5747 (2009) 225-239 [inria-00424011 - version 1]

Improved Stage 2 to P$\pm$1 Factoring Algorithms Montgomery P. L., Kruppa A. Dans 8th International Symposium on Algorithmic Number Theory - ANTS-VIII 5011 (2008) 180-195 [inria-00188192 - version 3]