G06F 2207/728
Using repeated square-and-multiply, i.e. right-to-left binary exponentiation
Official title: using repeated square-and-multiply, i.e. right-to-left binary exponentiation
G06F2207/728 (Using repeated square-and-multiply, i.e. right-to-left binary exponentiation) appears on 1 US grants and 3 published applications in this corpus.
Search patents in G06F- Granted patents
- 1
- Published applications
- 3
- Assignees
- 1
- Inventors
- 5
- Latest grant
- 23 Jan 2007
Filings by year
| Year | Granted patents | Published applications |
|---|---|---|
| 2003 | 0 | 1 |
| 2004 | 0 | 1 |
| 2005 | 0 | 1 |
| 2006 | 0 | 0 |
| 2007 | 1 | 0 |
By publication year.
Recent patents
- Emod a fast modulus calculation for computer systems3 Nov 2005US 2005/0246406 A9Intel Corporation
- Method for protecting public key schemes from timing, power and fault attacks1 Jul 2004US 2004/0125950 A1
- Emod a fast modulus calculation for computer systems25 Sep 2003US 2003/0182339 A1Intel Corporation
Most cited
By later US patents