International Association for Cryptologic Research

International Association
for Cryptologic Research

IACR Local Search

Possible queries include homomorphic author:david.
Found 3000 results
Mersenne Factorization Factory
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=27490
Thorsten Kleinjung Joppe W. Bos Arjen K. Lenstra
Asiacrypt 2014
Mersenne factorization factory
Eprint
https://eprint.iacr.org/2014/653
Thorsten Kleinjung Joppe W. Bos Arjen K. Lenstra
We present work in progress to fully factor seventeen Mersenne numbers using a variant of the special number field sieve where sieving on the algebraic side is shared among the numbers. It is expected that it reduces the...
last revised 12 Jan 2015
Efficient SIMD arithmetic modulo a Mersenne number
Eprint
https://eprint.iacr.org/2010/338
Joppe W. Bos Thorsten Kleinjung Arjen K. Lenstra Peter L. Montgomery
This paper describes carry-less arithmetic operations modulo an integer $2^M - 1$ in the thousand-bit range, targeted at single instruction multiple data platforms and applications where overall throughput is the main...
last revised 23 Nov 2010
Factorization of a 768-Bit RSA Modulus
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=23928
Thorsten Kleinjung Kazumaro Aoki Jens Franke Arjen K. Lenstra Emmanuel Thomé Joppe W. Bos Pierrick Gaudry Alexander Kruppa Peter L. Montgomery Dag Arne Osvik Herman J. J. te Riele Andrey Timofeev Paul Zimmermann
Crypto 2010
Public Keys
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=24287
Arjen K. Lenstra James P. Hughes Maxime Augier Joppe W. Bos Thorsten Kleinjung Christophe Wachter
Crypto 2012
Cofactorization on Graphics Processing Units
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=27520
Andrea Miele Joppe W. Bos Thorsten Kleinjung Arjen K. Lenstra
Ches 2014
Factorization of a 768-bit RSA modulus
Eprint
https://eprint.iacr.org/2010/006
Thorsten Kleinjung Kazumaro Aoki Jens Franke Arjen Lenstra Emmanuel Thomé Joppe Bos Pierrick Gaudry Alexander Kruppa Peter Montgomery Dag Arne Osvik Herman te Riele Andrey Timofeev Paul Zimmermann
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.
last revised 18 Feb 2010
CRYPTO 2012
https://iacr.org/conferences/crypto2012/abstracts/session11-2.html
CRYPTO 2012 Aug 19 – 23 Santa Barbara California USA CRYPTO 2012 Home > Public Keys Arjen K. Lenstra (EPFL, Switzerland ) James P. Hughes (Self, Palo Alto ) Maxime Augier (EPFL, Switzerland ) Joppe W. Bos (EPFL, Switzerland )...
Cofactorization on Graphics Processing Units
Eprint
https://eprint.iacr.org/2014/397
Andrea Miele Joppe W. Bos Thorsten Kleinjung Arjen K. Lenstra
We show how the cofactorization step, a compute-intensive part of the relation collection phase of the number field sieve (NFS), can be farmed out to a graphics processing unit. Our implementation on a GTX 580 GPU, which is...
last revised 28 Jan 2015
A kilobit special number field sieve factorization
Eprint
https://eprint.iacr.org/2007/205
Kazumaro Aoki Jens Franke Thorsten Kleinjung Arjen Lenstra Dag Arne Osvik
We describe how we reached a new factoring milestone by completing the first special number field sieve factorization of a number having more than 1024 bits, namely the Mersenne number $2^{1039}-1$. Although this factorization...
received 31 May 2007
On the Security of 1024-bit RSA and 160-bit Elliptic Curve Cryptography
Eprint
https://eprint.iacr.org/2009/389
Joppe W. Bos Marcelo E. Kaihara Thorsten Kleinjung Arjen K. Lenstra Peter L. Montgomery
Meeting the requirements of NIST’s new cryptographic standards means phasing out usage of 1024-bit RSA and 160-bit elliptic curve cryptography (ECC) by the end of the year 2010. This write-up comments on the vulnerability of...
last revised 1 Sep 2009
A Kilobit Special Number Field Sieve Factorization
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=506
Kazumaro Aoki Jens Franke Thorsten Kleinjung Arjen K. Lenstra Dag Arne Osvik
Asiacrypt 2007
Ron was wrong, Whit is right
Eprint
https://eprint.iacr.org/2012/064
Arjen K. Lenstra James P. Hughes Maxime Augier Joppe W. Bos Thorsten Kleinjung Christophe Wachter
We performed a sanity check of public keys collected on the web. Our main goal was to test the validity of the assumption that different random choices are made each time keys are generated. We found that the vast majority of...
last revised 17 Feb 2012
Author Index, IACR CRYPTO 2012
https://iacr.org/archive/crypto2012/authors.html
Author Index, IACR CRYPTO 2012 Abdelraheem, Mohamed Ahmed, 51 Agrawal, Shweta, 437 Alwen, Joel, 124 Ågren, Martin, 51 Augier, Maxime, 620 Bardou, Romain, 602 Bay, Asli, 734 Beelen, Peter, 51 Bellare, Mihir, 292 , 310...
General purpose integer factoring
Eprint
https://eprint.iacr.org/2017/1087
Arjen K. Lenstra
This chapter describes the developments since 1970 in general purpose integer factoring and highlights the contributions of Peter L. Montgomery. This article appeared as Chapter 5 of the book "Topics in Computational Number...
last revised 9 Nov 2017
Parametrizations for Families of ECM-friendly curves
Eprint
https://eprint.iacr.org/2016/1092
Alexandre Gélin Thorsten Kleinjung Arjen K. Lenstra
We provide a new family of elliptic curves that results in a one to two percent performance improvement of the elliptic curve integer factorization method. The speedup is confirmed by extensive tests for factors ranging from...
last revised 11 Jun 2018
IACR ASIACRYPT 2014
https://iacr.org/archive/asiacrypt2014/asiacrypt2014-index.html
ASIACRYPT 2014: Palash Sarkar and Tetsu Iwata (Eds.): Advances in Cryptology - ASIACRYPT 2014 20th International Conference on the Theory and Application of Cryptology and Information Security Kaoshiung, Taiwan, R.O.C.,...
Cryptographic Pairings
Eprint
https://eprint.iacr.org/2017/1108
Kristin Lauter Michael Naehrig
This article appeared as Chapter 9 of the book "Topics in Computational Number Theory inspired by Peter L. Montgomery", edited by Joppe W. Bos and Arjen K. Lenstra and published by Cambridge University Press. See...
last revised 13 Nov 2017
IACR CHES 2009, External Reviewers
https://iacr.org/archive/ches2009/external.html
IACR CHES 2009, External Reviewers Onur Aciicmez Guido Costa Souza de Araújo Kubilay Atasu Alain Aubert Maxime Augier Jean-Claude Bajard Brian Baldwin Alessandro Barenghi Florent Bernard Alex Biryukov Andrey Bogdanov Simone...
Finding ECM-Friendly Curves through a Study of Galois Properties
Eprint
https://eprint.iacr.org/2012/070
Razvan Barbulescu Joppe W. Bos Cyril Bouvier Thorsten Kleinjung Peter L. Montgomery
In this paper we prove some divisibility properties of the cardinality of elliptic curves modulo primes. These proofs explain the good behavior of certain parameters when using Montgomery or Edwards curves in the setting of...
received 17 Feb 2012
Next ►