G06F 7/72
Using residue arithmetic
Official title: using residue arithmetic
G06F7/72 (Using residue arithmetic) appears on 1,537 US grants and 1,381 published applications in this corpus.
Search patents in G06F- Granted patents
- 1,537
- Published applications
- 1,381
- Assignees
- 487
- Inventors
- 1,993
- Latest grant
- 15 Sep 2026
Filings by year
| Year | Granted patents | Published applications |
|---|---|---|
| 1977 | 4 | 0 |
| 1978 | 2 | 0 |
| 1979 | 2 | 0 |
| 1980 | 3 | 0 |
| 1981 | 2 | 0 |
| 1982 | 3 | 0 |
| 1983 | 0 | 0 |
| 1984 | 3 | 0 |
| 1985 | 6 | 0 |
| 1986 | 5 | 0 |
| 1987 | 4 | 0 |
| 1988 | 4 | 0 |
| 1989 | 12 | 0 |
| 1990 | 8 | 0 |
| 1991 | 11 | 0 |
| 1992 | 14 | 0 |
| 1993 | 12 | 0 |
| 1994 | 12 | 0 |
| 1995 | 14 | 0 |
| 1996 | 19 | 0 |
| 1997 | 21 | 0 |
| 1998 | 30 | 0 |
| 1999 | 34 | 0 |
| 2000 | 33 | 0 |
| 2001 | 39 | 13 |
| 2002 | 40 | 74 |
| 2003 | 40 | 82 |
| 2004 | 44 | 91 |
| 2005 | 41 | 59 |
| 2006 | 66 | 63 |
| 2007 | 56 | 59 |
| 2008 | 47 | 70 |
| 2009 | 61 | 98 |
| 2010 | 62 | 68 |
| 2011 | 78 | 53 |
| 2012 | 71 | 51 |
| 2013 | 84 | 45 |
| 2014 | 71 | 43 |
| 2015 | 49 | 31 |
| 2016 | 36 | 32 |
| 2017 | 28 | 34 |
| 2018 | 33 | 43 |
| 2019 | 45 | 42 |
| 2020 | 34 | 46 |
| 2021 | 40 | 56 |
| 2022 | 65 | 55 |
| 2023 | 40 | 63 |
| 2024 | 46 | 53 |
| 2025 | 39 | 27 |
| 2026 | 24 | 30 |
By publication year. Applications have been published since 2001. 2026 runs to 8 Oct.
Subgroups
Granted patents
- G06F 7/724Finite field arithmetic796
- G06F 7/723Modular exponentiation230
- G06F 7/728Using montgomery reduction210
- G06F 7/722Modular multiplication144
- G06F 7/727Modulo n arithmetic, with n being either -1,2**n or +1103
- G06F 7/729Using representation by a residue number system70
- G06F 7/721Modular inversion, reciprocal or quotient calculation52
Recent patents
- Hardware-based Galois multiplication15 Sep 2026US 12,737,155 B2International Business Machines Corporation
- Computer-implemented system and method for trustless zero-knowledge contingent payment15 Sep 2026US 12,737,753 B2nChain Licensing AG
- Adding scalar blinding in elliptic curve cryptography8 Sep 2026US 12,732,365 B1Synopsys, Inc.
- Parallel finite field multiplication device1 Sep 2026US 12,724,587 B2Shenzhen Pango Microsystems Co., Ltd
- Modulo operations for interleaved memory having non-power-of-two channels25 Aug 2026US 12,717,708 B2Arteris, Inc.
- Grand unified modular arithmetic framework8 Oct 2026US 2026/0310415 A1
- Zero-free self-contained computing system8 Oct 2026US 2026/0310416 A1
- Grand unified modular arithmetic framework8 Oct 2026US 2026/0310417 A1
- Zero-free self-contained computing system8 Oct 2026US 2026/0310418 A1
- Generation of prime numbers subject to an auxiliary condition in cryptographic applications8 Oct 2026US 2026/0312807 A1Cryptography Research, Inc.
Most cited
By later US patents
- Enhanced cryptographic system and method with key escrow feature345US 6,009,177 ACertCo LLC · 1999
- Multi-step digital signature method and system336US 5,825,880 A1998
- Enhanced cryptographic system and method with key escrow feature311US 5,799,086 ACertCo LLC · 1998
- Efficient finite field multiplication in normal basis258US 6,389,442 B1RSA Security Inc. · 2002
- Devices and methods with programmable logic and digital signal processing regions256US 6,538,470 B1Altera Corporation · 2003