Apparatus for processing modular multiply operation and methods thereof
US-11509454-B2 · Nov 22, 2022 · US
Modulo N arithmetic, with N being either (2**n)-1,2**n or (2**n)+1, e.g. mod 3, mod 4 or mod 5 (G06F7/728 takes precedence)
Modulo N arithmetic, with N being either (2**n)-1,2**n or (2**n)+1, e.g. mod 3, mod 4 or mod 5 (G06F7/728 takes precedence) · Cooperative Patent Classification (CPC)
Computing, optics, measurement, and control technologies.
Related technology areas
Mapped technology topics for this CPC code.
| Metric | Value |
|---|---|
| CPC code | G06F7/727 |
| Official title | {Modulo N arithmetic, with N being either (2**n)-1,2**n or (2**n)+1, e.g. mod 3, mod 4 or mod 5 (G06F7/728 takes precedence)} |
| Display label | Modulo N arithmetic, with N being either (2**n)-1,2**n or (2**n)+1, e.g. mod 3, mod 4 or mod 5 (G06F7/728 takes precedence) |
| Total patents | 127 |
Filing trend
Year-over-year patent counts classified under this CPC code.
Filing activity over the last five years is declining.
| Year | Patents |
|---|---|
| 2015 | 2 |
| 2016 | 3 |
| 2017 | 5 |
| 2018 | 12 |
| 2019 | 8 |
| 2020 | 10 |
| 2021 | 18 |
| 2022 | 22 |
| 2023 | 17 |
| 2024 | 17 |
| 2025 | 10 |
| 2026 | 3 |
Representative patents
Representative publications under this CPC code from precomputed stats, or recent filings when stats are unavailable.
System and method for mapping memory addresses to locations in set-associative caches
US-11416405-B1 · Aug 16, 2022 · US
Circuit, apparatus and method for calculating multiplicative inverse
US-2021390443-A1 · Dec 16, 2021 · US
Data encryption and decryption
US-2021376999-A1 · Dec 2, 2021 · US
Information processing apparatus, secret calculation method, and program
US-2021351916-A1 · Nov 11, 2021 · US
Process for digital signing of a document with a predetermined secret key
US-11102012-B2 · Aug 24, 2021 · US
Data encryption and decryption
US-11101977-B2 · Aug 24, 2021 · US
Method for determining a modular inverse and associated cryptographic processing device
US-11029922-B2 · Jun 8, 2021 · US
Data encryption and decryption
US-2021160049-A1 · May 27, 2021 · US
Bit decomposition secure computation apparatus, bit combining secure computation apparatus, method and program
US-2021157955-A1 · May 27, 2021 · US
Device and method for extraction and insertion of binary words
US-2021109713-A1 · Apr 15, 2021 · US
Logic simulation of circuit designs using on-the-fly bit reduction for constraint solving
US-2021089695-A1 · Mar 25, 2021 · US
Implicit rsa certificates
US-2021091948-A1 · Mar 25, 2021 · US
Performing constant modulo arithmetic
US-2021081178-A1 · Mar 18, 2021 · US
Random accessible image data compression
US-2021074028-A1 · Mar 11, 2021 · US
Image data decompression
US-2021074026-A1 · Mar 11, 2021 · US
Image data compression
US-2021074027-A1 · Mar 11, 2021 · US
Methods and decompression units for decompressing a compressed block of image data
US-2021056731-A1 · Feb 25, 2021 · US
Secret calculation system, secret calculation apparatus, and secret calculation method
US-10924270-B2 · Feb 16, 2021 · US
Data encryption and decryption
US-10911216-B2 · Feb 2, 2021 · US
Frequently asked questions
Answers are generated from the same data shown on this page.
- What is CPC G06F7/727?
- CPC G06F7/727 is the Cooperative Patent Classification code for “Modulo N arithmetic, with N being either (2**n)-1,2**n or (2**n)+1, e.g. mod 3, mod 4 or mod 5 (G06F7/728 takes precedence).”
- How many patents are filed under CPC G06F7/727 (Modulo N arithmetic, with N being either (2**n)-1,2**n or (2**n)+1, e.g. mod 3, mod 4 or mod 5 (G06F7/728 takes precedence))?
- Our database includes 127 publications tagged with this CPC code.
- Is patent activity under CPC G06F7/727 growing?
- Publication counts under this code: 17 in 2024 vs 10 in 2025 (latest complete years).