| Commit message (Collapse) | Author | Age | Files | Lines |
|---|
| | |
|
| |
|
|
|
| |
- Use --points=all, the number of points can be quite large however,
it's 2^(num of prime subgroups of the curve).
|
| |
|
|
|
|
|
|
|
|
|
|
| |
Invalid curve generation now supports multi-threading via pthreads,
use the --threads= option.
- Changed some function params to const, where possible.
- Added *_new_copy, *_clone and *_new_clone functions to
curve_t*, point_t* and point_t**
- Made cfg->bits unsigned long
- Made order_any gcopy the generated order(as it can be a clone and
screw up stuff later)
|
| | |
|
| | |
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
| |
- Optimized invalid curve generation
- Invalid curve generation for secp256r1 now takes around 90minutes
instead of 5hours as before
- Optimized prime point generation(if only some small prime order
points are needed -> points_primet)
- Added a_once and b_once that prompt for parameter input and then set
the input parameter repeatedly
- Added optional args to gen_t functions
- Integer input now ignores whitespace and doesnt errorneously prompt
stdout when reading from file
- Specified C standard(C11) + feature macros in code.
|
| |
|
|
|
|
| |
- Prime order points for all prime divisors of curve order (all prime subgroups)
- Random points
- Minimal set of generators of the whole group (one or two points)
|
| | |
|
|
|
- Added Koblitz curve generation.
|
