Search - elliptic curve

Search - elliptic curve - List

[VHDL-FPGA-Verilog] K163_addition DL : 0: elliptic curve in GF2m
Date : 2025-12-22 Size : 1kb User : endah
[VHDL-FPGA-Verilog] K163_point_multiplication DL : 0: elliptic curve in GF2m
Date : 2025-12-22 Size : 2kb User : endah
[VHDL-FPGA-Verilog] ecp233_1 DL : 0: elliptic curve processor b-233, include test bench & test vector.
Date : 2025-12-22 Size : 89kb User : tiger
[VHDL-FPGA-Verilog] Handbook_elliptic_curve_cryptography DL : 0: A wnice to guide to stat Elliptic Curve Cryptography
Date : 2025-12-22 Size : 4.98mb User : kalidas
[VHDL-FPGA-Verilog] -Elliptic DL : 0: We present elliptic curve cryptography (ECC) coprocessor, which is dual-field processor with projective coordinator. We have implemented architecture for scalar multiplication, which is key operation in elliptic curve cryptography. Our coprocessor can be adapted both prime field and binary field, also contains a control unit with 256 bit serial and parallel operations , which provide integrated highthroughput with low power consumptions. Our scalar multiplier architecture operation is perform base on clock rate and produce better performance in term of time and area compared to similar works. We used Verilog for programming and synthesized using Xilinx Vertex II Pro devices. Simulation was done with Modelsim XE 6.1e, VLSI simulation software from Mentor Graphics Corporation especially for Xilinx devices.
Date : 2025-12-22 Size : 114kb User : 陳曉慧
[VHDL-FPGA-Verilog] Elliptic_Curve_Group_latest.tar DL : 0: 椭圆曲线群的核心是计算在椭圆曲线群的两个元素的加入，并在椭圆曲线组相同的元素的加入。-The Elliptic Curve Group core is for computing the addition of two elements in the elliptic curve group, and the addition of identical elements in the elliptic curve group.
Date : 2025-12-22 Size : 567kb User : ke
[VHDL-FPGA-Verilog] Tate_Bilinear_Pairing_latest.tar DL : 0: The Tate Bilinear Pairing core is for calculating Tate bilinear pairing especially on super-singular elliptic curve in affine coordinates defined over a Galois field , whose irreducible polynomial is . (For improving security, an irreducible polynomial with higher degree might be used in the future.) -The Tate Bilinear Pairing core is for calculating Tate bilinear pairing especially on super-singular elliptic curve in affine coordinates defined over a Galois field , whose irreducible polynomial is . (For improving security, an irreducible polynomial with higher degree might be used in the future.)
Date : 2025-12-22 Size : 482kb User : ke