DXR is a code search and navigation tool aimed at making sense of large projects. It supports full-text and regex searches as well as structural queries.

Name Description Modified (UTC) Size
tests
Makefile 4.4 kB
README This Source Code Form is subject to the terms of the Mozilla Public 11.1 kB
README.FP 12.4 kB
ec2.h Checks if point P(px, py) is at infinity. Uses affine coordinates. 3.9 kB
ec2_163.c Fast reduction for polynomials over a 163-bit curve. Assumes reduction * polynomial with terms {163 5.4 kB
ec2_193.c Fast reduction for polynomials over a 193-bit curve. Assumes reduction * polynomial with terms {193 5.4 kB
ec2_233.c Fast reduction for polynomials over a 233-bit curve. Assumes reduction * polynomial with terms {233 5.9 kB
ec2_aff.c Checks if point P(px, py) is at infinity. Uses affine coordinates. 9.2 kB
ec2_mont.c Compute the x-coordinate x/z for the point 2*(x/z) in Montgomery * projective coordinates. Uses alg 7.0 kB
ec2_proj.c by default, these routines are unused and thus don't need to be compiled 10.3 kB
ec_naf.c Returns 2^e as an integer. This is meant to be used for small powers of * two. 1.6 kB
ecl-curve.h mapping between ECCurveName enum and pointers to ECCurveParams 4.9 kB
ecl-exp.h Curve field type 5.0 kB
ecl-priv.h MAX_FIELD_SIZE_DIGITS is the maximum size of field element supported 10.4 kB
ecl.c priv 11.0 kB
ecl.h exp 2.2 kB
ecl_curve.c Duplicates an ECCurveParams 2.1 kB
ecl_gf.c Allocate memory for a new GFMethod object. 23.1 kB
ecl_mult.c Elliptic curve scalar-point multiplication. Computes R(x, y) = k * P(x, * y). If x, y = NULL, the 9.6 kB
ecp.h Checks if point P(px, py) is at infinity. Uses affine coordinates. 4.6 kB
ecp_192.c Fast modular reduction for p192 = 2^192 - 2^64 - 1. a can be r. Uses * algorithm 7 from Brown, Han 13.2 kB
ecp_224.c Fast modular reduction for p224 = 2^224 - 2^96 + 1. a can be r. Uses * algorithm 7 from Brown, Han 9.7 kB
ecp_256.c Fast modular reduction for p256 = 2^256 - 2^224 + 2^192+ 2^96 - 1. a can be r. * Uses algorithm 2 10.9 kB
ecp_256_32.c A 32-bit implementation of the NIST P-256 elliptic curve. 50.4 kB
ecp_384.c Fast modular reduction for p384 = 2^384 - 2^128 - 2^96 + 2^32 - 1. a can be r. * Uses algorithm 2 6.5 kB
ecp_521.c Fast modular reduction for p521 = 2^521 - 1. a can be r. Uses * algorithm 2.31 from Hankerson, Men 3.7 kB
ecp_aff.c Checks if point P(px, py) is at infinity. Uses affine coordinates. 9.4 kB
ecp_fp.c Performs tidying on a short multi-precision floating point integer (the * lower group->numDoubles 13.8 kB
ecp_fp.h Largest number of doubles to store one reduced number in floating * point. Used for memory allocati 16.2 kB
ecp_fp160.c Performs a single step of reduction, just on the uppermost float * (assumes already tidied), and th 4.7 kB
ecp_fp192.c Performs a single step of reduction, just on the uppermost float * (assumes already tidied), and th 4.4 kB
ecp_fp224.c Performs a single step of reduction, just on the uppermost float * (assumes already tidied), and th 4.5 kB
ecp_fpinc.c This source file is meant to be included by other source files * (ecp_fp###.c, where ### is one of 24.4 kB
ecp_jac.c Converts a point P(px, py) from affine coordinates to Jacobian * projective coordinates R(rx, ry, r 16.8 kB
ecp_jm.c Computes R = 2P. Elliptic curve points P and R can be identical. Uses * Modified Jacobian coordi 8.9 kB
ecp_mont.c Uses Montgomery reduction for field arithmetic. See mpi/mpmontg.c for * code implementation. 3.8 kB