IP Library Granted Patent US 11,804,099
Granted Patent B2
US 11,804,099 · App. 18/317,388 · Granted Oct 31, 2023

Secure predetermined game generation

Inventors: Jeffrey Schertzer (Valrico, FL); Bruce Coffman (Mulberry, FL); Kenneth E. Irwin, Jr. (Dawsonville, GA); David Knechtges (Davenport, FL)
Assignee: IGT Global Solutions Corporation
G07F17/3227G07F17/3241
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,804,099
App. No.
18/317,388
Granted
Oct 31, 2023
Kind
B2
Abstract

Systems and methods for enabling secure automated production and redemption of predetermined games of chance with multiple play venues or dimensions, wherein such systems and methods can provide, for example, lottery games (e.g., instant tickets), charitable gaming (e.g., raffles, pull-tabs), casino environments (e.g., “Class II” gaming), Internet gaming (e.g., poker, online instant tickets), etc.

Claims (62)

1. A system for securely encrypting a cleartext seed useable to generate predetermined game outcomes comprising varying arrangements of indicia for instant lottery tickets, the system comprising:

a processor; and

a memory device that stores a plurality of instructions, that when executed by the processor, cause the processor to:

cause the cleartext seed to be encrypted into a ciphertext seed through a multiple-level process, wherein the multiple-level process comprises:

causing a first level encryption of the cleartext seed into a first level ciphertext seed using a first level symmetrical encryption algorithm and a first level cleartext symmetrical encryption key,

causing an asymmetrical encryption algorithm using a first level public key to encrypt the first level cleartext symmetrical encryption key into a ciphertext symmetrical key,

saving the ciphertext symmetrical key in non-volatile memory,

destroying both the cleartext seed and the first level cleartext symmetrical encryption key,

causing a second level encryption of the first level ciphertext seed using a second level asymmetrical encryption algorithm and a second public key resulting in a second level ciphertext seed,

saving the second level ciphertext seed in non-volatile memory, and

destroying the first level ciphertext seed.

2. The system of claim 1 , wherein the cleartext seed is a Genesis Seed.

3. The system of claim 2 , wherein the first level symmetrical encryption algorithm comprises a One Time Pad (OTP) algorithm.

4. The system of claim 2 , wherein the second level asymmetrical encryption algorithm comprises an RSA (Rivest-Shamir-Adleman) algorithm.

5. The system of claim 1 , wherein the cleartext seed is a Genesis Seed and wherein the multiple-level process further comprises:

causing a third level encryption of the second level ciphertext seed using a third level asymmetrical encryption algorithm and a third public key resulting in a third level encrypted ciphertext seed,

saving the third level ciphertext seed in non-volatile memory, and

destroying the second level ciphertext seed.

6. The system of claim 5 , wherein the multiple-level process further comprises:

causing a fourth level encryption of the third level ciphertext seed using a fourth level asymmetrical encryption algorithm with a fourth public key resulting in a fourth level ciphertext seed,

saving the fourth level ciphertext seed in non-volatile memory, and

destroying the third level ciphertext seed.

7. The system of claim 2 , wherein the ciphertext symmetrical key is saved in a secure restricted environment.

8. The system of claim 2 , wherein the second level asymmetrical decryption algorithm comprises an Elliptic Curve Cryptography (ECC) algorithm.

9. The system of claim 1 , wherein the cleartext seed is a shuffle seed.

10. The system of claim 9 , wherein the first level symmetrical encryption algorithm comprises a One Time Pad (OTP) algorithm.

11. The system of claim 9 , wherein the second level asymmetrical encryption algorithm comprises an RSA (Rivest-Shamir-Adleman) algorithm.

12. The system of claim 9 , wherein the cleartext seed is a shuffle seed and the multiple-level process further comprises:

causing a third level encryption of the second level ciphertext seed using a third level asymmetrical encryption algorithm and a third public key resulting in a third level encrypted ciphertext seed,

saving the third level ciphertext seed in non-volatile memory, and

