IP Library Granted Patent US 10,534,897
Granted Patent B2
US 10,534,897 · App. 15/953,252 · Granted Jan 14, 2020

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 10,534,897
App. No.
15/953,252
Granted
Jan 14, 2020
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 (18)

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

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

performing a composition of at least a second Petri net and the first Petri net to form a first composite, the second Petri net comprising a function configured to interface with secure hardware included in a computer system executing the computer program to receive randomly generated cryptographic information, the input and output behavior of the first composite being based, at least in part, on the input and output behavior of the first Petri net and the second Petri net;

translating a second operation of the computer program into a third Petri net;

performing a composition of at least a fourth Petri net and the third Petri net to form a second composite; and

replacing, in the computer program, the first operation with an implementation of the first composite and the second operation with an implementation of the second composite to yield a protected version of the computer program,

wherein at least one of the first Petri net, the second Petri net, the third Petri net, and the fourth Petri net comprise a sequential machine having one or more input channels, one or more output channels, and one or more internal synchronization channels.

2. The method of claim 1 , wherein the second Petri net comprises a cryptological function.

3. The method of claim 2 , wherein the cryptological function is configured to interface with the secure hardware included in the computer system executing the computer program to receive the randomly generated cryptographic information.

4. The method of claim 1 , wherein performing the composition to form the first composite further comprises performing a composition of at least the second Petri net, the first Petri net, and a fifth Petri net to form the first composite.

5. The method of claim 4 , wherein the fifth Petri net comprises a cryptological function.

6. The method of claim 5 , wherein at least one output of the second Petri net is an input to the first Petri net, and at least one output of the first Petri net is an input to the fifth Petri net.

7. The method of claim 1 , wherein the fourth Petri net comprises a cryptological function.

8. The method of claim 1 , wherein the cryptological function is configured to interface with the secure hardware included in the computer system executing the computer program to receive the randomly generated cryptographic information.

9. The method of claim 1 , wherein at least one of the first Petri net, the second Petri net, the third Petri net, and the fourth Petri net has more than one input.

10. The method of claim 1 , wherein at least one of the first Petri net, the second Petri net, the third Petri net, and the fourth Petri net has more than one output.

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

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

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 →
SECURITY INTEREST Recorded Jul 13, 2021
From: ZIMPERIUM, INC.; WHITECRYPTION CORPORATION
To: ALLY BANK
Reel/Frame 056841/0589 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 20, 2020
From: HARDER, WULF; PEETERS, BERND; RESAS, UWE; WEBER, STEFAN
To: SIA SYNCROSOFT
Reel/Frame 052718/0977 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 20, 2020
From: SIA WHITECRYPTION
To: WHITECRYPTION CORPORATION
Reel/Frame 052719/0084 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 20, 2020
From: SIA SYNCROSOFT
To: SIA WHITECRYPTION
Reel/Frame 052720/0253 →
Continuity (4)
Continuation 15638084 · Jun 29, 2017
Continuation 15052711 · Feb 24, 2016
Continuation 10554168
Related Publication 20180239881A1 · Aug 23, 2018