Cryptographie et factorisation
Théorie analytique des nombres, Tome 2 (1985-1986), Exposé no. 10, 6 p. 
@article{TAN_1985-1986__2__A5_0,
     author = {Nicolas, Jean-Louis},
     title = {Cryptographie et factorisation},
     journal = {Th\'eorie analytique des nombres},
     note = {talk:10},
     pages = {1--6},
     year = {1985-1986},
     publisher = {Secr\'etariat math\'ematique},
     volume = {2},
     language = {fr},
     url = {https://www.numdam.org/item/TAN_1985-1986__2__A5_0/}
}
TY  - JOUR
AU  - Nicolas, Jean-Louis
TI  - Cryptographie et factorisation
JO  - Théorie analytique des nombres
N1  - talk:10
PY  - 1985-1986
SP  - 1
EP  - 6
VL  - 2
PB  - Secrétariat mathématique
UR  - https://www.numdam.org/item/TAN_1985-1986__2__A5_0/
LA  - fr
ID  - TAN_1985-1986__2__A5_0
ER  - 
%0 Journal Article
%A Nicolas, Jean-Louis
%T Cryptographie et factorisation
%J Théorie analytique des nombres
%Z talk:10
%D 1985-1986
%P 1-6
%V 2
%I Secrétariat mathématique
%U https://www.numdam.org/item/TAN_1985-1986__2__A5_0/
%G fr
%F TAN_1985-1986__2__A5_0
Nicolas, Jean-Louis. Cryptographie et factorisation. Théorie analytique des nombres, Tome 2 (1985-1986), Exposé no. 10, 6 p.. https://www.numdam.org/item/TAN_1985-1986__2__A5_0/

[Bri] Brillhart (J.), Lehmer (D.H.), Selfridge (J.-L.), Tuckerman (B.) and Wagstaff (S.S.). - Factorizations of bn ± 1 . - Providence, American mathematical Society, 1983 (Contemporary Mathematics, 22). | Zbl | MR

[De B] De Bruijn (N.G.). - On the number of positive integers ≤ x and free of prime factors > y , II, Koninkl. nederl. Akad. Wetensch., Proc., Series A, t. 69, 1966, p. 239-247 ; Indag. Math., t. 28, 1966, p. 239-247. | Zbl | MR

[Hil] Hildebrand (A.) and Tenenbaum (G.). - On integers free of large prime factors, Trans. Amer. math. Soc., t. 296, 1986, p. 265-290. | Zbl | MR

[Kon] Konheim (A.G.). - Cryptography. A primer. - New York, J. Wiley and Sons, 1981. | Zbl | MR

[Mey] Meyer (C.H.) and Matyas (S.M.). - Cryptography : A new dimension in computer data security. - New York, J. Wiley and Sons, 1982. | Zbl

[Odl] Odlyzko (A.M.). - Discrete logarithms in finite fields and their cryptographic significance, "Advances in cryptology", p. 224-314. - Berlin, Springer-Verlag (Lecture Notes in Computer Science, 209). | Zbl | MR

[Pom] Pomeramce (C.). - Analysis and comparison of soue integer factoring algorithms, "Computational methods in number theory", part 1, p. 89-139. - Amsterdam, Mathematisch Centrum, 1982 (Mathematical Centre Tracts, 154). | Zbl | MR

[Riv] Rivest (R.L.), Shamir (A.) and Adleman (L.). - A method for obtaining digital signatures and public-key cryptosystems, Communic. Assoc. comput. Mach., t. 21, 1978, p. 120-126. | Zbl | MR