Prime numbers

Results: 453



#Item
1Fast Generation of Prime Numbers on Portable Devices An Update Marc Joye Thomson Security Labs

Fast Generation of Prime Numbers on Portable Devices An Update Marc Joye Thomson Security Labs

Add to Reading List

Source URL: www.iacr.org

- Date: 2008-01-13 04:36:57
    2STRUCTURE AND RANDOMNESS IN THE PRIME NUMBERS TERENCE TAO Abstract. A quick tour through some topics in analytic prime number theory.

    STRUCTURE AND RANDOMNESS IN THE PRIME NUMBERS TERENCE TAO Abstract. A quick tour through some topics in analytic prime number theory.

    Add to Reading List

    Source URL: terrytao.files.wordpress.com

    - Date: 2009-09-14 06:37:41
      3PRIME NUMBERS AND THE RIEMANN HYPOTHESIS CARL ERICKSON This minicourse has two main goals. The first is to carefully define the Riemann zeta function and explain how it is connected with the prime numbers. The second is

      PRIME NUMBERS AND THE RIEMANN HYPOTHESIS CARL ERICKSON This minicourse has two main goals. The first is to carefully define the Riemann zeta function and explain how it is connected with the prime numbers. The second is

      Add to Reading List

      Source URL: www.math.harvard.edu

      - Date: 2013-01-14 17:19:10
        4´ AND THE DISTRIBUTION HARALD CRAMER OF PRIME NUMBERS∗ ANDREW GRANVILLE† IN ATHENS, GEORGIA, U.S.A. “It is evident that the primes are randomly distributed but, unfortunately, we don’t know what ‘random’ mea

        ´ AND THE DISTRIBUTION HARALD CRAMER OF PRIME NUMBERS∗ ANDREW GRANVILLE† IN ATHENS, GEORGIA, U.S.A. “It is evident that the primes are randomly distributed but, unfortunately, we don’t know what ‘random’ mea

        Add to Reading List

        Source URL: www.dartmouth.edu

        - Date: 2003-12-01 13:49:07
          5The Discrete Logarithm Problem Ren´e Schoof Abstract For large prime numbers p, computing discrete logarithms of elements of the multiplicative group (Z/pZ)∗ is at present a very difficult problem. The security of

          The Discrete Logarithm Problem Ren´e Schoof Abstract For large prime numbers p, computing discrete logarithms of elements of the multiplicative group (Z/pZ)∗ is at present a very difficult problem. The security of

          Add to Reading List

          Source URL: www.mat.uniroma2.it

          - Date: 2016-01-09 11:40:58
            6Indivisibility of class numbers of imaginary quadratic function fields Dongho Byeon Abstract. We show that for an odd prime number l, there are infinitely many imaginary quadratic extensions F over the rational function

            Indivisibility of class numbers of imaginary quadratic function fields Dongho Byeon Abstract. We show that for an odd prime number l, there are infinitely many imaginary quadratic extensions F over the rational function

            Add to Reading List

            Source URL: staff.miyakyo-u.ac.jp

            - Date: 2008-10-24 01:30:50
              7MATHEMATICS OF COMPUTATION SArticle electronically published on February 15, 2002 CLASS NUMBERS OF REAL CYCLOTOMIC FIELDS OF PRIME CONDUCTOR

              MATHEMATICS OF COMPUTATION SArticle electronically published on February 15, 2002 CLASS NUMBERS OF REAL CYCLOTOMIC FIELDS OF PRIME CONDUCTOR

              Add to Reading List

              Source URL: www.mat.uniroma2.it

              Language: English - Date: 2002-11-22 18:43:22
              8Numbers 69-70, R1

              Numbers 69-70, R1

              Add to Reading List

              Source URL: www.generalsemantics.org

              Language: English - Date: 2011-04-30 13:40:03
              9Mathematics Grade 6 Student Edition  G6 Playlist: Finding Greatest Common Factors and Least

              Mathematics Grade 6 Student Edition G6 Playlist: Finding Greatest Common Factors and Least

              Add to Reading List

              Source URL: www.wisewire.com

              Language: English - Date: 2016-06-25 15:44:59
              10SMOOTH NUMBERS AND THE QUADRATIC SIEVE Carl Pomerance When faced with a large number n to factor, what do you do first? You might say “Look at the last digit,” with the idea of cheaply pulling out possible factors of

              SMOOTH NUMBERS AND THE QUADRATIC SIEVE Carl Pomerance When faced with a large number n to factor, what do you do first? You might say “Look at the last digit,” with the idea of cheaply pulling out possible factors of

              Add to Reading List

              Source URL: www.mat.uniroma2.it

              Language: English - Date: 2007-11-23 17:17:47