 |
| | Suchergebnis | | | | | | | | | © | |
|
| | | |||||||||||||
|
 |
Suchgeschichte |  |
| |
|
Kurzliste | |
| |
|
Detailanzeige | |
|
|
|
|
|
|
|
|
||||||||||
|
|
|||||
______________ | ||||||
|
|
|
|||
|
1 - 6 von 6 |
| ||
 |
Ihre Aktion | Suchen (Schlagwörter GND (Phrase) (XSP)) factorization mathematics eingrenzen (Basisklassifikation (XBKL)) 31.14 |
||
| |
| |
| |
|
|
|
|
 |
1. |
Number theoretic methods in cryptography : complexity lower bounds Sparlinski, Igor E.. - Basel : Birkhäuser, 1999 |
|
| |||
|
2. |
Édouard Lucas and primality testing Williams, Hugh C.. - New York : Wiley, 1998 |
|
| |||
|
3. |
Prime numbers and computer methods for factorization Riesel, Hans. - 2. ed. - Boston : Birkhäuser, 1994 |
|
| |||
|
4. |
The development of the number field sieve Lenstra, Arjen K.. - Berlin : Springer, 1993 |
|
| |||
|
5. |
Factorization and primality testing Bressoud, David M. *1950-*. - New York : Springer, 1989 |
|
| |||
|
6. |
Prime numbers and computer methods for factorization Riesel, Hans. - Boston [u.a.] : Birkhäuser, 1985 |
|
| |||
| |||||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||||
|
1 - 6 von 6 |
|
|
|
1 - 6 von 6 |
|
|||||||||||||||||||||||||