Journal ArticleDOI
Low latency flexible FPGA implementation of point multiplication on elliptic curves over GF(p)
Reads0
Chats0
About:
This article is published in International Journal of Circuit Theory and Applications.The article was published on 2017-02-01. It has received 38 citations till now. The article focuses on the topics: Elliptic curve cryptography & Multiplication.read more
Citations
More filters
Journal ArticleDOI
FPGA Implementation of High-Speed Area-Efficient Processor for Elliptic Curve Point Multiplication Over Prime Field
TL;DR: In this article, a high-speed elliptic curve cryptographic (ECC) processor that performs fast point multiplication with low hardware utilization is presented, which is a crucial demand in the fields of cryptography and network security.
Proceedings ArticleDOI
PipeZK: accelerating zero-knowledge proof with a pipelined architecture
Ye Zhang,Shuo Wang,Xian Zhang,Jiangbin Dong,Xingzhong Mao,Fan Long,Cong Wang,Dong Zhou,Mingyu Gao,Guangyu Sun +9 more
TL;DR: PipeZK as mentioned in this paper is a pipelined accelerator with two subsystems to handle the aforementioned two intensive compute tasks, respectively, which can achieve 10x speedup on standard cryptographic benchmarks, and 5x on a widely-used cryptocurrency application, Zcash.
Journal ArticleDOI
High-speed FPGA implementation of full-word Montgomery multiplier for ECC applications
TL;DR: The proposed MM design is able to compute modular multiplication for the Elliptic Curve Cryptography (ECC) field sizes of 192–512 bits and utilizes the least hardware resources in the known literature.
Journal ArticleDOI
A high-speed RSD-based flexible ECC processor for arbitrary curves over general prime field
TL;DR: A novel high‐speed redundant‐signed‐digit (RSD)‐based elliptic curve cryptographic (ECC) processor for arbitrary curves over a general prime field based on a new high speed Montgomery multiplier architecture which uses different parallel computation techniques at both circuit level and architectural level.
Journal ArticleDOI
A High-Performance Elliptic Curve Cryptographic Processor of SM2 over GF(p)
TL;DR: A two-stage fast reduction algorithm (TSFR) over SCA-256 prime field is proposed, which can obtain an intermediate result of 0 ≤ Z < 2 p instead of 0 ≥ Z < 14 p in traditional algorithm, avoiding a lot of repetitive subtraction operations.
References
More filters
Journal ArticleDOI
A method for obtaining digital signatures and public-key cryptosystems
TL;DR: An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key.
Book ChapterDOI
Differential Power Analysis
TL;DR: In this paper, the authors examine specific methods for analyzing power consumption measurements to find secret keys from tamper resistant devices. And they also discuss approaches for building cryptosystems that can operate securely in existing hardware that leaks information.
Journal ArticleDOI
Elliptic curve cryptosystems
TL;DR: The question of primitive points on an elliptic curve modulo p is discussed, and a theorem on nonsmoothness of the order of the cyclic subgroup generated by a global point is given.
Book ChapterDOI
Use of Elliptic Curves in Cryptography
TL;DR: In this paper, an analogue of the Diffie-Hellmann key exchange protocol was proposed, which appears to be immune from attacks of the style of Western, Miller, and Adleman.
Book ChapterDOI
Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
TL;DR: By carefully measuring the amount of time required to perform private key operalions, attackers may be able to find fixed Diffie-Hellman exponents, factor RSA keys, and break other cryptosystems.