mirror/mbedtls
1
0
Fork 0
mirror of https://github.com/Mbed-TLS/mbedtls.git synced 2025-04-16 08:42:50 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Merge pull request #7535 from minosgalanakis/ecp/7264_enable_core_shift_l

Browse Source 
[Bignum] Adjust mbedtls_mpi_core_shift_l to use the core function
This commit is contained in:
Paul Elliott 2023-05-17 18:45:44 +01:00 committed by GitHub
commit 8203f2d89f
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
2 changed files with 4 additions and 30 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
include/mbedtls/bignum.h
View File

@ -594,6 +594,8 @@ int mbedtls_mpi_write_binary_le(const mbedtls_mpi *X,
* \brief Perform a left-shift on an MPI: X <<= count * \brief Perform a left-shift on an MPI: X <<= count
* *
* \param X The MPI to shift. This must point to an initialized MPI. * \param X The MPI to shift. This must point to an initialized MPI.
* The MPI pointed by \p X may be resized to fit
* the resulting number.
* \param count The number of bits to shift by. * \param count The number of bits to shift by.
* *
* \return \c 0 if successful. * \return \c 0 if successful.

32
library/bignum.c
View File

@ -750,13 +750,9 @@ int mbedtls_mpi_write_binary(const mbedtls_mpi *X,
int mbedtls_mpi_shift_l(mbedtls_mpi *X, size_t count) int mbedtls_mpi_shift_l(mbedtls_mpi *X, size_t count)
{ {
int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED; int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
size_t i, v0, t1; size_t i;
mbedtls_mpi_uint r0 = 0, r1;
MPI_VALIDATE_RET(X != NULL); MPI_VALIDATE_RET(X != NULL);
v0 = count / (biL);
t1 = count & (biL - 1);
i = mbedtls_mpi_bitlen(X) + count; i = mbedtls_mpi_bitlen(X) + count;
if (X->n * biL < i) { if (X->n * biL < i) {
@ -765,31 +761,7 @@ int mbedtls_mpi_shift_l(mbedtls_mpi *X, size_t count)
ret = 0; ret = 0;
/* mbedtls_mpi_core_shift_l(X->p, X->n, count);
* shift by count / limb_size
*/
if (v0 > 0) {
for (i = X->n; i > v0; i--) {
X->p[i - 1] = X->p[i - v0 - 1];
}
for (; i > 0; i--) {
X->p[i - 1] = 0;
}
}
/*
* shift by count % limb_size
*/
if (t1 > 0) {
for (i = v0; i < X->n; i++) {
r1 = X->p[i] >> (biL - t1);
X->p[i] <<= t1;
X->p[i] |= r0;
r0 = r1;
}
}
cleanup: cleanup:
return ret; return ret;