zecfoundation
/
zcash-fpga
mirror of https://github.com/ZcashFoundation/zcash-fpga.git
1
0
Fork 0
Code Issues Projects Releases Wiki Activity

Updates for bls12-381

This commit is contained in:
bsdevlin 2019-05-22 21:32:23 +08:00
parent ef0d531fb8
commit f084de17b0
6 changed files with 96 additions and 205 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
ip_cores/common/src/rtl/pipeline_if.sv
View File

@ -19,6 +19,7 @@
module pipeline_if #(
parameter DAT_BYTS = 8,
parameter DAT_BITS = DAT_BYTS*8,
parameter CTL_BITS = 8,
parameter NUM_STAGES = 1
) (
@ -38,10 +39,11 @@ generate
end else begin
if_axi_stream #(.DAT_BYTS(DAT_BYTS), .CTL_BITS(CTL_BITS)) if_stage [NUM_STAGES:0] (i_if.i_clk) ;
if_axi_stream #(.DAT_BYTS(DAT_BYTS), .DAT_BITS(DAT_BITS), .CTL_BITS(CTL_BITS)) if_stage [NUM_STAGES:0] (i_if.i_clk) ;
for (g0 = 0; g0 < NUM_STAGES; g0++) begin : GEN_STAGE
pipeline_if_single #(
.DAT_BITS(DAT_BITS),
.DAT_BYTS(DAT_BYTS),
.CTL_BITS(CTL_BITS)
)

3
ip_cores/common/src/rtl/pipeline_if_single.sv
View File

@ -19,6 +19,7 @@
module pipeline_if_single #(
parameter DAT_BYTS = 8,
parameter DAT_BITS = DAT_BYTS*8,
parameter CTL_BITS = 8
)(
input i_rst,
@ -27,7 +28,7 @@ module pipeline_if_single #(
);
// Need pipeline stage to store temp data
if_axi_stream #(.DAT_BYTS(DAT_BYTS), .CTL_BITS(CTL_BITS)) if_r (i_if.i_clk);
if_axi_stream #(.DAT_BYTS(DAT_BYTS), .DAT_BITS(DAT_BITS), .CTL_BITS(CTL_BITS)) if_r (i_if.i_clk);
always_ff @ (posedge i_if.i_clk) begin
if (i_rst) begin

109
ip_cores/ec/src/rtl/ec_fp_pkg.sv
View File

