FPGA implementation of variable precision Euclid’s GCD algorithm
Introduction: Euclid's algorithm is well-known for its efficiency and simple iterative to compute the greatest common divisor (GCD) of two non-negative integers. It contributes to almost all public key cryptographic algorithms over a finite field of arithmetic. This, in turn, has led to increas...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
American Society for Engineering Education
2017
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/61918/1/FPGA%20implementation%20of%20variable%20precision%20Euclid%E2%80%99s%20GCD%20algorithm.pdf http://psasir.upm.edu.my/id/eprint/61918/ http://www.joetsite.com/fpga-implementation-of-variable-precision-euclids-gcd-algorithm/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Universiti Putra Malaysia |
| Language: | English |