Realization of coprocessor which supports counting of discrete logarithm on elliptic curves with partial knowledge
In this paper we analyse realization of a coprocessor which supports counting of discrete logarithm on elliptic curves over the field FG(p), where p is the large prime, in FPGA. Main idea of the realization is based on using modules which are able to add the points and have relatively small resource...
Main Authors: | Michał Kędzierski, Michał Misztal, Michał Wroński |
---|---|
Format: | Article |
Language: | English |
Published: |
Military University of Technology, Warsaw
2017-12-01
|
Series: | Biuletyn Wojskowej Akademii Technicznej |
Subjects: | |
Online Access: | http://biuletynwat.pl/gicid/01.3001.0010.8185 |
Similar Items
-
A NEW PROPOSED METHOD FOR SOLVING AN ELLIPTIC CURVE DISCRETE LOGARITHM PROBLEM
by: Ammar Ali Neamah
Published: (2012-12-01) -
How to Compute an Isogeny on the Extended Jacobi Quartic Curves?
by: Łukasz Dzierzkowski, et al.
Published: (2022-09-01) -
Evaluation of Computational Approaches of Short Weierstrass Elliptic Curves for Cryptography
by: Abhishek Kunal, et al.
Published: (2021-12-01) -
Quantum Circuit Optimization for Solving Discrete Logarithm of Binary Elliptic Curves Obeying the Nearest-Neighbor Constrained
by: Jianmei Liu, et al.
Published: (2022-07-01) -
Attribute-Based Blind Signature Scheme Based on Elliptic Curve Cryptography
by: Rui Ma, et al.
Published: (2022-01-01)