@ -1,109 +0,0 @@
/*
Package for Fp fields
Copyright (C) 2019 Benjamin Devlin and Zcash Foundation
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
package ec_fp_pkg;
// Expected to be in Jacobian coordinates
typedef struct packed {
logic [255:0] x, y, z;
} jb_point_t;
function is_zero(jb_point_t p);
is_zero = (p.x == 0 && p.y == 0 && p.z == 1);
return is_zero;
endfunction
// Function to double point in Jacobian coordinates (for comparison in testbench)
// Here a is 0, and we also mod the result
function jb_point_t dbl_jb_point(jb_point_t p, input logic [1023:0] mod);
logic signed [1023:0] I_X, I_Y, I_Z, A, B, C, D, X, Y, Z;
if (p.z == 0) return p;
I_X = p.x;
I_Y = p.y;
I_Z = p.z;
A = (I_Y*I_Y) % mod;
B = (((4*I_X) % mod)*A) % mod;
C = (((8*A) % mod)*A) % mod;
D = (((3*I_X)% mod)*I_X) % mod;
X = (D*D)% mod;
X = X + ((2*B) % mod > X ? mod : 0) - (2*B) % mod;
Y = (D*((B + (X > B ? mod : 0)-X) % mod)) % mod;
Y = Y + (C > Y ? mod : 0) - C;
Z = (((2*I_Y)% mod)*I_Z) % mod;
dbl_jb_point.x = X;
dbl_jb_point.y = Y;
dbl_jb_point.z = Z;
return dbl_jb_point;
endfunction
function jb_point_t add_jb_point(jb_point_t p1, p2, input logic [1023:0] mod);
logic signed [1023:0] A, U1, U2, S1, S2, H, H3, R;
if (p1.z == 0) return p2;
if (p2.z == 0) return p1;
if (p1.y == p2.y && p1.x == p2.x)
return (dbl_jb_point(p1));
U1 = p1.x*p2.z % mod;
U1 = U1*p2.z % mod;
U2 = p2.x*p1.z % mod;
U2 = U2 *p1.z % mod;
S1 = p1.y *p2.z % mod;
S1 = (S1*p2.z % mod) *p2.z % mod;
S2 = p2.y * p1.z % mod;
S2 = (S2*p1.z % mod) *p1.z % mod;
H = U2 + (U1 > U2 ? mod : 0) -U1;
R = S2 + (S1 > S2 ? mod : 0) -S1;
H3 = ((H * H %mod ) * H ) % mod;
A = (((2*U1 % mod) *H % mod) * H % mod);
add_jb_point.z = ((H * p1.z % mod) * p2.z) % mod;
add_jb_point.x = R*R % mod;
add_jb_point.x = add_jb_point.x + (H3 > add_jb_point.x ? mod : 0) - H3;
add_jb_point.x = add_jb_point.x + (A > add_jb_point.x ? mod : 0) - A;
A = (U1*H % mod) * H % mod;
A = A + (add_jb_point.x > A ? mod : 0) - add_jb_point.x;
A = A*R % mod;
add_jb_point.y = S1*H3 % mod;
add_jb_point.y = A + (add_jb_point.y > A ? mod : 0) - add_jb_point.y;
endfunction
function on_curve(jb_point_t p);
return (p.y*p.y - p.x*p.x*p.x - secp256k1_pkg::a*p.x*p.z*p.z*p.z*p.z - secp256k1_pkg::b*p.z*p.z*p.z*p.z*p.z*p.z);
endfunction
function print_jb_point(jb_point_t p);
$display("x:%h", p.x);
$display("y:%h", p.y);
$display("z:%h", p.z);
return;
endfunction
endpackage

2
ip_cores/util/src/rtl/packet_arb.sv
View File

@ -21,6 +21,7 @@
module packet_arb # (
parameter DAT_BYTS,
parameter DAT_BITS = DAT_BYTS*8,
parameter CTL_BITS,
parameter NUM_IN,
parameter OVR_WRT_BIT = CTL_BITS - $clog2(NUM_IN), // What bits in ctl are overwritten with channel id
@ -33,7 +34,6 @@ module packet_arb # (
if_axi_stream.source o_axi
);
localparam DAT_BITS = DAT_BYTS*8;
localparam MOD_BITS = $clog2(DAT_BYTS);
logic [$clog2(NUM_IN)-1:0] idx;

4
ip_cores/util/src/rtl/resource_share.sv
View File

@ -37,6 +37,7 @@ module resource_share # (
// Arbitratation to the resource
packet_arb # (
.DAT_BITS ( i_axi[0].DAT_BITS ),
.DAT_BYTS ( i_axi[0].DAT_BYTS ),
.CTL_BITS ( i_axi[0].CTL_BITS ),
.NUM_IN ( NUM_IN ),
@ -52,7 +53,7 @@ packet_arb_mult (
);
// Demuxing
if_axi_stream #(.DAT_BYTS(i_res.DAT_BYTS), .CTL_BITS(i_res.CTL_BITS)) int_axi [NUM_IN-1:0] (i_res.i_clk);
if_axi_stream #(.DAT_BYTS(i_res.DAT_BYTS), .DAT_BITS(i_res.DAT_BITS), .CTL_BITS(i_res.CTL_BITS)) int_axi [NUM_IN-1:0] (i_res.i_clk);
genvar gen0;
logic [NUM_IN-1:0] rdy;
@ -66,6 +67,7 @@ generate
end
pipeline_if #(
.DAT_BITS ( i_res.DAT_BITS ),
.DAT_BYTS ( i_res.DAT_BYTS ),
.CTL_BITS ( i_res.CTL_BITS ),
.NUM_STAGES ( PIPELINE_OUT )

179
zcash_fpga/src/rtl/bls12_381/bls12_381_pkg.sv
View File

@ -18,103 +18,98 @@
*/
package bls12_381_pkg;
localparam DAT_BITS = 381;
localparam [DAT_BITS-1:0] P = 381'h1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaab;
localparam [DAT_BITS-1:0] Gx = 381'h17F1D3A73197D7942695638C4FA9AC0FC3688C4F9774B905A14E3A3F171BAC586C55E83FF97A1AEFFB3AF00ADB22C6BB;
localparam [DAT_BITS-1:0] Gy = 381'h08B3F481E3AAA0F1A09E30ED741D8AE4FCF5E095D5D00AF600DB18CB2C04B3EDD03CC744A2888AE40CAA232946C5E7E1;
parameter [380:0] P = 381'h1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaab;
parameter [380:0] Gx = 381'h17F1D3A73197D7942695638C4FA9AC0FC3688C4F9774B905A14E3A3F171BAC586C55E83FF97A1AEFFB3AF00ADB22C6BB;
parameter [380:0] Gy = 381'h08B3F481E3AAA0F1A09E30ED741D8AE4FCF5E095D5D00AF600DB18CB2C04B3EDD03CC744A2888AE40CAA232946C5E7E1;
// Expected to be in Jacobian coordinates
// Jacobian coordinates
typedef struct packed {
logic [255:0] x, y, z;
logic [DAT_BITS-1:0] x, y, z;
} jb_point_t;
jb_point_t g_point = {x:Gx, y:Gy, z:1};
function is_zero(jb_point_t p);
is_zero = (p.x == 0 && p.y == 0 && p.z == 1);
return is_zero;
endfunction
// Function to double point in Jacobian coordinates (for comparison in testbench)
// Here a is 0, and we also mod p the result
function jb_point_t dbl_jb_point(jb_point_t p);
logic signed [512:0] I_X, I_Y, I_Z, A, B, C, D, X, Y, Z;
if (p.z == 0) return p;
I_X = p.x;
I_Y = p.y;
I_Z = p.z;
A = (I_Y*I_Y) % P;
B = (((4*I_X) % P)*A) % P;
C = (((8*A) % P)*A) % P;
D = (((3*I_X)% P)*I_X) % P;
X = (D*D)% P;
X = X + ((2*B) % P > X ? P : 0) - (2*B) % P;
Y = (D*((B + (X > B ? P : 0)-X) % P)) % P;
Y = Y + (C > Y ? P : 0) - C;
Z = (((2*I_Y)% P)*I_Z) % P;
dbl_jb_point.x = X;
dbl_jb_point.y = Y;
dbl_jb_point.z = Z;
return dbl_jb_point;
endfunction
function jb_point_t add_jb_point(jb_point_t p1, p2);
logic signed [512:0] A, U1, U2, S1, S2, H, H3, R;
if (p1.z == 0) return p2;
if (p2.z == 0) return p1;
if (p1.y == p2.y && p1.x == p2.x)
return (dbl_jb_point(p1));
U1 = p1.x*p2.z % P;
U1 = U1*p2.z % P;
U2 = p2.x*p1.z % P;
U2 = U2 *p1.z % P;
S1 = p1.y *p2.z % P;
S1 = (S1*p2.z % P) *p2.z % P;
S2 = p2.y * p1.z % P;
S2 = (S2*p1.z % P) *p1.z % P;
H = U2 + (U1 > U2 ? P : 0) -U1;
R = S2 + (S1 > S2 ? P : 0) -S1;
//$display("R = %x", R);
//$display("H = %x", H);
//$display("H^2 = %x", (H * H %P ));
H3 = ((H * H %P ) * H ) % P;
A = (((2*U1 % P) *H % P) * H % P);
add_jb_point.z = ((H * p1.z % P) * p2.z) % P;
add_jb_point.x = R*R % P;
//$display("R^2 = %x", add_jb_point.x);
//$display("H^3 = %x", H3);
add_jb_point.x = add_jb_point.x + (H3 > add_jb_point.x ? P : 0) - H3;
add_jb_point.x = add_jb_point.x + (A > add_jb_point.x ? P : 0) - A;
A = (U1*H % P) * H % P;
A = A + (add_jb_point.x > A ? P : 0) - add_jb_point.x;
A = A*R % P;
add_jb_point.y = S1*H3 % P;
add_jb_point.y = A + (add_jb_point.y > A ? P : 0) - add_jb_point.y;
endfunction
function on_curve(jb_point_t p);
return 0;
endfunction
function print_jb_point(jb_point_t p);
$display("x:%h", p.x);
$display("y:%h", p.y);
$display("z:%h", p.z);
return;
endfunction
// Function to double point in Jacobian coordinates (for comparison in testbench)
// Here a is 0, and we also mod the result
function jb_point_t dbl_jb_point(input jb_point_t p);
logic signed [1023:0] I_X, I_Y, I_Z, A, B, C, D, X, Y, Z;
if (p.z == 0) return p;
I_X = p.x;
I_Y = p.y;
I_Z = p.z;
A = (I_Y*I_Y) % P;
B = (((4*I_X) % P)*A) % P;
C = (((8*A) % P)*A) % P;
D = (((3*I_X)% P)*I_X) % P;
X = (D*D)% P;
X = X + ((2*B) % P > X ? P : 0) - (2*B) % P;
Y = (D*((B + (X > B ? P : 0)-X) % P)) % P;
Y = Y + (C > Y ? P : 0) - C;
Z = (((2*I_Y)% P)*I_Z) % P;
dbl_jb_point.x = X;
dbl_jb_point.y = Y;
dbl_jb_point.z = Z;
return dbl_jb_point;
endfunction
function jb_point_t add_jb_point(jb_point_t p1, p2);
logic signed [1023:0] A, U1, U2, S1, S2, H, H3, R;
if (p1.z == 0) return p2;
if (p2.z == 0) return p1;
if (p1.y == p2.y && p1.x == p2.x)
return (dbl_jb_point(p1));
U1 = p1.x*p2.z % P;
U1 = U1*p2.z % P;
U2 = p2.x*p1.z % P;
U2 = U2 *p1.z % P;
S1 = p1.y *p2.z % P;
S1 = (S1*p2.z % P) *p2.z % P;
S2 = p2.y * p1.z % P;
S2 = (S2*p1.z % P) *p1.z % P;
H = U2 + (U1 > U2 ? P : 0) -U1;
R = S2 + (S1 > S2 ? P : 0) -S1;
H3 = ((H * H %P ) * H ) % P;
A = (((2*U1 % P) *H % P) * H % P);
add_jb_point.z = ((H * p1.z % P) * p2.z) % P;
add_jb_point.x = R*R % P;
add_jb_point.x = add_jb_point.x + (H3 > add_jb_point.x ? P : 0) - H3;
add_jb_point.x = add_jb_point.x + (A > add_jb_point.x ? P : 0) - A;
A = (U1*H % P) * H % P;
A = A + (add_jb_point.x > A ? P : 0) - add_jb_point.x;
A = A*R % P;
add_jb_point.y = S1*H3 % P;
add_jb_point.y = A + (add_jb_point.y > A ? P : 0) - add_jb_point.y;
endfunction
function on_curve(jb_point_t p);
return (p.y*p.y - p.x*p.x*p.x - secp256k1_pkg::a*p.x*p.z*p.z*p.z*p.z - secp256k1_pkg::b*p.z*p.z*p.z*p.z*p.z*p.z);
endfunction
function print_jb_point(jb_point_t p);
$display("x:%h", p.x);
$display("y:%h", p.y);
$display("z:%h", p.z);
return;
endfunction
endpackage