Montgomery Reduction in Cryptographic Operations Patent Application
Summary
The USPTO has published a patent application (US20260086772A1) for a method and apparatus for performing Montgomery reduction in cryptographic operations. The application, filed by inventor Wieland Fischer, details a process for optimizing cryptographic calculations by approximating intermediate products.
What changed
The United States Patent and Trademark Office (USPTO) has published a patent application, US20260086772A1, concerning an apparatus and method for Montgomery reduction in cryptographic operations. The invention focuses on optimizing cryptographic calculations by performing an incomplete multiplication to obtain an approximated product, determining a sum by adding parts of the input and approximated product, and then calculating a carry to adjust the input or a derived value. This method is particularly relevant for Montgomery multiplication, a key component in many public-key cryptosystems.
This publication represents a new patent application and does not impose any immediate regulatory obligations or compliance deadlines on entities. However, it signifies potential advancements in cryptographic technology. Companies involved in developing or implementing cryptographic algorithms, particularly those in the cybersecurity and technology sectors, may wish to review the application for insights into novel approaches to secure computation. The filing date was September 24, 2025, with a publication date of March 26, 2026.
Archived snapshot
Mar 26, 2026GovPing captured this document from the original source. If the source has since changed or been removed, this is the text as it existed at that time.
Montgomery Reduction in Cryptographic Operations
Application US20260086772A1 Kind: A1 Mar 26, 2026
Inventors
Wieland Fischer
Abstract
An apparatus and a method for performing a Montgomery reduction of an input C modulo a modulus N, in particular in the framework of a Montgomery multiplication, comprising: (i) performing a multiplication to obtain an approximated product Y on the basis of a value D and the modulus N, wherein only a higher-order part of the approximated product Y is computed and/or approximated on the basis of an incomplete execution of the multiplication, and wherein the value D is derived from the input C and an auxiliary integer N′ of the Montgomery reduction, (ii) determining a sum by adding a word or partial word of the input C to a word or partial word of the approximated product Y, (iii) determining a carry on the basis of the sum, and (iv) adding the carry to the input C or to a value derived from the input C.
CPC Classifications
G06F 7/728 H04L 9/3247
Filing Date
2025-09-24
Application No.
19339173
Named provisions
Related changes
Get daily alerts for USPTO Patent Applications - Networking (H04L)
Daily digest delivered to your inbox.
Free. Unsubscribe anytime.
Source
About this page
Every important government, regulator, and court update from around the world. One place. Real-time. Free. Our mission
Source document text, dates, docket IDs, and authority are extracted directly from USPTO.
The summary, classification, recommended actions, deadlines, and penalty information are AI-generated from the original text and may contain errors. Always verify against the source document.
Classification
Who this affects
Taxonomy
Browse Categories
Get alerts for this source
We'll email you when USPTO Patent Applications - Networking (H04L) publishes new changes.
Subscribed!
Optional. Filters your digest to exactly the updates that matter to you.