US 2010/0306541 A1 · HASH FUNCTION USING A CARD SHUFFLING PROCESS

Abstract

In the computer data security field, a cryptographic hash function process embodied in a computer system and which is typically keyless, but is highly secure. The process is based on the type of chaos introduction exhibited by a game process such as the well known shuffling of a deck of playing cards. Computation of the hash value (digest) is the result of executing in a model (such as computer code or logic circuitry) a game algorithm that models the actual game such as a playing card shuffling algorithm using the message as an input to the algorithm, then executing the card shuffling algorithm on the input. A state (order) of the modeled deck of cards after a shuffle (or multiple shuffles) gives the hash digest value.

Claims46

Dependent claims

A hashing method performed by a computing apparatus and comprising the acts of:

(a) receiving a message at an input port;
(b) storing the received message as a table having a plurality of entries in a first computer readable storage medium coupled to the input port;
(c) a processor coupled to the first storage medium and which computes, according to a card shuffling algorithm, a new order for the entries of the table;
(d) the processor updating the table according to act (c) and storing the updated table in the first storage medium;
(e) the processor using the updated table resulting from act (d) to provide a hash value of the message;
and
(f) the processor storing the hash value in a third computer readable storage medium.

4 more elements

Dependencies are inferred from the claim text.

Hash function using a card shuffling process

Life of this patent

Hash function using a card shuffling process

Life of this patent

Abstract

Claims46