This is an automated email from the ASF dual-hosted git repository. acassis pushed a commit to branch master in repository https://gitbox.apache.org/repos/asf/nuttx.git
commit 24abc067c2ab34d9ac9601b8d4296aac249243fe Author: Daniel P. Carvalho <[email protected]> AuthorDate: Sat Oct 24 17:42:19 2026 -0300 Documentation/crypto: describe the ECC point and modular operations. Document the ecc_point_*() and ecc_mod_*() functions that the previous commit exports: the byte order and size of the operands, how the point at infinity is reported, and that the modular operations accept any modulus. Assisted-by: Claude Code:claude-sonnet-5-5 Signed-off-by: Daniel P. Carvalho <[email protected]> --- Documentation/os/crypto.rst | 11 +++++++++++ 1 file changed, 11 insertions(+) diff --git a/Documentation/os/crypto.rst b/Documentation/os/crypto.rst index aac0fe42fc6..64c2d042e14 100644 --- a/Documentation/os/crypto.rst +++ b/Documentation/os/crypto.rst @@ -165,6 +165,17 @@ NuttX also provides a lightweight ECC implementation and public API in secret computation, and ECDSA sign/verify. Public key export is available in compressed form (``ECC_BYTES + 1``) as well as X/Y uncompressed form. +The same header exports the building blocks of protocols that need more than +ECDH and ECDSA, such as the SAE handshake of WPA3, on the curve selected at +build time (P-256 by default). All values are big endian with ``ECC_BYTES`` +bytes, and the input and output buffers may overlap: + +- ``ecc_point_add()``, ``ecc_point_mul()`` and ``ecc_point_is_on_curve()`` work + on affine points. The first two return 1 when the result is the point at + infinity, which is represented as (0, 0). +- ``ecc_mod_add()``, ``ecc_mod_sub()``, ``ecc_mod_mul()`` and ``ecc_mod_exp()`` + work modulo any value, and are faster when it is the prime of the curve. + RSA Digital Signature Operations --------------------------------
