Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Alexander Kruppa"'
Publikováno v:
Siberian Journal of Physics. 3:37-46
Publikováno v:
Mathematics of Computation
Mathematics of Computation, American Mathematical Society, 2016, 85, pp.12. ⟨10.1090/mcom3048⟩
Mathematics of Computation, 2016, 85, pp.12. ⟨10.1090/mcom3048⟩
Mathematics of Computation, American Mathematical Society, 2016, 85, pp.12. ⟨10.1090/mcom3048⟩
Mathematics of Computation, 2016, 85, pp.12. ⟨10.1090/mcom3048⟩
International audience; The general number field sieve (GNFS) is the most efficient algo-rithm known for factoring large integers. It consists of several stages, the first one being polynomial selection. The quality of the selected polynomials can be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::92eb27892d26a90164bce35ba8c4421c
https://hal.inria.fr/hal-01089507/file/sopt-20140905.pdf
https://hal.inria.fr/hal-01089507/file/sopt-20140905.pdf
Autor:
Pierrick Gaudry, Joppe W. Bos, Herman J. J. te Riele, Jens Franke, Andrey Timofeev, Dag Arne Osvik, Alexander Kruppa, Arjen K. Lenstra, Kazumaro Aoki, Emmanuel Thomé, Peter L. Montgomery, Paul Zimmermann, Thorsten Kleinjung
Publikováno v:
Advances in Cryptology--CRYPTO 2010
Annual Cryptology Conference
Advances in Cryptology – CRYPTO 2010
Advances in Cryptology – CRYPTO 2010, Aug 2010, Santa Barbara, United States. pp.333-350, ⟨10.1007/978-3-642-14623-7_18⟩
Advances in Cryptology – CRYPTO 2010 ISBN: 9783642146220
CRYPTO
Annual Cryptology Conference
Advances in Cryptology – CRYPTO 2010
Advances in Cryptology – CRYPTO 2010, Aug 2010, Santa Barbara, United States. pp.333-350, ⟨10.1007/978-3-642-14623-7_18⟩
Advances in Cryptology – CRYPTO 2010 ISBN: 9783642146220
CRYPTO
The original publication is available at www.springerlink.com; International audience; This paper reports on the factorization of the 768-bit number RSA-768 by the number field sieve factoring method and discusses some implications for RSA.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3115f2d8343da5d60c1a2c059e902881
https://hal.inria.fr/inria-00444693
https://hal.inria.fr/inria-00444693
Autor:
Peter L. Montgomery, Alexander Kruppa
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540794554
ANTS
8th International Symposium on Algorithmic Number Theory-ANTS-VIII
8th International Symposium on Algorithmic Number Theory-ANTS-VIII, May 2008, Waterloo, Canada. pp.180-195, ⟨10.1007/978-3-540-79456-1_12⟩
ANTS
8th International Symposium on Algorithmic Number Theory-ANTS-VIII
8th International Symposium on Algorithmic Number Theory-ANTS-VIII, May 2008, Waterloo, Canada. pp.180-195, ⟨10.1007/978-3-540-79456-1_12⟩
International audience; Some implementations of stage 2 of the P-1 method of factorization use convolutions. We describe a space-efficient implementation, allowing convolution lengths around 2^23 and stage 2 limit around 10^16 while attempting to fac
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4ea8b94f2bda1b7b3d3b3f298a03ea25
https://doi.org/10.1007/978-3-540-79456-1_12
https://doi.org/10.1007/978-3-540-79456-1_12
Publikováno v:
ISSAC
ISSAC 2007
ISSAC 2007, Jul 2007, Waterloo, Ontario, Canada. pp.167-174, ⟨10.1145/1277548.1277572⟩
ISSAC 2007
ISSAC 2007, Jul 2007, Waterloo, Ontario, Canada. pp.167-174, ⟨10.1145/1277548.1277572⟩
International audience; Schönhage-Strassen's algorithm is one of the best known algorithms for multiplying large integers. Implementing it efficiently is of utmost importance, since many other algorithms rely on it as a subroutine. We present here a
Publikováno v:
Journal of colloid and interface science. 177(1)
Pyrogenic silica (aerosil) was employed as host within which the phase transitions in the adsorbed pure water and binary H2O/HNO3films have been studied with NMR spectroscopy. The median freezing temperature and freezing temperature region were shown
Publikováno v:
Journal of Aerosol Science. 25:365-366