DXR will be turned off on Tuesday, December 29th. It will redirect to Searchfox.
See the announcement on Discourse.

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 6.0 kB
README ***** BEGIN LICENSE BLOCK ***** 12.6 kB
README.FP 13.9 kB
ec2.h Checks if point P(px, py) is at infinity. Uses affine coordinates. 5.5 kB
ec2_163.c Fast reduction for polynomials over a 163-bit curve. Assumes reduction * polynomial with terms {163 7.1 kB
ec2_193.c Fast reduction for polynomials over a 193-bit curve. Assumes reduction * polynomial with terms {193 7.2 kB
ec2_233.c Fast reduction for polynomials over a 233-bit curve. Assumes reduction * polynomial with terms {233 7.6 kB
ec2_aff.c Checks if point P(px, py) is at infinity. Uses affine coordinates. 10.8 kB
ec2_mont.c Compute the x-coordinate x/z for the point 2*(x/z) in Montgomery * projective coordinates. Uses alg 8.8 kB
ec2_proj.c by default, these routines are unused and thus don't need to be compiled 12.0 kB
ec_naf.c Returns 2^e as an integer. This is meant to be used for small powers of * two. 3.2 kB
ecl-curve.h 6.5 kB
ecl-exp.h Curve field type 6.5 kB
ecl-priv.h MAX_FIELD_SIZE_DIGITS is the maximum size of field element supported 11.9 kB
ecl.c priv 12.4 kB
ecl.h exp 3.8 kB
ecl_curve.c Duplicates an ECCurveParams 3.7 kB
ecl_gf.c Allocate memory for a new GFMethod object. 24.9 kB
ecl_mult.c Elliptic curve scalar-point multiplication. Computes R(x, y) = k * P(x, * y). If x, y = NULL, the 11.2 kB
ecp.h Checks if point P(px, py) is at infinity. Uses affine coordinates. 6.2 kB
ecp_192.c Fast modular reduction for p192 = 2^192 - 2^64 - 1. a can be r. Uses * algorithm 7 from Brown, Han 14.8 kB
ecp_224.c Fast modular reduction for p224 = 2^224 - 2^96 + 1. a can be r. Uses * algorithm 7 from Brown, Han 11.3 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 13.3 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 8.1 kB
ecp_521.c Fast modular reduction for p521 = 2^521 - 1. a can be r. Uses * algorithm 2.31 from Hankerson, Men 5.2 kB
ecp_aff.c Checks if point P(px, py) is at infinity. Uses affine coordinates. 11.3 kB
ecp_fp.c Performs tidying on a short multi-precision floating point integer (the * lower group->numDoubles 15.5 kB
ecp_fp.h Largest number of doubles to store one reduced number in floating * point. Used for memory allocati 17.8 kB
ecp_fp160.c Performs a single step of reduction, just on the uppermost float * (assumes already tidied), and th 6.3 kB
ecp_fp192.c Performs a single step of reduction, just on the uppermost float * (assumes already tidied), and th 6.0 kB
ecp_fp224.c Performs a single step of reduction, just on the uppermost float * (assumes already tidied), and th 6.1 kB
ecp_fpinc.c This source file is meant to be included by other source files * (ecp_fp###.c, where ### is one of 26.0 kB
ecp_jac.c Converts a point P(px, py) from affine coordinates to Jacobian * projective coordinates R(rx, ry, r 18.3 kB
ecp_jm.c Computes R = 2P. Elliptic curve points P and R can be identical. Uses * Modified Jacobian coordi 10.5 kB
ecp_mont.c Uses Montgomery reduction for field arithmetic. See mpi/mpmontg.c for * code implementation. 5.5 kB