diff options
author | Pavel V. Shatov (Meister) <meisterpaul1@yandex.ru> | 2018-04-17 15:19:27 +0300 |
---|---|---|
committer | Pavel V. Shatov (Meister) <meisterpaul1@yandex.ru> | 2018-04-17 15:19:27 +0300 |
commit | 22a7960018891d7e451eca36ec2a5ae558bf9280 (patch) | |
tree | 4e6221beea9b37b205c9fc03dd3c86062d9a5e4e | |
parent | 4e0581c98e289e79af09d95b747f9932a14c89fd (diff) |
-rw-r--r-- | README.md | 2 |
1 files changed, 1 insertions, 1 deletions
@@ -68,7 +68,7 @@ Buffer for the 256-bit multiplication factor (multiplier) K. The core will compu * **XIN0**-**XIN7**, **YIN0**-**YIN7** Writeable buffers for the 256-bit coordinates X and Y of the input multiplicand P(XIN, YIN). Values should be in affine coordinates. XIN0 and YIN0 contain the least significant 32-bit words, i.e. bits [31:0], while XIN7 and YIN7 contain the most significant 32-bit words, i.e. bits [255:224]. Fill the buffers with coordinates of the base point during public key generation and during multiplication by the per-message (random) number. Fill the buffers with coordinates of Bob's public key to derive Alice's copy of the shared secret key. - * **XIN0**-**XIN7**, **YIN0**-**YIN7** + * **XOUT0**-**XOUT7**, **YOUT0**-**YOUT7** Read-only buffers for the 256-bit coordinates X and Y of the product R(XOUT, YOUT). Values are returned in affine coordinates. XOUT0 and YOUT0 contain the least significant 32-bit words, i.e. bits [31:0], while XOUT7 and YOUT7 contain the most significant 32-bit words, i.e. bits [255:224]. ## Implementation Details |