AustralieFrV1, PascalFrancis, Curation, bibRecord, 000256

Factorization of a 512-bit RSA modulus

Identifieur interne : 000256 ( PascalFrancis/Curation ); précédent : 000255; suivant : 000257

Factorization of a 512-bit RSA modulus

Auteurs : S. Cavallar [Pays-Bas] ; B. Dodson [États-Unis] ; A. K. Lenstra [États-Unis] ; W. Lioen [Pays-Bas] ; P. L. Montgomery [États-Unis] ; B. Murphy [Australie] ; H. Te Riele [Pays-Bas] ; K. Aardal [Pays-Bas] ; J. Gilchrist [Canada] ; G. Guillerm [France] ; P. Leyland [Royaume-Uni] ; J. Marchand [France] ; F. Morain [France] ; A. Muffett [Royaume-Uni] ; C. Putman [États-Unis] ; C. Putnam [États-Unis] ; P. Zimmermann [France]

Source :

Lecture notes in computer science [ 0302-9743 ] ; 2000.

RBID : Pascal:00-0303889

Descripteurs français

Pascal (Inist)
- Informatique théorique, Arithmétique ordinateur, Méthode factorisation, Cryptographie.
Wicri :
- topic : Cryptographie.

English descriptors

KwdEn :
- Computer arithmetic, Computer theory, Cryptography, Factorization method.

Abstract

This paper reports on the factorization of the 512-bit number RSA-155 by the Number Field Sieve factoring method (NFS) and discusses the implications for RSA.

A01	`01`	`1`		`@0 0302-9743`
A05				`@2 1807`
A08	`01`	`1`	`ENG`	`@1 Factorization of a 512-bit RSA modulus`
A09	`01`	`1`	`ENG`	`@1 Advances in cryptology - EUROCRYPT 2000 : Bruges, 14-18 May 2000`
A11	`01`	`1`		`@1 CAVALLAR (S.)`
A11	`02`	`1`		`@1 DODSON (B.)`
A11	`03`	`1`		`@1 LENSTRA (A. K.)`
A11	`04`	`1`		`@1 LIOEN (W.)`
A11	`05`	`1`		`@1 MONTGOMERY (P. L.)`
A11	`06`	`1`		`@1 MURPHY (B.)`
A11	`07`	`1`		`@1 TE RIELE (H.)`
A11	`08`	`1`		`@1 AARDAL (K.)`
A11	`09`	`1`		`@1 GILCHRIST (J.)`
A11	`10`	`1`		`@1 GUILLERM (G.)`
A11	`11`	`1`		`@1 LEYLAND (P.)`
A11	`12`	`1`		`@1 MARCHAND (J.)`
A11	`13`	`1`		`@1 MORAIN (F.)`
A11	`14`	`1`		`@1 MUFFETT (A.)`
A11	`15`	`1`		`@1 PUTMAN (C.)`
A11	`16`	`1`		`@1 PUTNAM (C.)`
A11	`17`	`1`		`@1 ZIMMERMANN (P.)`
A12	`01`	`1`		`@1 PRENEEL (Bart) @9 ed.`
A14	`01`			`@1 CWI, P.O. Box 94079 @2 1090 GB Amsterdam @3 NLD @Z 1 aut. @Z 4 aut. @Z 7 aut.`
A14	`02`			`@1 Lehigh University @2 Bethlehem, PA @3 USA @Z 2 aut.`
A14	`03`			`@1 Citibank, 1 North Gate Road @2 Mendham, NJ 07945-3104 @3 USA @Z 3 aut.`
A14	`04`			`@1 780 Las Colindas Road, Microsoft Research and CWI, @2 San Rafael, CA 94903-2346 @3 USA @Z 5 aut.`
A14	`05`			`@1 Computer Sciences Laboratory, ANU @2 Canberra ACT 0200 @3 AUS @Z 6 aut.`
A14	`06`			`@1 Dept. of Computer Science, Utrecht University, P.O. Box 80089 @2 3508 TB Utrecht @3 NLD @Z 8 aut.`
A14	`07`			`@1 Entrust Technologies Ltd., 750 Heron Road, Suite E08 @2 Ottawa, ON, K1V 1A7 @3 CAN @Z 9 aut.`
A14	`08`			`@1 SITX (Centre of IT resources), École Polytechnique @2 Palaiseau @3 FRA @Z 10 aut.`
A14	`09`			`@1 Microsoft Research Ltd @2 Cambridge @3 GBR @Z 11 aut.`
A14	`10`			`@1 Laboratoire Gage, École Polytechnique/CNRS @2 Palaiseau @3 FRA @Z 12 aut.`
A14	`11`			`@1 Laboratoire d'Informatique, École Polytechnique @2 Palaiseau @3 FRA @Z 13 aut.`
A14	`12`			`@1 Sun Microsystems, Riverside Way @2 Watchmoor Park, Camberley @3 GBR @Z 14 aut.`
A14	`13`			`@2 59 Rangers Dr., Hudson, NH 03051 @3 USA @Z 15 aut. @Z 16 aut.`
A14	`14`			`@1 Inria Lorraine and Loria @2 Nancy @3 FRA @Z 17 aut.`
A20				`@1 1-18`
A21				`@1 2000`
A23	`01`			`@0 ENG`
A26	`01`			`@0 3-540-67517-5`
A43	`01`			`@1 INIST @2 16343 @5 354000087619760010`
A44				`@0 0000 @1 © 2000 INIST-CNRS. All rights reserved.`
A45				`@0 38 ref.`
A47	`01`	`1`		`@0 00-0303889`
A60				`@1 P @2 C`
A61				`@0 A`
A64	`01`	`1`		`@0 Lecture notes in computer science`
A66	`01`			`@0 DEU`
C01	`01`		`ENG`	`@0 This paper reports on the factorization of the 512-bit number RSA-155 by the Number Field Sieve factoring method (NFS) and discusses the implications for RSA.`
C02	`01`	`X`		`@0 001D02A05`
C02	`02`	`X`		`@0 001D04A04E`
C03	`01`	`X`	`FRE`	`@0 Informatique théorique @5 01`
C03	`01`	`X`	`ENG`	`@0 Computer theory @5 01`
C03	`01`	`X`	`SPA`	`@0 Informática teórica @5 01`
C03	`02`	`X`	`FRE`	`@0 Arithmétique ordinateur @5 02`
C03	`02`	`X`	`ENG`	`@0 Computer arithmetic @5 02`
C03	`02`	`X`	`SPA`	`@0 Aritmética ordenador @5 02`
C03	`03`	`X`	`FRE`	`@0 Méthode factorisation @5 03`
C03	`03`	`X`	`ENG`	`@0 Factorization method @5 03`
C03	`03`	`X`	`SPA`	`@0 Método factorización @5 03`
C03	`04`	`X`	`FRE`	`@0 Cryptographie @5 04`
C03	`04`	`X`	`ENG`	`@0 Cryptography @5 04`
C03	`04`	`X`	`SPA`	`@0 Criptografía @5 04`
N21				`@1 206`

A30	`01`	`1`	`ENG`	`@1 International conference on the theory and application of cryptographic techniques @3 Bruges BEL @4 2000-05-14`

Links toward previous steps (curation, corpus...)

to stream PascalFrancis, to step Corpus: Pour aller vers cette notice dans l'étape Curation :005F14

Links to Exploration step

Pascal:00-0303889

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Factorization of a 512-bit RSA modulus</title>
<author><name sortKey="Cavallar, S" sort="Cavallar, S" uniqKey="Cavallar S" first="S." last="Cavallar">S. Cavallar</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>CWI, P.O. Box 94079</s1>
<s2>1090 GB Amsterdam</s2>
<s3>NLD</s3>
<sZ>1 aut.</sZ>
<sZ>4 aut.</sZ>
<sZ>7 aut.</sZ>
</inist:fA14>
<country>Pays-Bas</country>
</affiliation>
</author>
<author><name sortKey="Dodson, B" sort="Dodson, B" uniqKey="Dodson B" first="B." last="Dodson">B. Dodson</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>Lehigh University</s1>
<s2>Bethlehem, PA</s2>
<s3>USA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>États-Unis</country>
</affiliation>
</author>
<author><name sortKey="Lenstra, A K" sort="Lenstra, A K" uniqKey="Lenstra A" first="A. K." last="Lenstra">A. K. Lenstra</name>
<affiliation wicri:level="1"><inist:fA14 i1="03"><s1>Citibank, 1 North Gate Road</s1>
<s2>Mendham, NJ 07945-3104</s2>
<s3>USA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>États-Unis</country>
</affiliation>
</author>
<author><name sortKey="Lioen, W" sort="Lioen, W" uniqKey="Lioen W" first="W." last="Lioen">W. Lioen</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>CWI, P.O. Box 94079</s1>
<s2>1090 GB Amsterdam</s2>
<s3>NLD</s3>
<sZ>1 aut.</sZ>
<sZ>4 aut.</sZ>
<sZ>7 aut.</sZ>
</inist:fA14>
<country>Pays-Bas</country>
</affiliation>
</author>
<author><name sortKey="Montgomery, P L" sort="Montgomery, P L" uniqKey="Montgomery P" first="P. L." last="Montgomery">P. L. Montgomery</name>
<affiliation wicri:level="1"><inist:fA14 i1="04"><s1>780 Las Colindas Road, Microsoft Research and CWI, </s1>
<s2>San Rafael, CA 94903-2346</s2>
<s3>USA</s3>
<sZ>5 aut.</sZ>
</inist:fA14>
<country>États-Unis</country>
</affiliation>
</author>
<author><name sortKey="Murphy, B" sort="Murphy, B" uniqKey="Murphy B" first="B." last="Murphy">B. Murphy</name>
<affiliation wicri:level="1"><inist:fA14 i1="05"><s1>Computer Sciences Laboratory, ANU</s1>
<s2>Canberra ACT 0200</s2>
<s3>AUS</s3>
<sZ>6 aut.</sZ>
</inist:fA14>
<country>Australie</country>
</affiliation>
</author>
<author><name sortKey="Te Riele, H" sort="Te Riele, H" uniqKey="Te Riele H" first="H." last="Te Riele">H. Te Riele</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>CWI, P.O. Box 94079</s1>
<s2>1090 GB Amsterdam</s2>
<s3>NLD</s3>
<sZ>1 aut.</sZ>
<sZ>4 aut.</sZ>
<sZ>7 aut.</sZ>
</inist:fA14>
<country>Pays-Bas</country>
</affiliation>
</author>
<author><name sortKey="Aardal, K" sort="Aardal, K" uniqKey="Aardal K" first="K." last="Aardal">K. Aardal</name>
<affiliation wicri:level="1"><inist:fA14 i1="06"><s1>Dept. of Computer Science, Utrecht University, P.O. Box 80089</s1>
<s2>3508 TB Utrecht</s2>
<s3>NLD</s3>
<sZ>8 aut.</sZ>
</inist:fA14>
<country>Pays-Bas</country>
</affiliation>
</author>
<author><name sortKey="Gilchrist, J" sort="Gilchrist, J" uniqKey="Gilchrist J" first="J." last="Gilchrist">J. Gilchrist</name>
<affiliation wicri:level="1"><inist:fA14 i1="07"><s1>Entrust Technologies Ltd., 750 Heron Road, Suite E08</s1>
<s2>Ottawa, ON, K1V 1A7</s2>
<s3>CAN</s3>
<sZ>9 aut.</sZ>
</inist:fA14>
<country>Canada</country>
</affiliation>
</author>
<author><name sortKey="Guillerm, G" sort="Guillerm, G" uniqKey="Guillerm G" first="G." last="Guillerm">G. Guillerm</name>
<affiliation wicri:level="1"><inist:fA14 i1="08"><s1>SITX (Centre of IT resources), École Polytechnique</s1>
<s2>Palaiseau</s2>
<s3>FRA</s3>
<sZ>10 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
<author><name sortKey="Leyland, P" sort="Leyland, P" uniqKey="Leyland P" first="P." last="Leyland">P. Leyland</name>
<affiliation wicri:level="1"><inist:fA14 i1="09"><s1>Microsoft Research Ltd</s1>
<s2>Cambridge</s2>
<s3>GBR</s3>
<sZ>11 aut.</sZ>
</inist:fA14>
<country>Royaume-Uni</country>
</affiliation>
</author>
<author><name sortKey="Marchand, J" sort="Marchand, J" uniqKey="Marchand J" first="J." last="Marchand">J. Marchand</name>
<affiliation wicri:level="1"><inist:fA14 i1="10"><s1>Laboratoire Gage, École Polytechnique/CNRS</s1>
<s2>Palaiseau</s2>
<s3>FRA</s3>
<sZ>12 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
<author><name sortKey="Morain, F" sort="Morain, F" uniqKey="Morain F" first="F." last="Morain">F. Morain</name>
<affiliation wicri:level="1"><inist:fA14 i1="11"><s1>Laboratoire d'Informatique, École Polytechnique</s1>
<s2>Palaiseau</s2>
<s3>FRA</s3>
<sZ>13 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
<author><name sortKey="Muffett, A" sort="Muffett, A" uniqKey="Muffett A" first="A." last="Muffett">A. Muffett</name>
<affiliation wicri:level="1"><inist:fA14 i1="12"><s1>Sun Microsystems, Riverside Way</s1>
<s2>Watchmoor Park, Camberley</s2>
<s3>GBR</s3>
<sZ>14 aut.</sZ>
</inist:fA14>
<country>Royaume-Uni</country>
</affiliation>
</author>
<author><name sortKey="Putman, C" sort="Putman, C" uniqKey="Putman C" first="C." last="Putman">C. Putman</name>
<affiliation wicri:level="1"><inist:fA14 i1="13"><s2>59 Rangers Dr., Hudson, NH 03051</s2>
<s3>USA</s3>
<sZ>15 aut.</sZ>
<sZ>16 aut.</sZ>
</inist:fA14>
<country>États-Unis</country>
</affiliation>
</author>
<author><name sortKey="Putnam, C" sort="Putnam, C" uniqKey="Putnam C" first="C." last="Putnam">C. Putnam</name>
<affiliation wicri:level="1"><inist:fA14 i1="13"><s2>59 Rangers Dr., Hudson, NH 03051</s2>
<s3>USA</s3>
<sZ>15 aut.</sZ>
<sZ>16 aut.</sZ>
</inist:fA14>
<country>États-Unis</country>
</affiliation>
</author>
<author><name sortKey="Zimmermann, P" sort="Zimmermann, P" uniqKey="Zimmermann P" first="P." last="Zimmermann">P. Zimmermann</name>
<affiliation wicri:level="1"><inist:fA14 i1="14"><s1>Inria Lorraine and Loria</s1>
<s2>Nancy</s2>
<s3>FRA</s3>
<sZ>17 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">00-0303889</idno>
<date when="2000">2000</date>
<idno type="stanalyst">PASCAL 00-0303889 INIST</idno>
<idno type="RBID">Pascal:00-0303889</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">005F14</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000256</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Factorization of a 512-bit RSA modulus</title>
<author><name sortKey="Cavallar, S" sort="Cavallar, S" uniqKey="Cavallar S" first="S." last="Cavallar">S. Cavallar</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>CWI, P.O. Box 94079</s1>
<s2>1090 GB Amsterdam</s2>
<s3>NLD</s3>
<sZ>1 aut.</sZ>
<sZ>4 aut.</sZ>
<sZ>7 aut.</sZ>
</inist:fA14>
<country>Pays-Bas</country>
</affiliation>
</author>
<author><name sortKey="Dodson, B" sort="Dodson, B" uniqKey="Dodson B" first="B." last="Dodson">B. Dodson</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>Lehigh University</s1>
<s2>Bethlehem, PA</s2>
<s3>USA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>États-Unis</country>
</affiliation>
</author>
<author><name sortKey="Lenstra, A K" sort="Lenstra, A K" uniqKey="Lenstra A" first="A. K." last="Lenstra">A. K. Lenstra</name>
<affiliation wicri:level="1"><inist:fA14 i1="03"><s1>Citibank, 1 North Gate Road</s1>
<s2>Mendham, NJ 07945-3104</s2>
<s3>USA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>États-Unis</country>
</affiliation>
</author>
<author><name sortKey="Lioen, W" sort="Lioen, W" uniqKey="Lioen W" first="W." last="Lioen">W. Lioen</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>CWI, P.O. Box 94079</s1>
<s2>1090 GB Amsterdam</s2>
<s3>NLD</s3>
<sZ>1 aut.</sZ>
<sZ>4 aut.</sZ>
<sZ>7 aut.</sZ>
</inist:fA14>
<country>Pays-Bas</country>
</affiliation>
</author>
<author><name sortKey="Montgomery, P L" sort="Montgomery, P L" uniqKey="Montgomery P" first="P. L." last="Montgomery">P. L. Montgomery</name>
<affiliation wicri:level="1"><inist:fA14 i1="04"><s1>780 Las Colindas Road, Microsoft Research and CWI, </s1>
<s2>San Rafael, CA 94903-2346</s2>
<s3>USA</s3>
<sZ>5 aut.</sZ>
</inist:fA14>
<country>États-Unis</country>
</affiliation>
</author>
<author><name sortKey="Murphy, B" sort="Murphy, B" uniqKey="Murphy B" first="B." last="Murphy">B. Murphy</name>
<affiliation wicri:level="1"><inist:fA14 i1="05"><s1>Computer Sciences Laboratory, ANU</s1>
<s2>Canberra ACT 0200</s2>
<s3>AUS</s3>
<sZ>6 aut.</sZ>
</inist:fA14>
<country>Australie</country>
</affiliation>
</author>
<author><name sortKey="Te Riele, H" sort="Te Riele, H" uniqKey="Te Riele H" first="H." last="Te Riele">H. Te Riele</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>CWI, P.O. Box 94079</s1>
<s2>1090 GB Amsterdam</s2>
<s3>NLD</s3>
<sZ>1 aut.</sZ>
<sZ>4 aut.</sZ>
<sZ>7 aut.</sZ>
</inist:fA14>
<country>Pays-Bas</country>
</affiliation>
</author>
<author><name sortKey="Aardal, K" sort="Aardal, K" uniqKey="Aardal K" first="K." last="Aardal">K. Aardal</name>
<affiliation wicri:level="1"><inist:fA14 i1="06"><s1>Dept. of Computer Science, Utrecht University, P.O. Box 80089</s1>
<s2>3508 TB Utrecht</s2>
<s3>NLD</s3>
<sZ>8 aut.</sZ>
</inist:fA14>
<country>Pays-Bas</country>
</affiliation>
</author>
<author><name sortKey="Gilchrist, J" sort="Gilchrist, J" uniqKey="Gilchrist J" first="J." last="Gilchrist">J. Gilchrist</name>
<affiliation wicri:level="1"><inist:fA14 i1="07"><s1>Entrust Technologies Ltd., 750 Heron Road, Suite E08</s1>
<s2>Ottawa, ON, K1V 1A7</s2>
<s3>CAN</s3>
<sZ>9 aut.</sZ>
</inist:fA14>
<country>Canada</country>
</affiliation>
</author>
<author><name sortKey="Guillerm, G" sort="Guillerm, G" uniqKey="Guillerm G" first="G." last="Guillerm">G. Guillerm</name>
<affiliation wicri:level="1"><inist:fA14 i1="08"><s1>SITX (Centre of IT resources), École Polytechnique</s1>
<s2>Palaiseau</s2>
<s3>FRA</s3>
<sZ>10 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
<author><name sortKey="Leyland, P" sort="Leyland, P" uniqKey="Leyland P" first="P." last="Leyland">P. Leyland</name>
<affiliation wicri:level="1"><inist:fA14 i1="09"><s1>Microsoft Research Ltd</s1>
<s2>Cambridge</s2>
<s3>GBR</s3>
<sZ>11 aut.</sZ>
</inist:fA14>
<country>Royaume-Uni</country>
</affiliation>
</author>
<author><name sortKey="Marchand, J" sort="Marchand, J" uniqKey="Marchand J" first="J." last="Marchand">J. Marchand</name>
<affiliation wicri:level="1"><inist:fA14 i1="10"><s1>Laboratoire Gage, École Polytechnique/CNRS</s1>
<s2>Palaiseau</s2>
<s3>FRA</s3>
<sZ>12 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
<author><name sortKey="Morain, F" sort="Morain, F" uniqKey="Morain F" first="F." last="Morain">F. Morain</name>
<affiliation wicri:level="1"><inist:fA14 i1="11"><s1>Laboratoire d'Informatique, École Polytechnique</s1>
<s2>Palaiseau</s2>
<s3>FRA</s3>
<sZ>13 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
<author><name sortKey="Muffett, A" sort="Muffett, A" uniqKey="Muffett A" first="A." last="Muffett">A. Muffett</name>
<affiliation wicri:level="1"><inist:fA14 i1="12"><s1>Sun Microsystems, Riverside Way</s1>
<s2>Watchmoor Park, Camberley</s2>
<s3>GBR</s3>
<sZ>14 aut.</sZ>
</inist:fA14>
<country>Royaume-Uni</country>
</affiliation>
</author>
<author><name sortKey="Putman, C" sort="Putman, C" uniqKey="Putman C" first="C." last="Putman">C. Putman</name>
<affiliation wicri:level="1"><inist:fA14 i1="13"><s2>59 Rangers Dr., Hudson, NH 03051</s2>
<s3>USA</s3>
<sZ>15 aut.</sZ>
<sZ>16 aut.</sZ>
</inist:fA14>
<country>États-Unis</country>
</affiliation>
</author>
<author><name sortKey="Putnam, C" sort="Putnam, C" uniqKey="Putnam C" first="C." last="Putnam">C. Putnam</name>
<affiliation wicri:level="1"><inist:fA14 i1="13"><s2>59 Rangers Dr., Hudson, NH 03051</s2>
<s3>USA</s3>
<sZ>15 aut.</sZ>
<sZ>16 aut.</sZ>
</inist:fA14>
<country>États-Unis</country>
</affiliation>
</author>
<author><name sortKey="Zimmermann, P" sort="Zimmermann, P" uniqKey="Zimmermann P" first="P." last="Zimmermann">P. Zimmermann</name>
<affiliation wicri:level="1"><inist:fA14 i1="14"><s1>Inria Lorraine and Loria</s1>
<s2>Nancy</s2>
<s3>FRA</s3>
<sZ>17 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="2000">2000</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Computer arithmetic</term>
<term>Computer theory</term>
<term>Cryptography</term>
<term>Factorization method</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Informatique théorique</term>
<term>Arithmétique ordinateur</term>
<term>Méthode factorisation</term>
<term>Cryptographie</term>
</keywords>
<keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Cryptographie</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">This paper reports on the factorization of the 512-bit number RSA-155 by the Number Field Sieve factoring method (NFS) and discusses the implications for RSA.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01>
<fA05><s2>1807</s2>
</fA05>
<fA08 i1="01" i2="1" l="ENG"><s1>Factorization of a 512-bit RSA modulus</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>Advances in cryptology - EUROCRYPT 2000 : Bruges, 14-18 May 2000</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>CAVALLAR (S.)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>DODSON (B.)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>LENSTRA (A. K.)</s1>
</fA11>
<fA11 i1="04" i2="1"><s1>LIOEN (W.)</s1>
</fA11>
<fA11 i1="05" i2="1"><s1>MONTGOMERY (P. L.)</s1>
</fA11>
<fA11 i1="06" i2="1"><s1>MURPHY (B.)</s1>
</fA11>
<fA11 i1="07" i2="1"><s1>TE RIELE (H.)</s1>
</fA11>
<fA11 i1="08" i2="1"><s1>AARDAL (K.)</s1>
</fA11>
<fA11 i1="09" i2="1"><s1>GILCHRIST (J.)</s1>
</fA11>
<fA11 i1="10" i2="1"><s1>GUILLERM (G.)</s1>
</fA11>
<fA11 i1="11" i2="1"><s1>LEYLAND (P.)</s1>
</fA11>
<fA11 i1="12" i2="1"><s1>MARCHAND (J.)</s1>
</fA11>
<fA11 i1="13" i2="1"><s1>MORAIN (F.)</s1>
</fA11>
<fA11 i1="14" i2="1"><s1>MUFFETT (A.)</s1>
</fA11>
<fA11 i1="15" i2="1"><s1>PUTMAN (C.)</s1>
</fA11>
<fA11 i1="16" i2="1"><s1>PUTNAM (C.)</s1>
</fA11>
<fA11 i1="17" i2="1"><s1>ZIMMERMANN (P.)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>PRENEEL (Bart)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>CWI, P.O. Box 94079</s1>
<s2>1090 GB Amsterdam</s2>
<s3>NLD</s3>
<sZ>1 aut.</sZ>
<sZ>4 aut.</sZ>
<sZ>7 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>Lehigh University</s1>
<s2>Bethlehem, PA</s2>
<s3>USA</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA14 i1="03"><s1>Citibank, 1 North Gate Road</s1>
<s2>Mendham, NJ 07945-3104</s2>
<s3>USA</s3>
<sZ>3 aut.</sZ>
</fA14>
<fA14 i1="04"><s1>780 Las Colindas Road, Microsoft Research and CWI, </s1>
<s2>San Rafael, CA 94903-2346</s2>
<s3>USA</s3>
<sZ>5 aut.</sZ>
</fA14>
<fA14 i1="05"><s1>Computer Sciences Laboratory, ANU</s1>
<s2>Canberra ACT 0200</s2>
<s3>AUS</s3>
<sZ>6 aut.</sZ>
</fA14>
<fA14 i1="06"><s1>Dept. of Computer Science, Utrecht University, P.O. Box 80089</s1>
<s2>3508 TB Utrecht</s2>
<s3>NLD</s3>
<sZ>8 aut.</sZ>
</fA14>
<fA14 i1="07"><s1>Entrust Technologies Ltd., 750 Heron Road, Suite E08</s1>
<s2>Ottawa, ON, K1V 1A7</s2>
<s3>CAN</s3>
<sZ>9 aut.</sZ>
</fA14>
<fA14 i1="08"><s1>SITX (Centre of IT resources), École Polytechnique</s1>
<s2>Palaiseau</s2>
<s3>FRA</s3>
<sZ>10 aut.</sZ>
</fA14>
<fA14 i1="09"><s1>Microsoft Research Ltd</s1>
<s2>Cambridge</s2>
<s3>GBR</s3>
<sZ>11 aut.</sZ>
</fA14>
<fA14 i1="10"><s1>Laboratoire Gage, École Polytechnique/CNRS</s1>
<s2>Palaiseau</s2>
<s3>FRA</s3>
<sZ>12 aut.</sZ>
</fA14>
<fA14 i1="11"><s1>Laboratoire d'Informatique, École Polytechnique</s1>
<s2>Palaiseau</s2>
<s3>FRA</s3>
<sZ>13 aut.</sZ>
</fA14>
<fA14 i1="12"><s1>Sun Microsystems, Riverside Way</s1>
<s2>Watchmoor Park, Camberley</s2>
<s3>GBR</s3>
<sZ>14 aut.</sZ>
</fA14>
<fA14 i1="13"><s2>59 Rangers Dr., Hudson, NH 03051</s2>
<s3>USA</s3>
<sZ>15 aut.</sZ>
<sZ>16 aut.</sZ>
</fA14>
<fA14 i1="14"><s1>Inria Lorraine and Loria</s1>
<s2>Nancy</s2>
<s3>FRA</s3>
<sZ>17 aut.</sZ>
</fA14>
<fA20><s1>1-18</s1>
</fA20>
<fA21><s1>2000</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA26 i1="01"><s0>3-540-67517-5</s0>
</fA26>
<fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000087619760010</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2000 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>38 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>00-0303889</s0>
</fA47>
<fA60><s1>P</s1>
<s2>C</s2>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>Lecture notes in computer science</s0>
</fA64>
<fA66 i1="01"><s0>DEU</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>This paper reports on the factorization of the 512-bit number RSA-155 by the Number Field Sieve factoring method (NFS) and discusses the implications for RSA.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02A05</s0>
</fC02>
<fC02 i1="02" i2="X"><s0>001D04A04E</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Informatique théorique</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Computer theory</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Informática teórica</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Arithmétique ordinateur</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Computer arithmetic</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Aritmética ordenador</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Méthode factorisation</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Factorization method</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Método factorización</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Cryptographie</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Cryptography</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Criptografía</s0>
<s5>04</s5>
</fC03>
<fN21><s1>206</s1>
</fN21>
</pA>
<pR><fA30 i1="01" i2="1" l="ENG"><s1>International conference on the theory and application of cryptographic techniques</s1>
<s3>Bruges BEL</s3>
<s4>2000-05-14</s4>
</fA30>
</pR>
</standard>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Asie/explor/AustralieFrV1/Data/PascalFrancis/Curation

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000256 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Curation/biblio.hfd -nk 000256 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Asie
   |area=    AustralieFrV1
   |flux=    PascalFrancis
   |étape=   Curation
   |type=    RBID
   |clé=     Pascal:00-0303889
   |texte=   Factorization of a 512-bit RSA modulus
}}

This area was generated with Dilib version V0.6.33.
Data generation: Tue Dec 5 10:43:12 2017. Site generation: Tue Mar 5 14:07:20 2024

	Serveur d'exploration sur les relations entre la France et l'Australie
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur les relations entre la France et l'Australie

Factorization of a 512-bit RSA modulus

Factorization of a 512-bit RSA modulus

Source :

Descripteurs français

English descriptors

Abstract

Links toward previous steps (curation, corpus...)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri