From 22a7960018891d7e451eca36ec2a5ae558bf9280 Mon Sep 17 00:00:00 2001 From: "Pavel V. Shatov (Meister)" Date: Tue, 17 Apr 2018 15:19:27 +0300 Subject: Fixed readme file. --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 755f822..e8897e4 100644 --- a/README.md +++ b/README.md @@ -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 -- cgit v1.2.3