Prosecution Insights
Last updated: July 17, 2026
Application No. 18/449,355

SYSTEM AND METHOD FOR COMPUTING MODERN CRYPTOGRAPHIC PRIMITIVES WITH CLASSIC CRYPTOGRAPHIC INTERFACES

Non-Final OA §101
Filed
Aug 14, 2023
Examiner
SHAW, PETER C
Art Unit
2493
Tech Center
2400 — Computer Networks
Assignee
NXP Semiconductors N.V.
OA Round
4 (Non-Final)
76%
Grant Probability
Favorable
4-5
OA Rounds
6m
Est. Remaining
99%
With Interview

Examiner Intelligence

Grants 76% — above average
76%
Career Allowance Rate
426 granted / 559 resolved
+18.2% vs TC avg
Strong +36% interview lift
Without
With
+35.6%
Interview Lift
resolved cases with interview
Typical timeline
3y 5m
Avg Prosecution
29 currently pending
Career history
604
Total Applications
across all art units

Statute-Specific Performance

§101
2.5%
-37.5% vs TC avg
§103
69.1%
+29.1% vs TC avg
§102
25.6%
-14.4% vs TC avg
§112
2.4%
-37.6% vs TC avg
Black line = Tech Center average estimate • Based on career data from 559 resolved cases

Office Action

§101
DETAILED ACTION Claims 1-26 are pending in this action. Notice of Pre-AIA or AIA Status The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA . Claim Rejections - 35 USC § 101 35 U.S.C. 101 reads as follows: Whoever invents or discovers any new and useful process, machine, manufacture, or composition of matter, or any new and useful improvement thereof, may obtain a patent therefor, subject to the conditions and requirements of this title. Claims 1-26 are rejected under 35 U.S.C. 101 because the claimed invention is directed to a judicial exception without significantly more. Claim recites the judicial exception of the abstract idea of a mathematical concept. See MPEP 2106.04(a). This judicial exception is not integrated into a practical application because there are not details about a real-world context using the described conversion of points from one elliptical curve to another. The claim does not include additional elements that are sufficient to amount to significantly more than the judicial exception because it is not explained in a meaningful way how the invention is improving its application in the context of when in the real world this abstract idea would be applied. See MPEP 2106.04(d). Response to Arguments Applicant’s arguments with respect to the objection to claim 1 has been fully considered as is persuasive. The objection is hereby withdrawn. Applicant's arguments with respect to the rejection of claims 1-26 under 35 U.S.C. 101 have been fully considered but they are not persuasive. As per all claims, Applicant reiterates that the claimed inventions are integrated into a practical application and that there is a real-world problem that is being solved. Applicant points out the instant specification at [0035]-[0036] states a purpose of: “Montgomery curve based elliptic curve primitives and twisted Edwards curve based primitives are important new cryptographic primitives that have been standardized by IETF RFC 8032 and RFC 7748 and recently also in FIPS 186-5 and SP800-186. Both are taking state-of-the-art cryptographic developments into account that were not available in 1999 when the first NIST ECC parameters came out.” Applicant further explains that the invention “allow a high-level user to implement the newly proposed algorithms based on existing cryptographic capabilities and interfaces thus allowing for interoperability with older products.” Based on these past argument points, Applicant argues that “[t]he methods disclosed herein provide clear instructions of how to compute the result of a Montgomery based Diffie-Hellman protocol or the result of a scalar multiplication in EdDSA (rB) when only a Weierstrass implementation is available.” See specification at [0048]-[0049]. Applicant further points out that: “a key-derivation function used in the QuVanstone Implicit Certificate Scheme (ECQV) to derive an elliptic curve scalar K1 from another elliptic curve scalar Ko, to generate cryptographic signatures for Schnorr signature generation and ECDAA signature generation, or to perform operations for an RSA public or private interface.” Applicant further points out that the application: “allows older products that support classical elliptical curve cryptography based on Weierstrass curves arithmetic to compute new standardized protocols which involve more sophisticated parameters and/or arithmetic.” See [0056]-[0057]. Applicant further points out that past case law does not preclude patenting based on a judicial exception as long as it is integrated into a practical application and that one way to demonstrate practical application is improvement and that the claim must reflect the steps and/or components of the improvement but does not need to state the improvement in the claim itself. Examiner agrees that there is an improvement in the specification and agrees with the case law provided by the Applicant. Examiner also completely agrees that the improvement does not need to be explicitly stated in the claim. However, Examiner does not believe that the steps or components of the improvement are clearly stated in claim language. Examiner does note the latest amendment includes: “a first elliptic curve that cannot be updated or changed.” This was most likely was made in light of Examiner’s previous suggestion of a cryptographic processor that was “required” to use a particular elliptic curve. Examiner further notes that “an elliptical curve that cannot be updated” is different than a processor that is required to use a particular elliptical curve. Furthermore, “cannot be updated or changed” doesn’t really doesn’t really convey that this processor is in “an older product that only supports classical elliptical curve cryptography” - which is the critical component in the improvement that would demonstrate a practical application. If the previously suggested “required” language does not work for the Applicant, the claim language still needs to clearly convey the presence of “a legacy product which cannot be updated to handle newer sophisticated cryptography”. In the current form, the rejection of the claims are maintained. Examiner notes that progress has been and hopefully based on the remarks above it is clear to the Applicant what language needs be included to overcome the remaining rejection under 35 U.S.C. 101. However, Examiner is definitely open to conducting an after-final interview to discuss any further issues or concerns. Conclusion The prior art made of record and not relied upon is considered pertinent to applicant's disclosure. Macchetti et al. (WO-2024100108-A1), Brown et al. (US PGPUB No. 2012/0314855), Chan et al. (US PGPUB No. 2020/0186346), Gutoski et al. (US Patent No. 9,942,039), et al. ("Speed-Oriented Architecture for Binary Field Point Multiplication on Elliptic Curves," in IEEE Access, vol. 7, pp. 32048-32060, 2019, doi: 10.1109/ACCESS.2019.2903170) and Cheung et al. ("On the Design and Optimization of a Quantum Polynomial-Time Attack on Elliptic Curve Cryptography," arXiv:0710.1093, February 6, 2009) all disclose various aspects of elliptical curve cryptography and converting points between two curves. THIS ACTION IS MADE FINAL. Applicant is reminded of the extension of time policy as set forth in 37 CFR 1.136(a). A shortened statutory period for reply to this final action is set to expire THREE MONTHS from the mailing date of this action. In the event a first reply is filed within TWO MONTHS of the mailing date of this final action and the advisory action is not mailed until after the end of the THREE-MONTH shortened statutory period, then the shortened statutory period will expire on the date the advisory action is mailed, and any nonprovisional extension fee (37 CFR 1.17(a)) pursuant to 37 CFR 1.136(a) will be calculated from the mailing date of the advisory action. In no event, however, will the statutory period for reply expire later than SIX MONTHS from the mailing date of this final action. Any inquiry concerning this communication or earlier communications from the examiner should be directed to PETER C SHAW whose telephone number is (571)270-7179. The examiner can normally be reached Max Flex. Examiner interviews are available via telephone, in-person, and video conferencing using a USPTO supplied web-based collaboration tool. To schedule an interview, applicant is encouraged to use the USPTO Automated Interview Request (AIR) at http://www.uspto.gov/interviewpractice. If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Carl Colin can be reached on 571-272-3862. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300. Information regarding the status of published or unpublished applications may be obtained from Patent Center. Unpublished application information in Patent Center is available to registered users. To file and manage patent submissions in Patent Center, visit: https://patentcenter.uspto.gov. Visit https://www.uspto.gov/patents/apply/patent-center for more information about Patent Center and https://www.uspto.gov/patents/docx for information about filing in DOCX format. For additional questions, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000. /PETER C SHAW/Primary Examiner, Art Unit 2493 May 29, 2026
Read full office action

