Joined copyright on original XySSL code with: Christophe Devine
This program 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.
This program 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
Definition in file bignum.h.
#include <stdio.h>
Go to the source code of this file.
Data Structures | |
| struct | mpi |
| MPI structure. More... | |
Defines | |
| #define | MPI_CHK(f) if( ( ret = f ) != 0 ) goto cleanup |
| #define | POLARSSL_ERR_MPI_BAD_INPUT_DATA 0x0004 |
| #define | POLARSSL_ERR_MPI_BUFFER_TOO_SMALL 0x0008 |
| #define | POLARSSL_ERR_MPI_DIVISION_BY_ZERO 0x000C |
| #define | POLARSSL_ERR_MPI_FILE_IO_ERROR 0x0002 |
| #define | POLARSSL_ERR_MPI_INVALID_CHARACTER 0x0006 |
| #define | POLARSSL_ERR_MPI_NEGATIVE_VALUE 0x000A |
| #define | POLARSSL_ERR_MPI_NOT_ACCEPTABLE 0x000E |
Typedefs | |
| typedef unsigned long | t_int |
Functions | |
| int | mpi_add_abs (mpi *X, mpi *A, mpi *B) |
| Unsigned addition: X = |A| + |B|. | |
| int | mpi_add_int (mpi *X, mpi *A, int b) |
| Signed addition: X = A + b. | |
| int | mpi_add_mpi (mpi *X, mpi *A, mpi *B) |
| Signed addition: X = A + B. | |
| int | mpi_cmp_abs (mpi *X, mpi *Y) |
| Compare unsigned values. | |
| int | mpi_cmp_int (mpi *X, int z) |
| Compare signed values. | |
| int | mpi_cmp_mpi (mpi *X, mpi *Y) |
| Compare signed values. | |
| int | mpi_copy (mpi *X, mpi *Y) |
| Copy the contents of Y into X. | |
| int | mpi_div_int (mpi *Q, mpi *R, mpi *A, int b) |
| Division by int: A = Q * b + R. | |
| int | mpi_div_mpi (mpi *Q, mpi *R, mpi *A, mpi *B) |
| Division by mpi: A = Q * B + R. | |
| int | mpi_exp_mod (mpi *X, mpi *A, mpi *E, mpi *N, mpi *_RR) |
| Sliding-window exponentiation: X = A^E mod N. | |
| void | mpi_free (mpi *X,...) |
| Unallocate one or more mpi. | |
| int | mpi_gcd (mpi *G, mpi *A, mpi *B) |
| Greatest common divisor: G = gcd(A, B). | |
| int | mpi_gen_prime (mpi *X, int nbits, int dh_flag, int(*f_rng)(void *), void *p_rng) |
| Prime number generation. | |
| int | mpi_grow (mpi *X, int nblimbs) |
| Enlarge to the specified number of limbs. | |
| void | mpi_init (mpi *X,...) |
| Initialize one or more mpi. | |
| int | mpi_inv_mod (mpi *X, mpi *A, mpi *N) |
| Modular inverse: X = A^-1 mod N. | |
| int | mpi_is_prime (mpi *X, int(*f_rng)(void *), void *p_rng) |
| Miller-Rabin primality test. | |
| int | mpi_lsb (mpi *X) |
| Return the number of least significant bits. | |
| int | mpi_lset (mpi *X, int z) |
| Set value from integer. | |
| int | mpi_mod_int (t_int *r, mpi *A, int b) |
| Modulo: r = A mod b. | |
| int | mpi_mod_mpi (mpi *R, mpi *A, mpi *B) |
| Modulo: R = A mod B. | |
| int | mpi_msb (mpi *X) |
| Return the number of most significant bits. | |
| int | mpi_mul_int (mpi *X, mpi *A, t_int b) |
| Baseline multiplication: X = A * b Note: b is an unsigned integer type, thus Negative values of b are ignored. | |
| int | mpi_mul_mpi (mpi *X, mpi *A, mpi *B) |
| Baseline multiplication: X = A * B. | |
| int | mpi_read_binary (mpi *X, unsigned char *buf, int buflen) |
| Import X from unsigned binary data, big endian. | |
| int | mpi_read_file (mpi *X, int radix, FILE *fin) |
| Read X from an opened file. | |
| int | mpi_read_string (mpi *X, int radix, char *s) |
| Import from an ASCII string. | |
| int | mpi_self_test (int verbose) |
| Checkup routine. | |
| int | mpi_shift_l (mpi *X, int count) |
| Left-shift: X <<= count. | |
| int | mpi_shift_r (mpi *X, int count) |
| Right-shift: X >>= count. | |
| int | mpi_size (mpi *X) |
| Return the total size in bytes. | |
| int | mpi_sub_abs (mpi *X, mpi *A, mpi *B) |
| Unsigned substraction: X = |A| - |B|. | |
| int | mpi_sub_int (mpi *X, mpi *A, int b) |
| Signed substraction: X = A - b. | |
| int | mpi_sub_mpi (mpi *X, mpi *A, mpi *B) |
| Signed substraction: X = A - B. | |
| void | mpi_swap (mpi *X, mpi *Y) |
| Swap the contents of X and Y. | |
| int | mpi_write_binary (mpi *X, unsigned char *buf, int buflen) |
| Export X into unsigned binary data, big endian. | |
| int | mpi_write_file (char *p, mpi *X, int radix, FILE *fout) |
| Write X into an opened file, or stdout if fout is NULL. | |
| int | mpi_write_string (mpi *X, int radix, char *s, int *slen) |
| Export into an ASCII string. | |
Unsigned addition: X = |A| + |B|.
| X | Destination MPI | |
| A | Left-hand MPI | |
| B | Right-hand MPI |
Signed addition: X = A + b.
| X | Destination MPI | |
| A | Left-hand MPI | |
| b | The integer value to add |
Signed addition: X = A + B.
| X | Destination MPI | |
| A | Left-hand MPI | |
| B | Right-hand MPI |
Compare unsigned values.
| X | Left-hand MPI | |
| Y | Right-hand MPI |
| int mpi_cmp_int | ( | mpi * | X, | |
| int | z | |||
| ) |
Compare signed values.
| X | Left-hand MPI | |
| z | The integer value to compare to |
Compare signed values.
| X | Left-hand MPI | |
| Y | Right-hand MPI |
Copy the contents of Y into X.
| X | Destination MPI | |
| Y | Source MPI |
Division by int: A = Q * b + R.
| Q | Destination MPI for the quotient | |
| R | Destination MPI for the rest value | |
| A | Left-hand MPI | |
| b | Integer to divide by |
Division by mpi: A = Q * B + R.
| Q | Destination MPI for the quotient | |
| R | Destination MPI for the rest value | |
| A | Left-hand MPI | |
| B | Right-hand MPI |
Sliding-window exponentiation: X = A^E mod N.
| X | Destination MPI | |
| A | Left-hand MPI | |
| E | Exponent MPI | |
| N | Modular MPI | |
| _RR | Speed-up MPI used for recalculations |
Greatest common divisor: G = gcd(A, B).
| G | Destination MPI | |
| A | Left-hand MPI | |
| B | Right-hand MPI |
| int mpi_gen_prime | ( | mpi * | X, | |
| int | nbits, | |||
| int | dh_flag, | |||
| int(*)(void *) | f_rng, | |||
| void * | p_rng | |||
| ) |
Prime number generation.
| X | Destination MPI | |
| nbits | Required size of X in bits | |
| dh_flag | If 1, then (X-1)/2 will be prime too | |
| f_rng | RNG function | |
| p_rng | RNG parameter |
| int mpi_grow | ( | mpi * | X, | |
| int | nblimbs | |||
| ) |
Enlarge to the specified number of limbs.
| X | MPI to grow | |
| nblimbs | The target number of limbs |
Modular inverse: X = A^-1 mod N.
| X | Destination MPI | |
| A | Left-hand MPI | |
| N | Right-hand MPI |
| int mpi_is_prime | ( | mpi * | X, | |
| int(*)(void *) | f_rng, | |||
| void * | p_rng | |||
| ) |
Miller-Rabin primality test.
| X | MPI to check | |
| f_rng | RNG function | |
| p_rng | RNG parameter |
| int mpi_lsb | ( | mpi * | X | ) |
Return the number of least significant bits.
| X | MPI to use |
| int mpi_lset | ( | mpi * | X, | |
| int | z | |||
| ) |
Set value from integer.
| X | MPI to set | |
| z | Value to use |
Modulo: r = A mod b.
| r | Destination t_int | |
| A | Left-hand MPI | |
| b | Integer to divide by |
Modulo: R = A mod B.
| R | Destination MPI for the rest value | |
| A | Left-hand MPI | |
| B | Right-hand MPI |
| int mpi_msb | ( | mpi * | X | ) |
Return the number of most significant bits.
| X | MPI to use |
Referenced by d2i_RSA_PUBKEY().
Baseline multiplication: X = A * b Note: b is an unsigned integer type, thus Negative values of b are ignored.
| X | Destination MPI | |
| A | Left-hand MPI | |
| b | The integer value to multiply with |
Baseline multiplication: X = A * B.
| X | Destination MPI | |
| A | Left-hand MPI | |
| B | Right-hand MPI |
| int mpi_read_binary | ( | mpi * | X, | |
| unsigned char * | buf, | |||
| int | buflen | |||
| ) |
Import X from unsigned binary data, big endian.
| X | Destination MPI | |
| buf | Input buffer | |
| buflen | Input buffer size |
Referenced by d2i_RSA_PUBKEY().
| int mpi_read_file | ( | mpi * | X, | |
| int | radix, | |||
| FILE * | fin | |||
| ) |
Read X from an opened file.
| X | Destination MPI | |
| radix | Input numeric base | |
| fin | Input file handle |
| int mpi_read_string | ( | mpi * | X, | |
| int | radix, | |||
| char * | s | |||
| ) |
Import from an ASCII string.
| X | Destination MPI | |
| radix | Input numeric base | |
| s | Null-terminated string buffer |
| int mpi_self_test | ( | int | verbose | ) |
| int mpi_shift_l | ( | mpi * | X, | |
| int | count | |||
| ) |
Left-shift: X <<= count.
| X | MPI to shift | |
| count | Amount to shift |
| int mpi_shift_r | ( | mpi * | X, | |
| int | count | |||
| ) |
Right-shift: X >>= count.
| X | MPI to shift | |
| count | Amount to shift |
| int mpi_size | ( | mpi * | X | ) |
Return the total size in bytes.
| X | MPI to use |
Unsigned substraction: X = |A| - |B|.
| X | Destination MPI | |
| A | Left-hand MPI | |
| B | Right-hand MPI |
Signed substraction: X = A - b.
| X | Destination MPI | |
| A | Left-hand MPI | |
| b | The integer value to subtract |
Signed substraction: X = A - B.
| X | Destination MPI | |
| A | Left-hand MPI | |
| B | Right-hand MPI |
Swap the contents of X and Y.
| X | First MPI value | |
| Y | Second MPI value |
| int mpi_write_binary | ( | mpi * | X, | |
| unsigned char * | buf, | |||
| int | buflen | |||
| ) |
Export X into unsigned binary data, big endian.
| X | Source MPI | |
| buf | Output buffer | |
| buflen | Output buffer size |
| int mpi_write_file | ( | char * | p, | |
| mpi * | X, | |||
| int | radix, | |||
| FILE * | fout | |||
| ) |
Write X into an opened file, or stdout if fout is NULL.
| p | Prefix, can be NULL | |
| X | Source MPI | |
| radix | Output numeric base | |
| fout | Output file handle (can be NULL) |
| int mpi_write_string | ( | mpi * | X, | |
| int | radix, | |||
| char * | s, | |||
| int * | slen | |||
| ) |
Export into an ASCII string.
| X | Source MPI | |
| radix | Output numeric base | |
| s | String buffer | |
| slen | String buffer size |
1.5.5