EFM32 Giant Gecko 11 public-key hardware accelerator. More...
#include "em_device.h"
#include "em_crypto.h"
#include "core/crypto.h"
#include "hardware/efm32gg11/efm32gg11_crypto.h"
#include "hardware/efm32gg11/efm32gg11_crypto_pkc.h"
#include "ecc/ec.h"
#include "ecc/curve25519.h"
#include "debug.h"
Go to the source code of this file.
Macros | |
#define | TRACE_LEVEL CRYPTO_TRACE_LEVEL |
Functions | |
error_t | ecMulMod (const EcDomainParameters *params, Mpi *r, const Mpi *a, const Mpi *b) |
Fast modular multiplication. More... | |
error_t | ecSqrMod (const EcDomainParameters *params, Mpi *r, const Mpi *a) |
Fast modular squaring. More... | |
void | curve25519Mul (uint32_t *r, const uint32_t *a, const uint32_t *b) |
Modular multiplication. More... | |
void | curve25519Sqr (uint32_t *r, const uint32_t *a) |
Modular squaring. More... | |
Detailed Description
EFM32 Giant Gecko 11 public-key hardware accelerator.
License
SPDX-License-Identifier: GPL-2.0-or-later
Copyright (C) 2010-2024 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.4.4
Definition in file efm32gg11_crypto_pkc.c.
Macro Definition Documentation
◆ TRACE_LEVEL
#define TRACE_LEVEL CRYPTO_TRACE_LEVEL |
Definition at line 32 of file efm32gg11_crypto_pkc.c.
Function Documentation
◆ curve25519Mul()
void curve25519Mul | ( | 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 269 of file efm32gg11_crypto_pkc.c.
◆ curve25519Sqr()
void curve25519Sqr | ( | uint32_t * | r, |
const uint32_t * | a | ||
) |
Modular squaring.
- Parameters
-
[out] r Resulting integer R = (A ^ 2) mod p [in] a An integer such as 0 <= A < p
Definition at line 346 of file efm32gg11_crypto_pkc.c.
◆ ecMulMod()
error_t ecMulMod | ( | const EcDomainParameters * | params, |
Mpi * | r, | ||
const Mpi * | a, | ||
const Mpi * | b | ||
) |
Fast modular multiplication.
- Parameters
-
[in] params EC domain 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
- Returns
- Error code
Definition at line 57 of file efm32gg11_crypto_pkc.c.
◆ ecSqrMod()
error_t ecSqrMod | ( | const EcDomainParameters * | params, |
Mpi * | r, | ||
const Mpi * | a | ||
) |
Fast modular squaring.
- Parameters
-
[in] params EC domain parameters [out] r Resulting integer R = (A ^ 2) mod p [in] a An integer such as 0 <= A < p
- Returns
- Error code
Definition at line 169 of file efm32gg11_crypto_pkc.c.