forked from torvalds/linux
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
crypto: GnuPG based MPI lib - source files (part 1)
Adds the multi-precision-integer maths library which was originally taken from GnuPG and ported to the kernel by (among others) David Howells. This version is taken from Fedora kernel 2.6.32-71.14.1.el6. The difference is that checkpatch reported errors and warnings have been fixed. This library is used to implemenet RSA digital signature verification used in IMA/EVM integrity protection subsystem. Due to patch size limitation, the patch is divided into 4 parts. Signed-off-by: Dmitry Kasatkin <[email protected]>
- Loading branch information
Dmitry Kasatkin
committed
Nov 9, 2011
1 parent
1ea6b8f
commit cdec9cb
Showing
14 changed files
with
2,681 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,61 @@ | ||
/* mpihelp-add_1.c - MPI helper functions | ||
* Copyright (C) 1994, 1996, 1997, 1998, | ||
* 2000 Free Software Foundation, Inc. | ||
* | ||
* This file is part of GnuPG. | ||
* | ||
* GnuPG is free software; you can redistribute it and/or modify | ||
* it under the terms of the GNU General Public License as published by | ||
* the Free Software Foundation; either version 2 of the License, or | ||
* (at your option) any later version. | ||
* | ||
* GnuPG 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 General Public License for more details. | ||
* | ||
* You should have received a copy of the GNU General Public License | ||
* along with this program; if not, write to the Free Software | ||
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA | ||
* | ||
* Note: This code is heavily based on the GNU MP Library. | ||
* Actually it's the same code with only minor changes in the | ||
* way the data is stored; this is to support the abstraction | ||
* of an optional secure memory allocation which may be used | ||
* to avoid revealing of sensitive data due to paging etc. | ||
* The GNU MP Library itself is published under the LGPL; | ||
* however I decided to publish this code under the plain GPL. | ||
*/ | ||
|
||
#include "mpi-internal.h" | ||
#include "longlong.h" | ||
|
||
mpi_limb_t | ||
mpihelp_add_n(mpi_ptr_t res_ptr, mpi_ptr_t s1_ptr, | ||
mpi_ptr_t s2_ptr, mpi_size_t size) | ||
{ | ||
mpi_limb_t x, y, cy; | ||
mpi_size_t j; | ||
|
||
/* The loop counter and index J goes from -SIZE to -1. This way | ||
the loop becomes faster. */ | ||
j = -size; | ||
|
||
/* Offset the base pointers to compensate for the negative indices. */ | ||
s1_ptr -= j; | ||
s2_ptr -= j; | ||
res_ptr -= j; | ||
|
||
cy = 0; | ||
do { | ||
y = s2_ptr[j]; | ||
x = s1_ptr[j]; | ||
y += cy; /* add previous carry to one addend */ | ||
cy = y < cy; /* get out carry from that addition */ | ||
y += x; /* add other addend */ | ||
cy += y < x; /* get out carry from that add, combine */ | ||
res_ptr[j] = y; | ||
} while (++j); | ||
|
||
return cy; | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,63 @@ | ||
/* mpihelp-lshift.c - MPI helper functions | ||
* Copyright (C) 1994, 1996, 1998, 2001 Free Software Foundation, Inc. | ||
* | ||
* This file is part of GnuPG. | ||
* | ||
* GnuPG is free software; you can redistribute it and/or modify | ||
* it under the terms of the GNU General Public License as published by | ||
* the Free Software Foundation; either version 2 of the License, or | ||
* (at your option) any later version. | ||
* | ||
* GnuPG 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 General Public License for more details. | ||
* | ||
* You should have received a copy of the GNU General Public License | ||
* along with this program; if not, write to the Free Software | ||
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA | ||
* | ||
* Note: This code is heavily based on the GNU MP Library. | ||
* Actually it's the same code with only minor changes in the | ||
* way the data is stored; this is to support the abstraction | ||
* of an optional secure memory allocation which may be used | ||
* to avoid revealing of sensitive data due to paging etc. | ||
* The GNU MP Library itself is published under the LGPL; | ||
* however I decided to publish this code under the plain GPL. | ||
*/ | ||
|
||
#include "mpi-internal.h" | ||
|
||
/* Shift U (pointed to by UP and USIZE digits long) CNT bits to the left | ||
* and store the USIZE least significant digits of the result at WP. | ||
* Return the bits shifted out from the most significant digit. | ||
* | ||
* Argument constraints: | ||
* 1. 0 < CNT < BITS_PER_MP_LIMB | ||
* 2. If the result is to be written over the input, WP must be >= UP. | ||
*/ | ||
|
||
mpi_limb_t | ||
mpihelp_lshift(mpi_ptr_t wp, mpi_ptr_t up, mpi_size_t usize, unsigned int cnt) | ||
{ | ||
mpi_limb_t high_limb, low_limb; | ||
unsigned sh_1, sh_2; | ||
mpi_size_t i; | ||
mpi_limb_t retval; | ||
|
||
sh_1 = cnt; | ||
wp += 1; | ||
sh_2 = BITS_PER_MPI_LIMB - sh_1; | ||
i = usize - 1; | ||
low_limb = up[i]; | ||
retval = low_limb >> sh_2; | ||
high_limb = low_limb; | ||
while (--i >= 0) { | ||
low_limb = up[i]; | ||
wp[i] = (high_limb << sh_1) | (low_limb >> sh_2); | ||
high_limb = low_limb; | ||
} | ||
wp[i] = high_limb << sh_1; | ||
|
||
return retval; | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,57 @@ | ||
/* mpihelp-mul_1.c - MPI helper functions | ||
* Copyright (C) 1994, 1996, 1997, 1998, 2001 Free Software Foundation, Inc. | ||
* | ||
* This file is part of GnuPG. | ||
* | ||
* GnuPG is free software; you can redistribute it and/or modify | ||
* it under the terms of the GNU General Public License as published by | ||
* the Free Software Foundation; either version 2 of the License, or | ||
* (at your option) any later version. | ||
* | ||
* GnuPG 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 General Public License for more details. | ||
* | ||
* You should have received a copy of the GNU General Public License | ||
* along with this program; if not, write to the Free Software | ||
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA | ||
* | ||
* Note: This code is heavily based on the GNU MP Library. | ||
* Actually it's the same code with only minor changes in the | ||
* way the data is stored; this is to support the abstraction | ||
* of an optional secure memory allocation which may be used | ||
* to avoid revealing of sensitive data due to paging etc. | ||
* The GNU MP Library itself is published under the LGPL; | ||
* however I decided to publish this code under the plain GPL. | ||
*/ | ||
|
||
#include "mpi-internal.h" | ||
#include "longlong.h" | ||
|
||
mpi_limb_t | ||
mpihelp_mul_1(mpi_ptr_t res_ptr, mpi_ptr_t s1_ptr, mpi_size_t s1_size, | ||
mpi_limb_t s2_limb) | ||
{ | ||
mpi_limb_t cy_limb; | ||
mpi_size_t j; | ||
mpi_limb_t prod_high, prod_low; | ||
|
||
/* The loop counter and index J goes from -S1_SIZE to -1. This way | ||
* the loop becomes faster. */ | ||
j = -s1_size; | ||
|
||
/* Offset the base pointers to compensate for the negative indices. */ | ||
s1_ptr -= j; | ||
res_ptr -= j; | ||
|
||
cy_limb = 0; | ||
do { | ||
umul_ppmm(prod_high, prod_low, s1_ptr[j], s2_limb); | ||
prod_low += cy_limb; | ||
cy_limb = (prod_low < cy_limb ? 1 : 0) + prod_high; | ||
res_ptr[j] = prod_low; | ||
} while (++j); | ||
|
||
return cy_limb; | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,60 @@ | ||
/* mpihelp-mul_2.c - MPI helper functions | ||
* Copyright (C) 1994, 1996, 1997, 1998, 2001 Free Software Foundation, Inc. | ||
* | ||
* This file is part of GnuPG. | ||
* | ||
* GnuPG is free software; you can redistribute it and/or modify | ||
* it under the terms of the GNU General Public License as published by | ||
* the Free Software Foundation; either version 2 of the License, or | ||
* (at your option) any later version. | ||
* | ||
* GnuPG 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 General Public License for more details. | ||
* | ||
* You should have received a copy of the GNU General Public License | ||
* along with this program; if not, write to the Free Software | ||
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA | ||
* | ||
* Note: This code is heavily based on the GNU MP Library. | ||
* Actually it's the same code with only minor changes in the | ||
* way the data is stored; this is to support the abstraction | ||
* of an optional secure memory allocation which may be used | ||
* to avoid revealing of sensitive data due to paging etc. | ||
* The GNU MP Library itself is published under the LGPL; | ||
* however I decided to publish this code under the plain GPL. | ||
*/ | ||
|
||
#include "mpi-internal.h" | ||
#include "longlong.h" | ||
|
||
mpi_limb_t | ||
mpihelp_addmul_1(mpi_ptr_t res_ptr, mpi_ptr_t s1_ptr, | ||
mpi_size_t s1_size, mpi_limb_t s2_limb) | ||
{ | ||
mpi_limb_t cy_limb; | ||
mpi_size_t j; | ||
mpi_limb_t prod_high, prod_low; | ||
mpi_limb_t x; | ||
|
||
/* The loop counter and index J goes from -SIZE to -1. This way | ||
* the loop becomes faster. */ | ||
j = -s1_size; | ||
res_ptr -= j; | ||
s1_ptr -= j; | ||
|
||
cy_limb = 0; | ||
do { | ||
umul_ppmm(prod_high, prod_low, s1_ptr[j], s2_limb); | ||
|
||
prod_low += cy_limb; | ||
cy_limb = (prod_low < cy_limb ? 1 : 0) + prod_high; | ||
|
||
x = res_ptr[j]; | ||
prod_low = x + prod_low; | ||
cy_limb += prod_low < x ? 1 : 0; | ||
res_ptr[j] = prod_low; | ||
} while (++j); | ||
return cy_limb; | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,61 @@ | ||
/* mpihelp-mul_3.c - MPI helper functions | ||
* Copyright (C) 1994, 1996, 1997, 1998, 2001 Free Software Foundation, Inc. | ||
* | ||
* This file is part of GnuPG. | ||
* | ||
* GnuPG is free software; you can redistribute it and/or modify | ||
* it under the terms of the GNU General Public License as published by | ||
* the Free Software Foundation; either version 2 of the License, or | ||
* (at your option) any later version. | ||
* | ||
* GnuPG 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 General Public License for more details. | ||
* | ||
* You should have received a copy of the GNU General Public License | ||
* along with this program; if not, write to the Free Software | ||
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA | ||
* | ||
* Note: This code is heavily based on the GNU MP Library. | ||
* Actually it's the same code with only minor changes in the | ||
* way the data is stored; this is to support the abstraction | ||
* of an optional secure memory allocation which may be used | ||
* to avoid revealing of sensitive data due to paging etc. | ||
* The GNU MP Library itself is published under the LGPL; | ||
* however I decided to publish this code under the plain GPL. | ||
*/ | ||
|
||
#include "mpi-internal.h" | ||
#include "longlong.h" | ||
|
||
mpi_limb_t | ||
mpihelp_submul_1(mpi_ptr_t res_ptr, mpi_ptr_t s1_ptr, | ||
mpi_size_t s1_size, mpi_limb_t s2_limb) | ||
{ | ||
mpi_limb_t cy_limb; | ||
mpi_size_t j; | ||
mpi_limb_t prod_high, prod_low; | ||
mpi_limb_t x; | ||
|
||
/* The loop counter and index J goes from -SIZE to -1. This way | ||
* the loop becomes faster. */ | ||
j = -s1_size; | ||
res_ptr -= j; | ||
s1_ptr -= j; | ||
|
||
cy_limb = 0; | ||
do { | ||
umul_ppmm(prod_high, prod_low, s1_ptr[j], s2_limb); | ||
|
||
prod_low += cy_limb; | ||
cy_limb = (prod_low < cy_limb ? 1 : 0) + prod_high; | ||
|
||
x = res_ptr[j]; | ||
prod_low = x - prod_low; | ||
cy_limb += prod_low > x ? 1 : 0; | ||
res_ptr[j] = prod_low; | ||
} while (++j); | ||
|
||
return cy_limb; | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,63 @@ | ||
/* mpih-rshift.c - MPI helper functions | ||
* Copyright (C) 1994, 1996, 1998, 1999, | ||
* 2000, 2001 Free Software Foundation, Inc. | ||
* | ||
* This file is part of GNUPG | ||
* | ||
* GNUPG is free software; you can redistribute it and/or modify | ||
* it under the terms of the GNU General Public License as published by | ||
* the Free Software Foundation; either version 2 of the License, or | ||
* (at your option) any later version. | ||
* | ||
* GNUPG 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 General Public License for more details. | ||
* | ||
* You should have received a copy of the GNU General Public License | ||
* along with this program; if not, write to the Free Software | ||
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA | ||
* | ||
* Note: This code is heavily based on the GNU MP Library. | ||
* Actually it's the same code with only minor changes in the | ||
* way the data is stored; this is to support the abstraction | ||
* of an optional secure memory allocation which may be used | ||
* to avoid revealing of sensitive data due to paging etc. | ||
* The GNU MP Library itself is published under the LGPL; | ||
* however I decided to publish this code under the plain GPL. | ||
*/ | ||
|
||
#include "mpi-internal.h" | ||
|
||
/* Shift U (pointed to by UP and USIZE limbs long) CNT bits to the right | ||
* and store the USIZE least significant limbs of the result at WP. | ||
* The bits shifted out to the right are returned. | ||
* | ||
* Argument constraints: | ||
* 1. 0 < CNT < BITS_PER_MP_LIMB | ||
* 2. If the result is to be written over the input, WP must be <= UP. | ||
*/ | ||
|
||
mpi_limb_t | ||
mpihelp_rshift(mpi_ptr_t wp, mpi_ptr_t up, mpi_size_t usize, unsigned cnt) | ||
{ | ||
mpi_limb_t high_limb, low_limb; | ||
unsigned sh_1, sh_2; | ||
mpi_size_t i; | ||
mpi_limb_t retval; | ||
|
||
sh_1 = cnt; | ||
wp -= 1; | ||
sh_2 = BITS_PER_MPI_LIMB - sh_1; | ||
high_limb = up[0]; | ||
retval = high_limb << sh_2; | ||
low_limb = high_limb; | ||
for (i = 1; i < usize; i++) { | ||
high_limb = up[i]; | ||
wp[i] = (low_limb >> sh_1) | (high_limb << sh_2); | ||
low_limb = high_limb; | ||
} | ||
wp[i] = low_limb >> sh_1; | ||
|
||
return retval; | ||
} |
Oops, something went wrong.