destroying the second level ciphertext seed.

13. The system of claim 12 , wherein the multiple-level process further comprises:

causing a fourth level encryption of the third level ciphertext seed using a fourth level asymmetrical encryption algorithm with a fourth public key resulting in a fourth level ciphertext seed,

saving the fourth level ciphertext seed in non-volatile memory, and

destroying the third level ciphertext seed.

14. The system of claim 9 , wherein the ciphertext symmetrical key is saved in a secure restricted environment.

15. The system of claim 9 , wherein the second level asymmetrical decryption algorithm comprises an Elliptic Curve Cryptography (ECC) algorithm.

16. A system for generating predetermined game outcomes comprising varying arrangements of indicia for a plurality of instant lottery tickets, the system comprising:

a processor; and

a memory device that stores a plurality of instructions, that when executed by the processor, cause the processor to:

use a cleartext seed to generate the predetermined game outcomes comprising varying arrangements of indicia, and

cause the cleartext seed to be encrypted into a ciphertext seed through a multiple-level process, wherein the multiple-level process comprises:

causing a first level encryption of the cleartext seed into a first level ciphertext seed using a first level symmetrical encryption algorithm and a first level cleartext symmetrical encryption key,

causing an asymmetrical encryption algorithm using a first level public key to encrypt the first level cleartext symmetrical encryption key into a ciphertext symmetrical key,

saving the ciphertext symmetrical key in non-volatile memory,

destroying both the cleartext seed and the first level cleartext symmetrical encryption key,

causing a second level encryption of the first level ciphertext seed using a second level asymmetrical encryption algorithm and a second public key resulting in a second level ciphertext seed,

saving the second level ciphertext seed in non-volatile memory, and

destroying the first level ciphertext seed.

17. The method of claim 16 , wherein the cleartext seed is one of a Genesis Seed and a shuffle seed.

18. The method of claim 16 , wherein the varying arrangements of indicia for the plurality of instant lottery tickets includes a plurality of different process colors.

19. A method for securely encrypting a cleartext seed useable to generate predetermined game outcomes comprising varying arrangements of indicia for instant lottery tickets, the method comprising:

accessing the cleartext seed,

causing, via a processor, the cleartext seed to be encrypted into a ciphertext seed through a multiple-level process, wherein the multiple-level process comprises:

causing a first level encryption of the cleartext seed into a first level ciphertext seed using a first level symmetrical encryption algorithm and a first level cleartext symmetrical encryption key,

causing an asymmetrical encryption algorithm using a first level public key to encrypt the first level cleartext symmetrical encryption key into a ciphertext symmetrical key,

saving the ciphertext symmetrical key in non-volatile memory,

destroying both the cleartext seed and the first level cleartext symmetrical encryption key,

causing a second level encryption of the first level ciphertext seed using a second level asymmetrical encryption algorithm and a second public key resulting in a second level ciphertext seed,

saving the second level ciphertext seed in non-volatile memory, and

destroying the first level ciphertext seed.

20. The method of claim 19 , wherein the cleartext seed is one of a Genesis and a shuffle seed.

Assignments (4)
CHANGE OF NAME Recorded Aug 17, 2025
From: IGT GLOBAL SOLUTIONS CORPORATION
To: BRIGHTSTAR GLOBAL SOLUTIONS CORPORATION
Reel/Frame 072479/0468 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 18, 2023
From: SCHERTZER, JEFFREY; IRWIN, KENNETH E., JR.; KNECHTGES, DAVID
To: IGT
Reel/Frame 063689/0129 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 18, 2023
From: COFFMAN, BRUCE
To: IGT
Reel/Frame 063689/0156 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 18, 2023
From: IGT
To: IGT GLOBAL SOLUTIONS CORPORATION
Reel/Frame 063689/0183 →
Continuity (4)
Continuation 18057389 · Nov 21, 2022
Continuation 17453414 · Nov 3, 2021
Provisional Application 63192371 · May 24, 2021
Related Publication 20230282061A1 · Sep 7, 2023