The Design and Implementation of the FreeBSD Operating System, Second Edition
Now available: The Design and Implementation of the FreeBSD Operating System (Second Edition)


[ source navigation ] [ diff markup ] [ identifier search ] [ freetext search ] [ file search ] [ list types ] [ track identifier ]

FreeBSD/Linux Kernel Cross Reference
sys/netinet6/ip6_id.c

Version: -  FREEBSD  -  FREEBSD-13-STABLE  -  FREEBSD-13-0  -  FREEBSD-12-STABLE  -  FREEBSD-12-0  -  FREEBSD-11-STABLE  -  FREEBSD-11-0  -  FREEBSD-10-STABLE  -  FREEBSD-10-0  -  FREEBSD-9-STABLE  -  FREEBSD-9-0  -  FREEBSD-8-STABLE  -  FREEBSD-8-0  -  FREEBSD-7-STABLE  -  FREEBSD-7-0  -  FREEBSD-6-STABLE  -  FREEBSD-6-0  -  FREEBSD-5-STABLE  -  FREEBSD-5-0  -  FREEBSD-4-STABLE  -  FREEBSD-3-STABLE  -  FREEBSD22  -  l41  -  OPENBSD  -  linux-2.6  -  MK84  -  PLAN9  -  xnu-8792 
SearchContext: -  none  -  3  -  10 

    1 /*      $KAME: ip6_id.c,v 1.13 2003/09/16 09:11:19 itojun Exp $ */
    2 /*      $OpenBSD: ip_id.c,v 1.6 2002/03/15 18:19:52 millert Exp $       */
    3 /* $FreeBSD: releng/6.3/sys/netinet6/ip6_id.c 139826 2005-01-07 02:30:35Z imp $ */
    4 
    5 /*-
    6  * Copyright (C) 2003 WIDE Project.
    7  * All rights reserved.
    8  *
    9  * Redistribution and use in source and binary forms, with or without
   10  * modification, are permitted provided that the following conditions
   11  * are met:
   12  * 1. Redistributions of source code must retain the above copyright
   13  *    notice, this list of conditions and the following disclaimer.
   14  * 2. Redistributions in binary form must reproduce the above copyright
   15  *    notice, this list of conditions and the following disclaimer in the
   16  *    documentation and/or other materials provided with the distribution.
   17  * 3. Neither the name of the project nor the names of its contributors
   18  *    may be used to endorse or promote products derived from this software
   19  *    without specific prior written permission.
   20  *
   21  * THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
   22  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
   23  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
   24  * ARE DISCLAIMED.  IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
   25  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
   26  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
   27  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
   28  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
   29  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
   30  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
   31  * SUCH DAMAGE.
   32  */
   33 
   34 /*-
   35  * Copyright 1998 Niels Provos <provos@citi.umich.edu>
   36  * All rights reserved.
   37  *
   38  * Theo de Raadt <deraadt@openbsd.org> came up with the idea of using
   39  * such a mathematical system to generate more random (yet non-repeating)
   40  * ids to solve the resolver/named problem.  But Niels designed the
   41  * actual system based on the constraints.
   42  *
   43  * Redistribution and use in source and binary forms, with or without
   44  * modification, are permitted provided that the following conditions
   45  * are met:
   46  * 1. Redistributions of source code must retain the above copyright
   47  *    notice, this list of conditions and the following disclaimer.
   48  * 2. Redistributions in binary form must reproduce the above copyright
   49  *    notice, this list of conditions and the following disclaimer in the
   50  *    documentation and/or other materials provided with the distribution.
   51  * 3. All advertising materials mentioning features or use of this software
   52  *    must display the following acknowledgement:
   53  *      This product includes software developed by Niels Provos.
   54  * 4. The name of the author may not be used to endorse or promote products
   55  *    derived from this software without specific prior written permission.
   56  *
   57  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
   58  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
   59  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
   60  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
   61  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
   62  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
   63  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
   64  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
   65  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
   66  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
   67  */
   68 
   69 /*
   70  * seed = random (bits - 1) bit
   71  * n = prime, g0 = generator to n,
   72  * j = random so that gcd(j,n-1) == 1
   73  * g = g0^j mod n will be a generator again.
   74  *
   75  * X[0] = random seed.
   76  * X[n] = a*X[n-1]+b mod m is a Linear Congruential Generator
   77  * with a = 7^(even random) mod m,
   78  *      b = random with gcd(b,m) == 1
   79  *      m = constant and a maximal period of m-1.
   80  *
   81  * The transaction id is determined by:
   82  * id[n] = seed xor (g^X[n] mod n)
   83  *
   84  * Effectivly the id is restricted to the lower (bits - 1) bits, thus
   85  * yielding two different cycles by toggling the msb on and off.
   86  * This avoids reuse issues caused by reseeding.
   87  */
   88 
   89 #include <sys/types.h>
   90 #include <sys/param.h>
   91 #include <sys/kernel.h>
   92 #include <sys/socket.h>
   93 #include <sys/libkern.h>
   94 
   95 #include <net/if.h>
   96 #include <net/route.h>
   97 #include <netinet/in.h>
   98 #include <netinet/ip6.h>
   99 #include <netinet6/ip6_var.h>
  100 
  101 #ifndef INT32_MAX
  102 #define INT32_MAX       0x7fffffffU
  103 #endif
  104 
  105 struct randomtab {
  106         const int       ru_bits; /* resulting bits */
  107         const long      ru_out; /* Time after wich will be reseeded */
  108         const u_int32_t ru_max; /* Uniq cycle, avoid blackjack prediction */
  109         const u_int32_t ru_gen; /* Starting generator */
  110         const u_int32_t ru_n;   /* ru_n: prime, ru_n - 1: product of pfacts[] */
  111         const u_int32_t ru_agen; /* determine ru_a as ru_agen^(2*rand) */
  112         const u_int32_t ru_m;   /* ru_m = 2^x*3^y */
  113         const u_int32_t pfacts[4];      /* factors of ru_n */
  114 
  115         u_int32_t ru_counter;
  116         u_int32_t ru_msb;
  117 
  118         u_int32_t ru_x;
  119         u_int32_t ru_seed, ru_seed2;
  120         u_int32_t ru_a, ru_b;
  121         u_int32_t ru_g;
  122         long ru_reseed;
  123 };
  124 
  125 static struct randomtab randomtab_32 = {
  126         32,                     /* resulting bits */
  127         180,                    /* Time after wich will be reseeded */
  128         1000000000,             /* Uniq cycle, avoid blackjack prediction */
  129         2,                      /* Starting generator */
  130         2147483629,             /* RU_N-1 = 2^2*3^2*59652323 */
  131         7,                      /* determine ru_a as RU_AGEN^(2*rand) */
  132         1836660096,             /* RU_M = 2^7*3^15 - don't change */
  133         { 2, 3, 59652323, 0 },  /* factors of ru_n */
  134 };
  135 
  136 static struct randomtab randomtab_20 = {
  137         20,                     /* resulting bits */
  138         180,                    /* Time after wich will be reseeded */
  139         200000,                 /* Uniq cycle, avoid blackjack prediction */
  140         2,                      /* Starting generator */
  141         524269,                 /* RU_N-1 = 2^2*3^2*14563 */
  142         7,                      /* determine ru_a as RU_AGEN^(2*rand) */
  143         279936,                 /* RU_M = 2^7*3^7 - don't change */
  144         { 2, 3, 14563, 0 },     /* factors of ru_n */
  145 };
  146 
  147 static u_int32_t pmod(u_int32_t, u_int32_t, u_int32_t);
  148 static void initid(struct randomtab *);
  149 static u_int32_t randomid(struct randomtab *);
  150 
  151 /*
  152  * Do a fast modular exponation, returned value will be in the range
  153  * of 0 - (mod-1)
  154  */
  155 
  156 static u_int32_t
  157 pmod(u_int32_t gen, u_int32_t expo, u_int32_t mod)
  158 {
  159         u_int64_t s, t, u;
  160 
  161         s = 1;
  162         t = gen;
  163         u = expo;
  164 
  165         while (u) {
  166                 if (u & 1)
  167                         s = (s * t) % mod;
  168                 u >>= 1;
  169                 t = (t * t) % mod;
  170         }
  171         return (s);
  172 }
  173 
  174 /*
  175  * Initalizes the seed and chooses a suitable generator. Also toggles
  176  * the msb flag. The msb flag is used to generate two distinct
  177  * cycles of random numbers and thus avoiding reuse of ids.
  178  *
  179  * This function is called from id_randomid() when needed, an
  180  * application does not have to worry about it.
  181  */
  182 static void
  183 initid(struct randomtab *p)
  184 {
  185         u_int32_t j, i;
  186         int noprime = 1;
  187 
  188         p->ru_x = arc4random() % p->ru_m;
  189 
  190         /* (bits - 1) bits of random seed */
  191         p->ru_seed = arc4random() & (~0U >> (32 - p->ru_bits + 1));
  192         p->ru_seed2 = arc4random() & (~0U >> (32 - p->ru_bits + 1));
  193 
  194         /* Determine the LCG we use */
  195         p->ru_b = (arc4random() & (~0U >> (32 - p->ru_bits))) | 1;
  196         p->ru_a = pmod(p->ru_agen,
  197             (arc4random() & (~0U >> (32 - p->ru_bits))) & (~1U), p->ru_m);
  198         while (p->ru_b % 3 == 0)
  199                 p->ru_b += 2;
  200 
  201         j = arc4random() % p->ru_n;
  202 
  203         /*
  204          * Do a fast gcd(j, RU_N - 1), so we can find a j with
  205          * gcd(j, RU_N - 1) == 1, giving a new generator for
  206          * RU_GEN^j mod RU_N
  207          */
  208         while (noprime) {
  209                 for (i = 0; p->pfacts[i] > 0; i++)
  210                         if (j % p->pfacts[i] == 0)
  211                                 break;
  212 
  213                 if (p->pfacts[i] == 0)
  214                         noprime = 0;
  215                 else
  216                         j = (j + 1) % p->ru_n;
  217         }
  218 
  219         p->ru_g = pmod(p->ru_gen, j, p->ru_n);
  220         p->ru_counter = 0;
  221 
  222         p->ru_reseed = time_second + p->ru_out;
  223         p->ru_msb = p->ru_msb ? 0 : (1U << (p->ru_bits - 1));
  224 }
  225 
  226 static u_int32_t
  227 randomid(struct randomtab *p)
  228 {
  229         int i, n;
  230         u_int32_t tmp;
  231 
  232         if (p->ru_counter >= p->ru_max || time_second > p->ru_reseed)
  233                 initid(p);
  234 
  235         tmp = arc4random();
  236 
  237         /* Skip a random number of ids */
  238         n = tmp & 0x3; tmp = tmp >> 2;
  239         if (p->ru_counter + n >= p->ru_max)
  240                 initid(p);
  241 
  242         for (i = 0; i <= n; i++) {
  243                 /* Linear Congruential Generator */
  244                 p->ru_x = (u_int32_t)((u_int64_t)p->ru_a * p->ru_x + p->ru_b) % p->ru_m;
  245         }
  246 
  247         p->ru_counter += i;
  248 
  249         return (p->ru_seed ^ pmod(p->ru_g, p->ru_seed2 ^ p->ru_x, p->ru_n)) |
  250             p->ru_msb;
  251 }
  252 
  253 u_int32_t
  254 ip6_randomid(void)
  255 {
  256 
  257         return randomid(&randomtab_32);
  258 }
  259 
  260 u_int32_t
  261 ip6_randomflowlabel(void)
  262 {
  263 
  264         return randomid(&randomtab_20) & 0xfffff;
  265 }

Cache object: 087bf5d3a559ca0bc418d02a7c53b51f


[ source navigation ] [ diff markup ] [ identifier search ] [ freetext search ] [ file search ] [ list types ] [ track identifier ]


This page is part of the FreeBSD/Linux Linux Kernel Cross-Reference, and was automatically generated using a modified version of the LXR engine.