US 8,806,197 Accelerated verification of digital signatures and public keys
3 defendants · 3 suits · updated October 13, 2026
Also cited as U.S. Patent No. 8,806,197 · US8806197 · 8806197 · the '197 patent
Malikie Innovations Ltd. has filed 3 patent-infringement suits on US 8,806,197, "Accelerated verification of digital signatures and public keys" since August 28, 2026, 1 of them in the W.D.N.Y., against 3 distinct defendants including Foundry Digital LLC, ViaBTC Technology Limited and Foris DAX, Inc. d/b/a Crypto.com. The patent is held by Certicom Corp. and was granted August 12, 2014 on a priority date of January 18, 2005. Its abstract opens: "Accelerated computation of combinations of group operations in a finite field is provided by arranging for at least one of the operands to have a relatively small bit length."
- Assignee
- Certicom Corp.
- Priority date
- January 18, 2005
- Granted
- August 12, 2014
- Expires
- January 18, 2025
- Claims
- 31 (3 independent)
- Inventors
- Marinus Struik
- Full text
- Google Patents
The suits
3 cases · W.D.N.Y. (1) · W.D. Tex. (1) · E.D. Tex. (1)
| Filed | Defendant | Plaintiff | Court | Docket |
|---|---|---|---|---|
| 2026-08-28 | Foundry Digital LLC | Malikie Innovations Ltd. | W.D.N.Y. | 6:26-cv-06874 |
| 2026-09-09 | ViaBTC Technology Limited | Malikie Innovations Ltd. | W.D. Tex. | 7:26-cv-00372 |
| 2026-09-22 | Foris DAX, Inc. d/b/a Crypto.com | Malikie Innovations Ltd. | E.D. Tex. | 2:26-cv-00864 |
Docket links open the public record on CourtListener. Filing dates are the complaint's.
Independent claims
What is actually asserted, verbatim.
A method of generating a digital signature of a message, the method comprising: by operation of a cryptographic module comprising one or more processors, generating a digital signature comprising a first signature component and a second signature component, said first signature component based on a first coordinate of an elliptic curve point representing an ephemeral public key; and generating, for use with said digital signature, an indicator to identify which value of a plurality of values recoverable from said first signature component is said ephemeral public key.
A cryptographic module operable to generate a digital signature of a message, the cryptographic module comprising one or more processors configured to: generate a digital signature comprising a first signature component and a second signature component, said first signature component based on a first coordinate of an elliptic curve point representing an ephemeral public key; and generate, for use with said digital signature, an indicator to identify which value of a plurality of values recoverable from said first signature component is said ephemeral public key.
A non-transitory computer readable medium storing instructions operable when executed by data processing apparatus to perform operations for generating a digital signature of a message, the operations comprising: generating a digital signature comprising a first signature component and a second signature component, said first signature component based on a first coordinate of an elliptic curve point representing an ephemeral public key; and generating, for use with said digital signature, an indicator to identify which value of a plurality of values recoverable from said first signature component is said ephemeral public key.
Art before the examiner
74 references of record.
Everything listed here was before the Office and is what a challenge must go beyond. Art the examiner never saw is where an invalidity search starts.
Applicant-cited and other (74)
- US4519036A
- US4745568A
- US4748668A
- US4890323A
- US4989171A
- US5146500A
- US5150411A
- US5159632A
- US5202995A
- US5218637A
- US5271061A
- US5272755A
- US5351297A
- US5373560A
- US5442707A
- US5463690A
- US5497423A
- US5511198A
- US5524222A
- US5627893A
- US5650948A
- US5675645A
- US5757918A
- US5761305A
- US5764772A
- US5768389A
- US5778069A
- US5825880A
- US5889865A
- US5892899A
- US5896455A
- US5937066A
- US5987131A
- US5999626A
- US6122736A
- US6141420A
- US6212279B1
- US6243467B1
- US6279110B1
- US6298135B1
- US6304658B1
- US6334189B1
- US6411715B1
- US6419159B1
- US6430588B1
- US6446207B1
- US6496929B2
- US6724894B1
- US6816594B1
- US6829356B1
- US6873706B1
- US7110538B2
- US7127063B2
- US7215780B2
- US7421074B2
- US7486789B2
- US7593527B2
- US7599491B2
- US7613660B2
- US8069346B2
- US8204232B2
- US8307211B2
- US8467535B2
- US20010053220A1
- US20020044649A1
- US20020057796A1
- US20020166058A1
- US20030021410A1
- US20030044003A1
- US20030048903A1
- US20030059042A1
- US20030059043A1
- US20030061498A1
- US20050135606A1
Classification
- G06F7/725primary
- H04L9/30
- H04L9/3066
- H04L9/3252
Abstract
Accelerated computation of combinations of group operations in a finite field is provided by arranging for at least one of the operands to have a relatively small bit length. In a elliptic curve group, verification that a value representative of a point R corresponds the sum of two other points uG and vG is obtained by deriving integers w,z of reduced bit length and so that v=w/z. The verification equality R=uG+vQ may then be computed as -zR+(uz mod n) G+wQ=O with z and w of reduced bit length. This is beneficial in digital signature verification where increased verification can be attained.
Also asserted by Malikie Innovations Ltd.
- US 8,532,286 — System and method for reducing the computation and storage requirements for a montgomery-style reduction (4 defendants)
- US 7,453,856 — Method, apparatus, and communications interface for sending and receiving data blocks associated with different multiple access techniques (3 defendants)
- US 7,747,934 — Method for selecting low density parity check (LDPC) code used for encoding of variable length data (3 defendants)
- US 7,917,829 — Low density parity check (LDPC) code (3 defendants)
- US 8,291,289 — Low density parity check (LDPC) code (3 defendants)
- US 8,712,039 — Efficient implementation of hash algorithm on a processor (3 defendants)
- US 8,788,827 — Accelerated verification of digital signatures and public keys (3 defendants)
Named in one of these suits? A prior-art search is commissioned once and serves every defendant who shares it. The examiner's own search record is free on the tools page, and your first preliminary search is free — one claim, back within 24 hours — so you know whether there is art the Office never saw before anyone pays for more. Flat fees: $2,500$899 for the independent claims, $5,000$1,500 for every asserted claim.
This page is assembled from public records — federal court dockets and the patent's own file — and is updated as the case list changes. It states what the record shows and is not an opinion on the validity or infringement of any claim. Patent data via Google Patents; docket data via CourtListener.