New experimental EC implementation (P-256, only 32-bit multiplications, meant for Cortex-M0/M0+).
This commit is contained in:
parent
bf809dfae5
commit
6dd8c51ba7
7 changed files with 1092 additions and 3 deletions
19
src/config.h
19
src/config.h
|
|
@ -60,6 +60,25 @@
|
|||
#define BR_CT_MUL31 1
|
||||
*/
|
||||
|
||||
/*
|
||||
* When BR_CT_MUL15 is enabled, multiplications of 15-bit values (held
|
||||
* in 32-bit words) use an alternate implementation which is slower and
|
||||
* larger than the normal multiplication, but should ensure
|
||||
* constant-time multiplications on most/all architectures where the
|
||||
* basic multiplication is not constant-time.
|
||||
#define BR_CT_MUL15 1
|
||||
*/
|
||||
|
||||
/*
|
||||
* When BR_NO_ARITH_SHIFT is enabled, arithmetic right shifts (with sign
|
||||
* extension) are performed with a sequence of operations which is bigger
|
||||
* and slower than a simple right shift on a signed value. This avoids
|
||||
* relying on an implementation-defined behaviour. However, most if not
|
||||
* all C compilers use sign extension for right shifts on signed values,
|
||||
* so this alternate macro is disabled by default.
|
||||
#define BR_NO_ARITH_SHIFT 1
|
||||
*/
|
||||
|
||||
/*
|
||||
* When BR_USE_URANDOM is enabled, the SSL engine will use /dev/urandom
|
||||
* to automatically obtain quality randomness for seedings its internal
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue