MAX32690 public-key hardware accelerator. More...
#include "mxc_device.h"
#include "mxc_sys.h"
#include "ctb.h"
#include "core/crypto.h"
#include "hardware/max32690/max32690_crypto.h"
#include "hardware/max32690/max32690_crypto_pkc.h"
#include "ecc/ec.h"
#include "ecc/ec_misc.h"
#include "ecc/curve25519.h"
#include "ecc/curve448.h"
#include "mpi/mpi.h"
#include "debug.h"
Go to the source code of this file.
Macros | |
#define | TRACE_LEVEL CRYPTO_TRACE_LEVEL |
Functions | |
void | maaSetValue (uint_t offset, uint32_t value, uint_t length) |
Set operand value. More... | |
void | maaImportScalar (uint_t offset, const uint32_t *src, uint_t length) |
Import scalar. More... | |
void | maaImportMpi (uint_t offset, const Mpi *src, uint_t length) |
Import multiple-precision integer. More... | |
void | maaExportScalar (uint_t offset, uint32_t *dest, uint_t length) |
Export scalar. More... | |
error_t | maaExportMpi (uint_t offset, Mpi *dest, uint_t length) |
Export multiple-precision integer. More... | |
error_t | mpiExpModFast (Mpi *r, const Mpi *a, const Mpi *e, const Mpi *p) |
Modular exponentiation (fast calculation) More... | |
error_t | mpiExpModRegular (Mpi *r, const Mpi *a, const Mpi *e, const Mpi *p) |
Modular exponentiation (regular calculation) More... | |
void | ecFieldAddMod2 (const EcCurve *curve, uint32_t *r, const uint32_t *a, const uint32_t *b) |
Modular addition. More... | |
void | ecFieldSubMod2 (const EcCurve *curve, uint32_t *r, const uint32_t *a, const uint32_t *b) |
Modular subtraction. More... | |
void | ecFieldMulMod (const EcCurve *curve, uint32_t *r, const uint32_t *a, const uint32_t *b) |
Modular multiplication. More... | |
void | ecFieldSqrMod (const EcCurve *curve, uint32_t *r, const uint32_t *a) |
Modular squaring. More... | |
void | ecScalarMulMod (const EcCurve *curve, uint32_t *r, const uint32_t *a, const uint32_t *b) |
Modular multiplication. More... | |
void | ecScalarSqrMod (const EcCurve *curve, uint32_t *r, const uint32_t *a) |
Modular squaring. More... | |
void | curve25519Mul2 (uint32_t *r, const uint32_t *a, const uint32_t *b) |
Modular multiplication. More... | |
void | curve448Mul2 (uint32_t *r, const uint32_t *a, const uint32_t *b) |
Modular multiplication. More... | |
Detailed Description
MAX32690 public-key hardware accelerator.
License
SPDX-License-Identifier: GPL-2.0-or-later
Copyright (C) 2010-2025 Oryx Embedded SARL. All rights reserved.
This file is part of CycloneCRYPTO Open.
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.
- Version
- 2.5.0
Definition in file max32690_crypto_pkc.c.
Macro Definition Documentation
◆ TRACE_LEVEL
#define TRACE_LEVEL CRYPTO_TRACE_LEVEL |
Definition at line 32 of file max32690_crypto_pkc.c.
Function Documentation
◆ curve25519Mul2()
void curve25519Mul2 | ( | uint32_t * | r, |
const uint32_t * | a, | ||
const uint32_t * | b | ||
) |
Modular multiplication.
- Parameters
-
[out] r Resulting integer R = (A * B) mod p [in] a An integer such as 0 <= A < p [in] b An integer such as 0 <= B < p
Definition at line 779 of file max32690_crypto_pkc.c.
◆ curve448Mul2()
void curve448Mul2 | ( | uint32_t * | r, |
const uint32_t * | a, | ||
const uint32_t * | b | ||
) |
Modular multiplication.
- Parameters
-
[out] r Resulting integer R = (A * B) mod p [in] a An integer such as 0 <= A < p [in] b An integer such as 0 <= B < p
Definition at line 872 of file max32690_crypto_pkc.c.
◆ ecFieldAddMod2()
void ecFieldAddMod2 | ( | const EcCurve * | curve, |
uint32_t * | r, | ||
const uint32_t * | a, | ||
const uint32_t * | b | ||
) |
Modular addition.
- Parameters
-
[in] curve Elliptic curve parameters [out] r Resulting integer R = (A + B) mod p [in] a An integer such as 0 <= A < p [in] b An integer such as 0 <= B < p
Definition at line 384 of file max32690_crypto_pkc.c.
◆ ecFieldMulMod()
void ecFieldMulMod | ( | const EcCurve * | curve, |
uint32_t * | r, | ||
const uint32_t * | a, | ||
const uint32_t * | b | ||
) |
Modular multiplication.
- Parameters
-
[in] curve Elliptic curve parameters [out] r Resulting integer R = (A * B) mod p [in] a An integer such as 0 <= A < p [in] b An integer such as 0 <= B < p
Definition at line 508 of file max32690_crypto_pkc.c.
◆ ecFieldSqrMod()
void ecFieldSqrMod | ( | const EcCurve * | curve, |
uint32_t * | r, | ||
const uint32_t * | a | ||
) |
Modular squaring.
- Parameters
-
[in] curve Elliptic curve parameters [out] r Resulting integer R = A^2 mod p [in] a An integer such as 0 <= A < p
Definition at line 584 of file max32690_crypto_pkc.c.
◆ ecFieldSubMod2()
void ecFieldSubMod2 | ( | const EcCurve * | curve, |
uint32_t * | r, | ||
const uint32_t * | a, | ||
const uint32_t * | b | ||
) |
Modular subtraction.
- Parameters
-
[in] curve Elliptic curve parameters [out] r Resulting integer R = (A - B) mod p [in] a An integer such as 0 <= A < p [in] b An integer such as 0 <= B < p
Definition at line 446 of file max32690_crypto_pkc.c.
◆ ecScalarMulMod()
void ecScalarMulMod | ( | const EcCurve * | curve, |
uint32_t * | r, | ||
const uint32_t * | a, | ||
const uint32_t * | b | ||
) |
Modular multiplication.
- Parameters
-
[in] curve Elliptic curve parameters [out] r Resulting integer R = (A * B) mod q [in] a An integer such as 0 <= A < q [in] b An integer such as 0 <= B < q
Definition at line 658 of file max32690_crypto_pkc.c.
◆ ecScalarSqrMod()
void ecScalarSqrMod | ( | const EcCurve * | curve, |
uint32_t * | r, | ||
const uint32_t * | a | ||
) |
Modular squaring.
- Parameters
-
[in] curve Elliptic curve parameters [out] r Resulting integer R = A^2 mod q [in] a An integer such as 0 <= A < q
Definition at line 719 of file max32690_crypto_pkc.c.
◆ maaExportMpi()
Export multiple-precision integer.
- Parameters
-
[in] offset MAA memory offset [out] dest Pointer to the multiple-precision integer [in] length Length of the operand, in bits
- Returns
- Error code
Definition at line 179 of file max32690_crypto_pkc.c.
◆ maaExportScalar()
Export scalar.
- Parameters
-
[in] offset MAA memory offset [out] dest Pointer to the scalar [in] length Length of the operand, in bits
Definition at line 152 of file max32690_crypto_pkc.c.
◆ maaImportMpi()
Import multiple-precision integer.
- Parameters
-
[in] offset MAA memory offset [in] src Pointer to the multiple-precision integer [in] length Length of the operand, in bits
Definition at line 120 of file max32690_crypto_pkc.c.
◆ maaImportScalar()
Import scalar.
- Parameters
-
[in] offset MAA memory offset [in] src Pointer to the scalar [in] length Length of the operand, in bits
Definition at line 88 of file max32690_crypto_pkc.c.
◆ maaSetValue()
Set operand value.
- Parameters
-
[in] offset MAA memory offset [in] value Value of the operand [in] length Length of the operand, in bits
Definition at line 59 of file max32690_crypto_pkc.c.
◆ mpiExpModFast()
Modular exponentiation (fast calculation)
- Parameters
-
[out] r Resulting integer R = A ^ E mod P [in] a Pointer to a multiple precision integer [in] e Exponent [in] p Modulus
- Returns
- Error code
Definition at line 229 of file max32690_crypto_pkc.c.
◆ mpiExpModRegular()
Modular exponentiation (regular calculation)
- Parameters
-
[out] r Resulting integer R = A ^ E mod P [in] a Pointer to a multiple precision integer [in] e Exponent [in] p Modulus
- Returns
- Error code
Definition at line 306 of file max32690_crypto_pkc.c.