US 8,788,827 Accelerated verification of digital signatures and public keys
3 defendants · 3 suits · updated October 6, 2026
Also cited as U.S. Patent No. 8,788,827 · US8788827B2 · US 8,788,827 B2 · 8788827 · the '827 patent
Malikie Innovations Ltd. has filed 3 patent-infringement suits on US 8,788,827, "Accelerated verification of digital signatures and public keys" since August 28, 2026, 2 of them in the W.D. Tex., against 3 distinct defendants including Foundry Digital LLC, Antpool Technologies Limited and ViaBTC Technology Limited. The patent was granted July 22, 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." The examiner cited 4 references during prosecution.
- Assignee
- Malikie Innovations Ltd
- Priority date
- January 18, 2005
- Granted
- July 22, 2014
- Expires
- January 18, 2025
- Status
- Expired - Lifetime
- Claims
- 13 (3 independent)
- Inventors
- Marinus Struik, Daniel R. Brown, Scott A. Vanstone, Robert P. Gallant, Adrian Antipa, Robert J. Lambert
- Full text
- Google Patents
The suits
3 cases · W.D. Tex. (2) · W.D.N.Y. (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 | Antpool Technologies Limited | Malikie Innovations Ltd. | W.D. Tex. | 7:26-cv-00371 |
| 2026-09-09 | ViaBTC Technology Limited | Malikie Innovations Ltd. | W.D. Tex. | 7:26-cv-00372 |
Docket links open the public record on CourtListener. Filing dates are the complaint's.
Independent claims
What is actually asserted, verbatim.
1. A computer-implemented method comprising: receiving, from a signer, a signature on a message M, wherein the signature includes a first signature component r and a second signature component s; obtaining an elliptic curve point associated with the first signature component r; and generating, by operation of a cryptographic module comprising one or more processors, a public key of the signer based on the elliptic curve point and a hash value e computed from the message M; wherein the elliptic curve point comprises a first elliptic curve point R, the public key of the signer comprises a second elliptic curve point Q, generating the public key of the signer comprises computing Q=r −1 (sR−eG), and G comprises a generator of an elliptic curve group that includes the first elliptic curve point R and the second elliptic curve point Q.
6. A non-transitory computer-readable medium storing instructions that, when executed by one or more processors, perform operations comprising: receiving, from a signer, a signature on a message M, wherein the signature includes a first signature component r and a second signature component s; obtaining an elliptic curve point associated with the first signature component r; and generating a public key of the signer based on the elliptic curve point and a hash value e computed from the message M; wherein the elliptic curve point comprises a first elliptic curve point R, the public key of the signer comprises a second elliptic curve point Q, generating the public key of the signer comprises computing Q=r −1 (sR−eG), and G comprises a generator of an elliptic curve group that includes the first elliptic curve point R and the second elliptic curve point Q.
10. A computing device comprising: a cryptographic module operable to: receive, from a signer, a signature on a message M, wherein the signature includes a first signature component r and a second signature component s; obtain an elliptic curve point associated with the first signature component r; and generate a public key of the signer based on the elliptic curve point and a hash value e computed from the message M; wherein the elliptic curve point comprises a first elliptic curve point R, the public key of the signer comprises a second elliptic curve point Q, generating the public key of the signer comprises computing Q=r −1 (sR−eG), and G comprises a generator of an elliptic curve group that includes the first elliptic curve point R and the second elliptic curve point Q.
Art before the examiner
81 references of record, 4 cited by the examiner.
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.
Examiner-cited
- US7593527B2 — Providing digital signature and public key based on shared knowledge (First Data Corporation)
- US8069346B2 — Implicit certificate verification (Certicom Corp.)
- US8307211B2 — Data card verification system (Certicom Corp.)
- US8467535B2 — Accelerated verification of digital signatures and public keys (Certicom Corp.)
Applicant-cited and other (77)
- FR2536928A1 — System for enciphering and deciphering information, of the type using a public key deciphering system.
- US4519036A — Program storage hardware with security scheme
- US4745568A — Computational method and apparatus for finite field multiplication
- US4748668A — Method, apparatus and article for identification and signature
- US4890323A — Data communication systems and methods
- US4989171A — Data processing method and apparatus for calculating a multiplicatively inverted element of a finite field
- WO1991016691A1 — Value transfer system
- FR2672402A1 — Process and device for generating unique pseudo-random numbers
- US5146500A — Public key cryptographic system using elliptic curves over rings
- US5150411A — Cryptographic system allowing encrypted communication between users with a secure mutual cipher key determined without user interaction
- US5159632A — Method and apparatus for public key exchange in a cryptographic system
- US5202995A — Method for removing invariant branches from instruction loops of a computer program
- US5218637A — Method of transferring a secret, by the exchange of two certificates between two microcomputers which establish reciprocal authorization
- US5271061A — Method and apparatus for public key exchange in a cryptographic system
- US5272755A — Public key cryptosystem with an elliptic curve
- EP0588339A2 — Method and apparatus for settlement of accounts by IC cards
- US5351297A — Method of privacy communication using elliptic curves
- US5373560A — Partial modular reduction method
- US5442707A — Method for generating and verifying electronic signatures and privacy communication using elliptic curves
- US5497423A — Method of implementing elliptic curve cryptosystems in digital signatures or verification and privacy communication
- US5511198A — Optimizing compiler for shortening execution time of object program
- US5524222A — Microsequencer allowing a sequence of conditional jumps without requiring the insertion of NOP or other instructions
- US5627893A — Cryptographic method
- US5650948A — Method and system for translating a software implementation with data-dependent conditions to a data flow graph with conditional expressions
- US5675645A — Method and apparatus for securing executable programs against copying
- WO1998000771A1 — Distribution and controlled use of software products
- US5757918A — Method and apparatus for user and security device authentication
- US5761305A — Key agreement and transport protocol with implicit signatures
- US5764772A — Differential work factor cryptography method and system
- US5768389A — Method and system for generation and management of secret key of public key cryptosystem
- US5778069A — Non-biased pseudo random number generator
- US5825880A — Multi-step digital signature method and system
- WO1998052319A1 — Improved method and apparatus for protecting public key schemes from timing and fault attacks
- US5889865A — Key agreement and transport protocol with implicit signatures
- US5892899A — Tamper resistant methods and apparatus
- US5937066A — Two-phase cryptographic key recovery system
- US5987131A — Cryptographic key exchange using pre-computation
- US5999626A — Digital signatures on a smartcard
- WO2000042733A1 — Method and apparatus for masking cryptographic operations
- US6122736A — Key agreement and transport protocol with implicit signatures
- US6141420A — Elliptic curve encryption systems
- US6212279B1 — Method of elliptic curve cryptographic key exchange using reduced base tau expansion in non-adjacent form
- US6243467B1 — Method of elliptic curve cryptographic digital signature generation and verification using reduced base tau expansion in non-adjacent form
- US6279110B1 — Masked digital signatures
- US6298135B1 — Method of preventing power analysis attacks on microelectronic assemblies
- US6304658B1 — Leak-resistant cryptographic method and apparatus
- US20010053220A1 — Cryptographic computation using masking to prevent differential power analysis and other attacks
- US6334189B1 — Use of pseudocode to protect software from unauthorized use
- US20020044649A1 — Method for accelerating cryptographic operations on elliptic curves
- US20020057796A1 — Method for accelerating cryptographic operations on elliptic curves
- US6411715B1 — Methods and apparatus for verifying the cryptographic security of a selected private and public key pair without knowing the private key
- US6419159B1 — Integrated circuit device with power analysis protection circuitry
- US6430588B1 — Apparatus and method for elliptic-curve multiplication and recording medium having recorded thereon a program for implementing the method
- US6446207B1 — Verification protocol
- US20020166058A1 — Semiconductor integrated circuit on IC card protected against tampering
- JP2002328602A — Blind signature method, its device, its program and its recording medium
- US6496929B2 — Generating RSA moduli including a predetermined portion
- US20030021410A1 — IC card equipped with elliptic curve encryption processing facility
- US20030044003A1 — Space-efficient, side-channel attack resistant table lookups
- US20030048903A1 — Encryption secured against DPA
- US20030059043A1 — Elliptic curve signature verification method and apparatus and a storage medium for implementing the same
- US20030059042A1 — Elliptic scalar multiplication system
- US20030061498A1 — Portable data carrier provided with access protection by dividing up codes
- US6724894B1 — Cryptographic device having reduced vulnerability to side-channel attack and method of operating same
- JP2004163687A — Elliptic curve encryption device, elliptic curve encryption program
- US6816594B1 — Elliptic curve generating method and device, elliptic encryption system and recording medium
- US6829356B1 — Server-assisted regeneration of a strong secret from a weak secret
- US6873706B1 — Processing apparatus, program, or system of secret information
- US20050135606A1 — Method and apparatus for verifiable generation of public keys
- WO2006076800A1 — Accelerated verification of digital signatures and public keys
- US7127063B2 — Method and apparatus for computing a shared secret key
- US7215780B2 — Method and apparatus for elliptic curve scalar multiplication
- US7421074B2 — Security system using RSA algorithm and method thereof
- US7486789B2 — Device and method for calculation on elliptic curve
- WO2009030021A1 — Signatures with confidential message recovery
- US7599491B2 — Method for strengthening the implementation of ECDSA against power analysis
- US7613660B2 — System and method for mail destination address information encoding, protection and recovery in postal payment
Classification
- H04L9/30primary — Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy
- H04L9/3066primary — Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy involving algebraic varieties, e.g. elliptic or hyper-elliptic curves
- G06F7/725 — Finite field arithmetic over elliptic curves
- H04L9/3252 — Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving digital signatures using DSA or related signature schemes, e.g. elliptic based signatures, ElGamal or Schnorr schemes
Family
- US8788827B2 — B2 (2014)
- US20070064932A1 — A1 (2007)
- US20140344579A1 — A1 (2014)
- US10284370B2 — B2 (2019)
- US20120230494A1 — A1 (2012)
- US8204232B2 — B2 (2012)
- US20130064367A1 — A1 (2013)
- US8806197B2 — B2 (2014)
- 17 foreign family members: JP2012212164A, CA2935823A1, EP2395424B1, EP2395424A1, CA2935823C, EP1842128A4, HK1165053A1, CA2592875C, CA2592875A1, EP1842128B1, JP5373026B2, ATE533103T1, JP5068176B2, JP2012014203A, EP1842128A1, WO2006076800A1, JP2008527865A
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,806,197 — 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.