aboutsummaryrefslogtreecommitdiffstats
path: root/src
Commit message (Collapse)AuthorAgeFilesLines
* Remove extraneous includelloyd2010-03-021-4/+0
|
* Rename ECKAEG to ECDH. As far as I can tell they are the same algorithm,lloyd2010-03-023-31/+35
| | | | | I'm not sure where the old name came from though as literally the only hits for it on Google are botan-related.
* Kill ECKAEG_Oplloyd2010-03-0212-301/+32
|
* Remove ECDSA_Op and its attendant bitslloyd2010-03-0211-347/+45
|
* Remove auto_ptr from ECC key typeslloyd2010-03-0211-586/+136
|
* Remove a fairly useless member of EC_PublicKey that was only used forlloyd2010-03-027-95/+4
| | | | | | | handling ImplicitCA ECDSA keys in the CVC code. Currently dealt with in CVC by simply commenting out the calls - CVC is already pretty broken and I'd much rather have ECC sane and under control and CVC totally broken than ECC remaining in its current state.
* Set PEM constructor (taking a string) to default to "". In this case,lloyd2010-03-022-6/+12
| | | | don't initialize.
* Move all of the ECC domain parameter sets to policy.cpp, encoded as PEM,lloyd2010-03-024-437/+308
| | | | instead of weird custom format hard-coded in ec_dompar.cpp
* Add EC domain contructor eating PEM. Set OID in OID constructorlloyd2010-03-012-3/+17
|
* Add EC_Domain_Params::PEM_encodelloyd2010-03-013-31/+45
|
* Kill get_EC_Dom_Pars_by_oidlloyd2010-03-013-62/+49
|
* Clean up EC_Domain_Paramslloyd2010-03-017-187/+147
|
* Allow creating uninitialized PointGFp and CurveGFpslloyd2010-03-012-0/+10
|
* Rename mult2_in_place just mult2 (double would be better but is a keyword...)lloyd2010-03-012-6/+6
|
* Clean up catch and returnlloyd2010-03-011-5/+1
|
* In get_pbkdf_prf, catch Algorithm_Not_Found and return nulllloyd2010-03-011-2/+10
|
* passhash9: Ensure that choose_pbkdf_prf returns a PRF if possiblelloyd2010-03-011-2/+8
|
* Simplify mult2_in_place slightlylloyd2010-02-251-7/+3
|
* Use a Modular_Reducer in ECDSA op for reductions mod the order of the grouplloyd2010-02-252-18/+9
|
* Move contents of gfpmath to numbertheory. Adjust dependencies.lloyd2010-02-2510-21/+4
|
* Delete gfp_element.h and remove the gfpmath testslloyd2010-02-252-250/+0
|
* Hide MillerRabin_Test class (only used in numthry.cpp)lloyd2010-02-256-84/+84
| | | | | | Inline simple functions in Modular_Reducer Add Modular_Reducer::cube convenience function
* Cache the Modular_Reducer of p in CurveGFp; speedup of 3-4xlloyd2010-02-252-8/+11
|
* Remove GFpElement from check_invariants, remove includelloyd2010-02-251-20/+15
|
* create_random_point was not used anywhere, so remove itlloyd2010-02-252-28/+0
|
* s/GFpElement/Modular_Reducer/ in get_affine_{x,y}lloyd2010-02-251-14/+6
|
* Convert PointGFp::operator+= to using BigInt + Modular_Reducer instead oflloyd2010-02-251-34/+18
| | | | GFpElement
* Make PointGFp::mult2_in_place privatelloyd2010-02-252-20/+25
|
* Use Modular_Reducer instead of GFpElement in operator*=lloyd2010-02-251-13/+8
|
* Inline PointGFp constructorslloyd2010-02-252-51/+13
|
* In PointGFp::operator==, compare coordinates first, then the curvelloyd2010-02-251-4/+2
|
* There was only one caller of set_z_to_one (which was get_z_to_one) andlloyd2010-02-252-60/+24
| | | | | only one caller of get_z_to_one (in operator*=). Inline into operator*= and remove.
* Rewrite PointGFp::mult2_in_place to use plain BigInt plus a Modular_Reducerlloyd2010-02-251-47/+29
| | | | Clean up PointGFp::operator*=
* Hide PointGFp funcs set_z_to_one and get_z_to_onelloyd2010-02-251-15/+15
|
* Name vars in Modular_Reducer decllloyd2010-02-251-4/+4
|
* Inline GFpElementlloyd2010-02-254-175/+122
|
* Set parallelism defaults.lloyd2010-02-256-1/+15
| | | | | | | | Default unless specified is now 4. For SIMD code, use 2x the number of blocks which are processed in parallel using SIMD by that cipher. It may make sense to increase this to 4x or even more, further experimentation is necessary.
* Instead of the mode parallelism being specified via macros, have itlloyd2010-02-257-33/+37
| | | | | | | | | depend on the particular implementation. Add a new virtual function to BlockCipher named parallelism that returns the number of blocks the cipher object could or might want to process in parallel. Currently set to 1 by default but may make sense to increase this for even scalar implementations since it seems like better caching behavior makes it a win.
* Remove include of unused headerslloyd2010-02-251-3/+0
|
* Inline some simple GFpElement functions. Remove ostream << operatorlloyd2010-02-252-65/+15
|
* Move Illegal_Transformationlloyd2010-02-252-7/+7
|
* Remove point_{x,y,z} funcs, hide GFpElement entirelylloyd2010-02-254-35/+56
|
* CurveGFp: Inline, deleting source file. Store only a,b,p aslloyd2010-02-256-122/+80
| | | | | BigInts. Also reorder constructor args to p, a, b which seems more sensible to me.
* Change PointGFp to store BigInts instead of GFpElementslloyd2010-02-252-65/+68
|
* Rename PointGFp member variableslloyd2010-02-252-74/+74
|
* Cleanup EC2OSP, remove should-have-been-internal functionslloyd2010-02-252-85/+35
|
* Convert the PointGFp constructor taking three coordinates (Jacobian scheme)lloyd2010-02-252-10/+13
| | | | to take BigInts instead of GFpElements
* Convert PointGFp::get_jac_proj_{x,y,z} to return just the BigInt value,lloyd2010-02-252-10/+9
| | | | not a GFpElement
* Convert PointGFp::get_affine_{x,y} to return just the BigInt valuelloyd2010-02-255-27/+35
|
* Remove clutter. Add note about bug in mult by scalar (mult by -1 is wrong)lloyd2010-02-251-8/+5
|
generated by cgit v1.2.3 (git 2.39.1) at 2024-12-13 17:21:42 +0000