Method for calculating arithmetic inverse over finite fields for use in cryptography
US6763366B2 · kind B2 · utility
6Cited by
1References
15Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | May 17, 2001 |
| Grant date | Jul 13, 2004 |
| Priority date | — |
| Expiry date | Jun 24, 2022 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F7/727
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A method for calculating greatest common divisors and modular inverses using the extended Jebelean GCD algorithm keeps track of the number of times that U3 and V3 have been divided by two in the process of calculating the greatest common divisor and correct the modular inverse for these divisions. The shifting of the binary values representing U3 that occurs during the calculation of the GCD is accomplished by changing the position of respective pointers to bit positions in the binary values rather than implementing a shifting operation.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.