Hans Riesel

Pays :Suède
Langue :suédois
Note :
Écrit aussi en anglais
Mathématicien
ISNI :ISNI 0000 0001 1063 1533

Ses activités

Auteur du texte3 documents

  • Prime numbers and computer methods for factorization

    Description matérielle : XVI-464 p.
    Description : Note : Notes bibliogr. Index
    Édition : Boston ; Basel ; Stuttgart : Birkhäuser , [1987]

    disponible en Haut de Jardin

    [catalogue][http://catalogue.bnf.fr/ark:/12148/cb373702883]
  • Prime numbers and computer methods for factorization

    2nd ed.
    Description matérielle : XVI-464 p.
    Description : Note : Bibliogr. à la fin de chaque chap. Index. Tables
    Édition : Basel ; Boston : Birkhäuser , cop. 1994

    [catalogue][http://catalogue.bnf.fr/ark:/12148/cb37465205r]
  • Prime numbers and computer methods for factorization

    Description matérielle : 1 online resource
    Description : Note : Titre provenant de l'écran-titre
    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 of cryptography, and non-scientific readers with a mathematical inclination, treating four fundamental problems: the number of primes below a given limit, the approximate number of primes, the recognition of primes, and the factorization of large numbers. The second edition of the work, released in the mid 1990s, expanded significantly upon the original book, including important advances in computational prime number theory and factorization, as well as revised and updated tables. With explicit algorithms and computer programs, the author illustrated applications while attempting to discuss many classically important results along with more modern discoveries. Although it has been over a decade since the publication of this second edition, the theory it contained remains still highly relevant, and the particular cryptosystem it addressed (RSA public-key) is ubiquitous. Therefore, in addition to providing a historical perspective on many of the issues in modern prime number theory and data encryption, this soft cover version-which reproduces the second edition exactly as it originally appeared-offers affordable access to a great deal of valuable information. Highly readable for a wide variety of mathematicians, students of applied number theory, and others, this modern classic will be of interest to anyone involved in the study of number theory and cryptography. Reviews: Here is an outstanding technical monograph on recursive number theory and its numerous automated techniques. It successfully passes a critical milestone not allowed to many books, viz., a second edition... All in all, this handy volume continues to be an attractive combination of number-theoretic precision, practicality, and theory with a rich blend of computer science. -Zentralblatt MATH The book...is an enthusiastic introduction to some of the ideas concerned with primes and factorization. It should be of interest to anyone who would like to learn about the use of computers in number theory. -Mathematical Reviews
    Édition : Boston, MA : Birkhäuser Boston : Springer e-books : Imprint: Birkhäuser , 2012

    [catalogue][http://catalogue.bnf.fr/ark:/12148/cb44651887f]

Pages dans data.bnf.fr

Cette page dans l'atelier

Sources et références

Voir dans le catalogue général de la BnF

Sources de la notice

  • Documents de cet auteur : Prime numbers and computer methods for factorization / H. Riesel, 1985
  • Ouvrages de reference : LCNA 1977-1986
  • Catalogues de la BnF : BN Service scandinave

Biographie Wikipedia

  • Hans Ivar Riesel (né en 1929 à Stockholm) est un mathématicien suédois. Il est célèbre pour avoir trouvé en 1957 le dix-huitième nombre premier de Mersenne, demeuré jusqu'en 1961 le plus grand nombre premier connu. Il a également étudié et donné leur nom aux nombres de Riesel.

Pages équivalentes