Prime Numbers and Computer Methods for Factorization
Published in the mid 1980s, the highly successful first edition of this title investigated the mathematical underpinnings of computer encryption, a discipline drawing heavily on the factorization of large numbers into primes. The book served a broad audience of researchers, students, practitioners o...
Κύριος συγγραφέας: | Riesel, Hans (Συγγραφέας) |
---|---|
Συγγραφή απο Οργανισμό/Αρχή: | SpringerLink (Online service) |
Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
Γλώσσα: | English |
Έκδοση: |
Boston, MA :
Birkhäuser Boston : Imprint: Birkhäuser,
2012.
|
Σειρά: | Modern Birkhäuser Classics
|
Θέματα: | |
Διαθέσιμο Online: | Full Text via HEAL-Link |
Παρόμοια τεκμήρια
-
Algorithmic Number Theory 7th International Symposium, ANTS-VII, Berlin, Germany, July 23-28, 2006. Proceedings /
Έκδοση: (2006) -
Algorithmic Number Theory 6th International Symposium, ANTS-VI, Burlington, VT, USA, June 13-18, 2004, Proceedings /
Έκδοση: (2004) -
Post-Quantum Cryptography
Έκδοση: (2009) -
Primality Testing in Polynomial Time From Randomized Algorithms to "PRIMES Is in P" /
ανά: Dietzfelbinger, Martin
Έκδοση: (2004) -
Introduction to Modern Number Theory Fundamental Problems, Ideas and Theories /
ανά: Manin, Yuri Ivanovic, κ.ά.
Έκδοση: (2005)