Pratyush Mishra
912fe4794f
Fix link to AVX2 and IFMA docs
2019-08-06 16:53:54 -07:00
Henry de Valence
5c18bfb6a7
Update doc(include) paths.
...
Since https://github.com/rust-lang/rust/pull/60938 the path root changed and
these new paths are required to compile on nightly.
Closes #268 .
2019-07-31 14:54:24 -07:00
Henry de Valence
9ddbf1ba83
Add notes on the IFMA implementation.
2019-01-18 14:19:39 -08:00
Henry de Valence
5700add507
Clean up warnings.
2019-01-18 14:19:30 -08:00
Henry de Valence
fa42708257
Change naming scheme for multiplication accumulators.
2019-01-18 14:19:30 -08:00
Henry de Valence
a84f9eafe4
Allow non_snake_case in the IFMA field and edwards modules.
2019-01-18 14:19:30 -08:00
Henry de Valence
06766bfdea
Delay shuffles that cross the "Great Wall of Intel".
2019-01-18 14:19:30 -08:00
Henry de Valence
33aa544cf4
Add IFMA constants file.
2019-01-18 14:19:30 -08:00
Henry de Valence
f825426ff4
Add impl Default, Identity for ExtendedPoint, CachedPoint.
2019-01-18 14:19:30 -08:00
Henry de Valence
da62569355
Add lookup table support.
2019-01-18 14:19:30 -08:00
Henry de Valence
6cec313f16
Add impl of Sub and Neg for Edwards points.
2019-01-18 14:19:30 -08:00
Henry de Valence
6faaef21df
Add mul_by_pow_2 for IFMA
2019-01-18 14:19:30 -08:00
Henry de Valence
8e38ff2859
Add Edwards doubling implementation.
2019-01-18 14:19:30 -08:00
Henry de Valence
c4617b28a9
Add squaring implementation.
2019-01-18 14:19:30 -08:00
Henry de Valence
a62571b003
Reduce field elements during conversion to vector form.
...
The IFMA types have tighter bounds than the u64 types.
2019-01-18 14:19:30 -08:00
Henry de Valence
3f21bb3b58
Add skeleton of parallel Edwards formulas.
2019-01-18 14:19:30 -08:00
Henry de Valence
5880fced2b
Add skeleton of shuffle and blend functions.
2019-01-18 14:19:30 -08:00
Henry de Valence
d90bb779ca
Delay all computations using x[0], y[0]
...
Since computation of the 0 term in reduction requires a multiplication with a
4-cycle latency, this ensures that the rest of the computation can start before
the 0 term is finished
2019-01-18 14:19:30 -08:00
Henry de Valence
c925c76342
Change the strategy for reducing the high half of the product.
2019-01-18 14:19:30 -08:00
Henry de Valence
607b839032
Change size of limbs in the reduction test.
2019-01-18 14:19:30 -08:00
Henry de Valence
14163131f9
Lift the reduction state of the field elements into the type system.
...
This splits the `FieldElement51x4` type into two types:
- `F51x4Reduced` (with reduced limbs)
- `F51x4Unreduced` (with unreduced limbs)
The reduction is implemented as a `From` impl to convert one type to the other.
The output of a multiplication is now a `F51x4Unreduced`. The reason is that
the inputs to IFMA operations must be at most 52 bits, so it's not possible to
perform an addition of (51+epsilon)-bit values and still be small enough to be
used as an input to multiplication. So, it doesn't make sense to perform a
reduction at the end of a multiplication, because the reduced values will be
fed into an addition or subtraction, which then needs to be re-reduced.
2019-01-18 14:19:30 -08:00
Henry de Valence
ff49673214
Add impl Mul<(u32, u32, u32, u32)> for FieldElement51x4.
2019-01-18 14:19:30 -08:00
Henry de Valence
70199d6094
Add impl Mul<FieldElement51x4> for FieldElement51x4.
2019-01-18 14:19:30 -08:00
Henry de Valence
aa73d7b1bc
Add a FieldElement51x4 type.
2019-01-18 14:19:30 -08:00
Henry de Valence
9ed2128a10
Add stub code for IFMA intrinsics in Rust.
2019-01-18 01:52:17 -08:00
