1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581
|
/** @file Big number API implementation based on OpenSSL
Copyright (c) 2022, Intel Corporation. All rights reserved.<BR>
SPDX-License-Identifier: BSD-2-Clause-Patent
**/
#include "InternalCryptLib.h"
#include <openssl/bn.h>
/**
Allocate new Big Number.
@retval New BigNum opaque structure or NULL on failure.
**/
VOID *
EFIAPI
BigNumInit (
VOID
)
{
return BN_new ();
}
/**
Allocate new Big Number and assign the provided value to it.
@param[in] Buf Big endian encoded buffer.
@param[in] Len Buffer length.
@retval New BigNum opaque structure or NULL on failure.
**/
VOID *
EFIAPI
BigNumFromBin (
IN CONST UINT8 *Buf,
IN UINTN Len
)
{
return BN_bin2bn (Buf, (INT32)Len, NULL);
}
/**
Convert the absolute value of Bn into big-endian form and store it at Buf.
The Buf array should have at least BigNumBytes() in it.
@param[in] Bn Big number to convert.
@param[out] Buf Output buffer.
@retval The length of the big-endian number placed at Buf or -1 on error.
**/
INTN
EFIAPI
BigNumToBin (
IN CONST VOID *Bn,
OUT UINT8 *Buf
)
{
return BN_bn2bin (Bn, Buf);
}
/**
Free the Big Number.
@param[in] Bn Big number to free.
@param[in] Clear TRUE if the buffer should be cleared.
**/
VOID
EFIAPI
BigNumFree (
IN VOID *Bn,
IN BOOLEAN Clear
)
{
if (Clear) {
BN_clear_free (Bn);
} else {
BN_free (Bn);
}
}
/**
Calculate the sum of two Big Numbers.
Please note, all "out" Big number arguments should be properly initialized
by calling to BigNumInit() or BigNumFromBin() functions.
@param[in] BnA Big number.
@param[in] BnB Big number.
@param[out] BnRes The result of BnA + BnB.
@retval TRUE On success.
@retval FALSE Otherwise.
**/
BOOLEAN
EFIAPI
BigNumAdd (
IN CONST VOID *BnA,
IN CONST VOID *BnB,
OUT VOID *BnRes
)
{
return (BOOLEAN)BN_add (BnRes, BnA, BnB);
}
/**
Subtract two Big Numbers.
Please note, all "out" Big number arguments should be properly initialized
by calling to BigNumInit() or BigNumFromBin() functions.
@param[in] BnA Big number.
@param[in] BnB Big number.
@param[out] BnRes The result of BnA - BnB.
@retval TRUE On success.
@retval FALSE Otherwise.
**/
BOOLEAN
EFIAPI
BigNumSub (
IN CONST VOID *BnA,
IN CONST VOID *BnB,
OUT VOID *BnRes
)
{
return (BOOLEAN)BN_sub (BnRes, BnA, BnB);
}
/**
Calculate remainder: BnRes = BnA % BnB.
Please note, all "out" Big number arguments should be properly initialized
by calling to BigNumInit() or BigNumFromBin() functions.
@param[in] BnA Big number.
@param[in] BnB Big number.
@param[out] BnRes The result of BnA % BnB.
@retval TRUE On success.
@retval FALSE Otherwise.
**/
BOOLEAN
EFIAPI
BigNumMod (
IN CONST VOID *BnA,
IN CONST VOID *BnB,
OUT VOID *BnRes
)
{
BOOLEAN RetVal;
BN_CTX *Ctx;
Ctx = BN_CTX_new ();
if (Ctx == NULL) {
return FALSE;
}
RetVal = (BOOLEAN)BN_mod (BnRes, BnA, BnB, Ctx);
BN_CTX_free (Ctx);
return RetVal;
}
/**
Compute BnA to the BnP-th power modulo BnM.
Please note, all "out" Big number arguments should be properly initialized
by calling to BigNumInit() or BigNumFromBin() functions.
@param[in] BnA Big number.
@param[in] BnP Big number (power).
@param[in] BnM Big number (modulo).
@param[out] BnRes The result of (BnA ^ BnP) % BnM.
@retval TRUE On success.
@retval FALSE Otherwise.
**/
BOOLEAN
EFIAPI
BigNumExpMod (
IN CONST VOID *BnA,
IN CONST VOID *BnP,
IN CONST VOID *BnM,
OUT VOID *BnRes
)
{
BOOLEAN RetVal;
BN_CTX *Ctx;
Ctx = BN_CTX_new ();
if (Ctx == NULL) {
return FALSE;
}
RetVal = (BOOLEAN)BN_mod_exp (BnRes, BnA, BnP, BnM, Ctx);
BN_CTX_free (Ctx);
return RetVal;
}
/**
Compute BnA inverse modulo BnM.
Please note, all "out" Big number arguments should be properly initialized
by calling to BigNumInit() or BigNumFromBin() functions.
@param[in] BnA Big number.
@param[in] BnM Big number (modulo).
@param[out] BnRes The result, such that (BnA * BnRes) % BnM == 1.
@retval TRUE On success.
@retval FALSE Otherwise.
**/
BOOLEAN
EFIAPI
BigNumInverseMod (
IN CONST VOID *BnA,
IN CONST VOID *BnM,
OUT VOID *BnRes
)
{
BOOLEAN RetVal;
BN_CTX *Ctx;
Ctx = BN_CTX_new ();
if (Ctx == NULL) {
return FALSE;
}
RetVal = FALSE;
if (BN_mod_inverse (BnRes, BnA, BnM, Ctx) != NULL) {
RetVal = TRUE;
}
BN_CTX_free (Ctx);
return RetVal;
}
/**
Divide two Big Numbers.
Please note, all "out" Big number arguments should be properly initialized
by calling to BigNumInit() or BigNumFromBin() functions.
@param[in] BnA Big number.
@param[in] BnB Big number.
@param[out] BnRes The result, such that BnA / BnB.
@retval TRUE On success.
@retval FALSE Otherwise.
**/
BOOLEAN
EFIAPI
BigNumDiv (
IN CONST VOID *BnA,
IN CONST VOID *BnB,
OUT VOID *BnRes
)
{
BOOLEAN RetVal;
BN_CTX *Ctx;
Ctx = BN_CTX_new ();
if (Ctx == NULL) {
return FALSE;
}
RetVal = (BOOLEAN)BN_div (BnRes, NULL, BnA, BnB, Ctx);
BN_CTX_free (Ctx);
return RetVal;
}
/**
Multiply two Big Numbers modulo BnM.
Please note, all "out" Big number arguments should be properly initialized
by calling to BigNumInit() or BigNumFromBin() functions.
@param[in] BnA Big number.
@param[in] BnB Big number.
@param[in] BnM Big number (modulo).
@param[out] BnRes The result, such that (BnA * BnB) % BnM.
@retval TRUE On success.
@retval FALSE Otherwise.
**/
BOOLEAN
EFIAPI
BigNumMulMod (
IN CONST VOID *BnA,
IN CONST VOID *BnB,
IN CONST VOID *BnM,
OUT VOID *BnRes
)
{
BOOLEAN RetVal;
BN_CTX *Ctx;
Ctx = BN_CTX_new ();
if (Ctx == NULL) {
return FALSE;
}
RetVal = (BOOLEAN)BN_mod_mul (BnRes, BnA, BnB, BnM, Ctx);
BN_CTX_free (Ctx);
return RetVal;
}
/**
Compare two Big Numbers.
@param[in] BnA Big number.
@param[in] BnB Big number.
@retval 0 BnA == BnB.
@retval 1 BnA > BnB.
@retval -1 BnA < BnB.
**/
INTN
EFIAPI
BigNumCmp (
IN CONST VOID *BnA,
IN CONST VOID *BnB
)
{
return BN_cmp (BnA, BnB);
}
/**
Get number of bits in Bn.
@param[in] Bn Big number.
@retval Number of bits.
**/
UINTN
EFIAPI
BigNumBits (
IN CONST VOID *Bn
)
{
return BN_num_bits (Bn);
}
/**
Get number of bytes in Bn.
@param[in] Bn Big number.
@retval Number of bytes.
**/
UINTN
EFIAPI
BigNumBytes (
IN CONST VOID *Bn
)
{
return BN_num_bytes (Bn);
}
/**
Checks if Big Number equals to the given Num.
@param[in] Bn Big number.
@param[in] Num Number.
@retval TRUE iff Bn == Num.
@retval FALSE otherwise.
**/
BOOLEAN
EFIAPI
BigNumIsWord (
IN CONST VOID *Bn,
IN UINTN Num
)
{
return (BOOLEAN)BN_is_word (Bn, Num);
}
/**
Checks if Big Number is odd.
@param[in] Bn Big number.
@retval TRUE Bn is odd (Bn % 2 == 1).
@retval FALSE otherwise.
**/
BOOLEAN
EFIAPI
BigNumIsOdd (
IN CONST VOID *Bn
)
{
return (BOOLEAN)BN_is_odd (Bn);
}
/**
Copy Big number.
@param[out] BnDst Destination.
@param[in] BnSrc Source.
@retval BnDst on success.
@retval NULL otherwise.
**/
VOID *
EFIAPI
BigNumCopy (
OUT VOID *BnDst,
IN CONST VOID *BnSrc
)
{
return BN_copy (BnDst, BnSrc);
}
/**
Get constant Big number with value of "1".
This may be used to save expensive allocations.
@retval Big Number with value of 1.
**/
CONST VOID *
EFIAPI
BigNumValueOne (
VOID
)
{
return BN_value_one ();
}
/**
Shift right Big Number.
Please note, all "out" Big number arguments should be properly initialized
by calling to BigNumInit() or BigNumFromBin() functions.
@param[in] Bn Big number.
@param[in] N Number of bits to shift.
@param[out] BnRes The result.
@retval TRUE On success.
@retval FALSE Otherwise.
**/
BOOLEAN
EFIAPI
BigNumRShift (
IN CONST VOID *Bn,
IN UINTN N,
OUT VOID *BnRes
)
{
return (BOOLEAN)BN_rshift (BnRes, Bn, (INT32)N);
}
/**
Mark Big Number for constant time computations.
This function should be called before any constant time computations are
performed on the given Big number.
@param[in] Bn Big number
**/
VOID
EFIAPI
BigNumConstTime (
IN VOID *Bn
)
{
BN_set_flags (Bn, BN_FLG_CONSTTIME);
}
/**
Calculate square modulo.
Please note, all "out" Big number arguments should be properly initialized
by calling to BigNumInit() or BigNumFromBin() functions.
@param[in] BnA Big number.
@param[in] BnM Big number (modulo).
@param[out] BnRes The result, such that (BnA ^ 2) % BnM.
@retval TRUE On success.
@retval FALSE Otherwise.
**/
BOOLEAN
EFIAPI
BigNumSqrMod (
IN CONST VOID *BnA,
IN CONST VOID *BnM,
OUT VOID *BnRes
)
{
BOOLEAN RetVal;
BN_CTX *Ctx;
Ctx = BN_CTX_new ();
if (Ctx == NULL) {
return FALSE;
}
RetVal = (BOOLEAN)BN_mod_sqr (BnRes, BnA, BnM, Ctx);
BN_CTX_free (Ctx);
return RetVal;
}
/**
Create new Big Number computation context. This is an opaque structure
which should be passed to any function that requires it. The BN context is
needed to optimize calculations and expensive allocations.
@retval Big Number context struct or NULL on failure.
**/
VOID *
EFIAPI
BigNumNewContext (
VOID
)
{
return BN_CTX_new ();
}
/**
Free Big Number context that was allocated with BigNumNewContext().
@param[in] BnCtx Big number context to free.
**/
VOID
EFIAPI
BigNumContextFree (
IN VOID *BnCtx
)
{
BN_CTX_free (BnCtx);
}
/**
Set Big Number to a given value.
@param[in] Bn Big number to set.
@param[in] Val Value to set.
@retval TRUE On success.
@retval FALSE Otherwise.
**/
BOOLEAN
EFIAPI
BigNumSetUint (
IN VOID *Bn,
IN UINTN Val
)
{
return (BOOLEAN)BN_set_word (Bn, Val);
}
/**
Add two Big Numbers modulo BnM.
@param[in] BnA Big number.
@param[in] BnB Big number.
@param[in] BnM Big number (modulo).
@param[out] BnRes The result, such that (BnA + BnB) % BnM.
@retval TRUE On success.
@retval FALSE Otherwise.
**/
BOOLEAN
EFIAPI
BigNumAddMod (
IN CONST VOID *BnA,
IN CONST VOID *BnB,
IN CONST VOID *BnM,
OUT VOID *BnRes
)
{
BOOLEAN RetVal;
BN_CTX *Ctx;
Ctx = BN_CTX_new ();
if (Ctx == NULL) {
return FALSE;
}
RetVal = (BOOLEAN)BN_mod_add (BnRes, BnA, BnB, BnM, Ctx);
BN_CTX_free (Ctx);
return RetVal;
}
|