Prosecution Timeline

Show 3 earlier events
Aug 27, 2025
Final Rejection mailed — §101
Oct 27, 2025
Response after Non-Final Action
Nov 06, 2025
Request for Continued Examination
Nov 12, 2025
Response after Non-Final Action
Feb 02, 2026
Non-Final Rejection mailed — §101
May 04, 2026
Response Filed
Jun 03, 2026
Final Rejection mailed — §101
Jun 09, 2026
Response after Non-Final Action

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12621158
TWO FACTOR AUTHENTICATION DEVICES WITH ACCESSIBILITY FEATURES
2y 2m to grant Granted May 05, 2026
Patent 12566852
NEFARIOUS CODE DETECTION USING SEMANTIC UNDERSTANDING
2y 10m to grant Granted Mar 03, 2026
Patent 12547696
WIRELESS BATTERY MANAGEMENT SYSTEM SAFETY CHANNEL COMMUNICATION LAYER PROTOCOL
3y 2m to grant Granted Feb 10, 2026
Patent 12536342
SOC ARCHITECTURE WITH SECURE, SELECTIVE PERIPHERAL ENABLING/DISABLING
2y 1m to grant Granted Jan 27, 2026
Patent 12511438
DYNAMIC PROVISION OF SOFTWARE APPLICATION FEATURES
2y 0m to grant Granted Dec 30, 2025
Study what changed to get past this examiner. Based on 5 most recent grants.

Strategy Recommendation AI-generated — please review before filing

Get a prosecution strategy drawn from examiner precedents, rejection analysis, and claim mapping.
Typically takes 5-10 seconds — AI-generated, attorney review required before filing

Prosecution Projections

4-5
Expected OA Rounds
76%
Grant Probability
99%
With Interview (+35.6%)
3y 5m (~6m remaining)
Median Time to Grant
High
PTA Risk
Based on 559 resolved cases by this examiner. Grant probability derived from career allowance rate.

Sign in with your work email

Enter your email to receive a magic link. No password needed.

Personal email addresses (Gmail, Yahoo, etc.) are not accepted.

Free tier: 3 strategy analyses per month