Skip to content
Snippets Groups Projects
Select Git revision
  • a34e99e3b56a73c7f87e6dec5ab90d659b8cbe7c
  • master default
  • support_pre_UAL_arm_asm
  • skein
  • rsa-crt-hardening
  • chacha96
  • fat-library
  • versioned-symbols
  • curve25519
  • dsa-reorg
  • aead-api
  • set_key-changes
  • poly1305
  • aes-reorg
  • nettle-2.7-fixes
  • size_t-changes
  • ecc-support
  • experimental-20050201
  • lsh-1.4.2
  • nettle_3.3_release_20161001
  • nettle_3.2_release_20160128
  • nettle_3.1.1_release_20150424
  • nettle_3.1_release_20150407
  • nettle_3.1rc3
  • nettle_3.1rc2
  • nettle_3.1rc1
  • nettle_3.0_release_20140607
  • nettle_2.7.1_release_20130528
  • nettle_2.7_release_20130424
  • nettle_2.6_release_20130116
  • nettle_2.5_release_20120707
  • converted-master-branch-to-git
  • nettle_2.4_release_20110903
  • nettle_2.3_release_20110902
  • nettle_2.2_release_20110711
  • nettle_2.1_release_20100725
  • camellia_32bit_20100720
  • nettle_2.0_release_20090608
  • nettle_1.15_release_20061128
39 results

bignum-next-prime.c

Blame
  • Forked from Nettle / nettle
    Source project has a limited visibility.
    bignum-next-prime.c 4.08 KiB
    /* bignum-next-prime.c
     *
     */
    
    /* nettle, low-level cryptographics library
     *
     * Copyright (C) 2002 Niels Mller
     *  
     * The nettle library is free software; you can redistribute it and/or modify
     * it under the terms of the GNU Lesser General Public License as published by
     * the Free Software Foundation; either version 2.1 of the License, or (at your
     * option) any later version.
     * 
     * The nettle library is distributed in the hope that it will be useful, but
     * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
     * or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU Lesser General Public
     * License for more details.
     * 
     * You should have received a copy of the GNU Lesser General Public License
     * along with the nettle library; see the file COPYING.LIB.  If not, write to
     * the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
     * MA 02111-1307, USA.
     */
    
    #if HAVE_CONFIG_H
    # include "config.h"
    #endif
    
    #include <limits.h>
    /* Needed for alloca on freebsd */
    #include <stdlib.h>
    
    #include "bignum.h"
    
    #include "nettle-internal.h"
    
    /* From gmp.h */
    /* Test for gcc >= maj.min, as per __GNUC_PREREQ in glibc */
    #if defined (__GNUC__) && defined (__GNUC_MINOR__)
    #define GNUC_PREREQ(maj, min) \
      ((__GNUC__ << 16) + __GNUC_MINOR__ >= ((maj) << 16) + (min))
    #else
    #define GNUC_PREREQ(maj, min)  0
    #endif
    
    #if GNUC_PREREQ (3,0)
    # define UNLIKELY(cond) __builtin_expect ((cond) != 0, 0)
    #else
    # define UNLIKELY(cond) cond
    #endif
    
    /* From some benchmarking using the examples nextprime(200!) and
       nextprime(240!), it seems that it pays off to use a prime list up
       to around 5000--10000 primes. There are 6541 odd primes less than
       2^16. */
    static const uint16_t primes[] = {
      /* Generated by
    
         ./examples/eratosthenes 65535 \
         | awk '{ if (NR % 10 == 2) printf ("\n"); if (NR > 1) printf("%d, ", $1); }
                END { printf("\n"); }' > prime-list.h
      */
      #include "prime-list.h"
    };
    
    #define NUMBER_OF_PRIMES (sizeof(primes) / sizeof(primes[0]))
    
    #ifdef mpz_millerrabin
    # define PRIME_P mpz_millerrabin
    #else