IP Library Granted Patent US 11,809,530
Granted Patent B2
US 11,809,530 · App. 17/235,334 · Granted Nov 7, 2023

Method for processing data

Inventor: Wulf Harder (Riga, LV)
Assignee: Whitecryption Corporation
G06F21/14G06F21/12G06F21/16G06N7/00
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,809,530
App. No.
17/235,334
Granted
Nov 7, 2023
Kind
B2
Abstract

Method for processing data, in which a Petri net is encoded, written into a memory and read and executed by at least one instance, wherein transitions of the Petri net read from at least one tape and/or write on at least one tape symbols or symbol strings, with the aid of at least one head. [FIG. 1 ]. In an alternative, data-processing, co-operating nets are composed, the composition result is encoded, written into a memory and read and executed from the memory by at least one instance. In doing this, components can have cryptological functions. The data-processing nets can receive and process second data from a cryptological function which is executed in a protected manner. The invention enables processing of data which prevents semantic analysis of laid-open, possibly few processing steps and which can produce a linkage of the processing steps with a hardware which is difficult to isolate.

Claims (16)

1. A computer-implemented method for obstructing analysis of a computer program, the method comprising:

translating a first operation of a computer program into a first Petri net;

performing a composition of at least the first Petri net and a second Petri net to form a composite, the first Petri net being associated with a first operation of the computer program, the second Petri net comprising a cryptological data processing net, the cryptographic data processing net implementing a cryptological function configured to interface with secure hardware to receive randomly generated cryptographic information, the input and output behavior of the composite being based, at least in part, on the input and output behavior of the first Petri net and the second Petri net, wherein the composite yields protected version of the computer program; and

replacing, in the computer program, the first operation with an implementation of the composite, wherein transitions of the composite are configured to be read from at least a first tape and written to at least a second tape within memory of a computer system by executing the composite in a protected environment of the computer system.

2. The method of claim 1 , wherein at least one of the first Petri net and the second Petri net comprise a sequential machine.

3. The method of claim 2 , wherein the sequential machine comprises one or more input channels, one or more output channels, and one or more internal synchronization channels.

4. The method of claim 2 , wherein at least one of the first Petri net and the second Petri net has more than one input channel.

5. The method of claim 2 , wherein at least one of the first Petri net and the second Petri net has more than one output channel.

6. The method of claim 1 , wherein the secure hardware is included in a computer system executing the computer program.

7. The method of claim 6 , wherein the method further comprises translating the cryptological function into the second Petri net.

8. The method of claim 6 , wherein the cryptological function is executed by the computer system in a protected manner.

9. The method of claim 1 , wherein at least one of the first Petri net and the second Petri comprises a watermarking component.

10. The method of claim 1 , wherein at least one of the first Petri net and the second Petri net comprises a component configured to deflate compressed data.

11. The method of claim 1 , wherein transitions of the composite are configured to read from the at least the first tape using, at least in part, at least one head.

12. The method of claim 11 , wherein transitions of the composite are configured to be written to the at least the second tape using, at least in part, at least one head.

13. The method of claim 11 , wherein the at least one head is configured to write symbols to the at least the second tape.

Assignments (6)
RELEASE OF SECURITY INTEREST Recorded Jul 21, 2026
From: ALLY BANK, IN ITS CAPACITY AS ADMINISTRATIVE AGENT
To: WHITECRYPTION CORPORATION
Reel/Frame 075345/0834 →
SECURITY INTEREST Recorded Jun 4, 2026
From: ZIMPERIUM, INC.; WHITECRYPTION CORPORATION
To: HERCULES CAPITAL, INC.
Reel/Frame 074849/0518 →
CORRECTIVE ASSIGNMENT TO CORRECT THE RECEIVING PARTY PREVIOUSLY RECORDED AT REEL: 057261 FRAME: 0292. ASSIGNOR(S) HEREBY CONFIRMS THE ASSIGNMENT. Recorded Sep 18, 2023
From: HARDER, WULF
To: SIA SYNCROSOFT
Reel/Frame 064936/0472 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 18, 2023
From: SIA WHITECRYPTION
To: WHITECRYPTION CORPORATION
Reel/Frame 064937/0735 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 23, 2021
From: HARDER, WULF
To: ZIMPERIUM, INC.
Reel/Frame 057261/0292 →
SECURITY INTEREST Recorded Jul 13, 2021
From: ZIMPERIUM, INC.; WHITECRYPTION CORPORATION
To: ALLY BANK
Reel/Frame 056841/0589 →
Continuity (6)
Continuation 16714489 · Dec 13, 2019
Continuation 15953252 · Apr 13, 2018
Continuation 15638084 · Jun 29, 2017
Continuation 15052711 · Feb 24, 2016
Continuation 10554168
Related Publication 20210240802A1 · Aug 5, 2021