Efficient computation of multiplicative inverses for cryptographic applications

Proceedings - Symposium on Computer Arithmetic

Volumn , Issue , 2001, Pages 66-72

  Hasan, M A ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; CRYPTOGRAPHY; ELECTRIC INVERTERS; INVERSE PROBLEMS; MULTIPLYING CIRCUITS; POLYNOMIALS;

MULTI PRECISION FORMAT; MULTIPLICATIVE INVERSES;

DIGITAL ARITHMETIC;

EID: 0034870562     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. m)
2. m)
3. m)
4. m)
5. m)
6. m)
7. Fast inverter over finite field based on Euclid's algorithm
8. n)
9. Public-key cryptosystems with very small key lengths
10. n)
11. An algorithm for solving discrete-time wiener-hopf equations based on Euclid's algorithm
12. Use of elliptic curves in cryptography
13. Elliptic curve cryptosystems
14. Software implementation of elliptic curve cryptography over binary fields