Device for the identification of messages

• US 5,150,409 A
• Filed: 01/19/1990
• Issued: 09/22/1992
• Est. Priority Date: 08/13/1987
• Status: Expired due to Term

• Current Assignee: Peter Elsner
• Original Assignee: Peter Elsner
• Inventors: Elsner, Peter
• Primary Examiner(s): Tarcza, Thomas N.
• Assistant Examiner(s): CAIN, DAVID C
• Application Number:
  US07/458,707
• Time in Patent Office: 977 Days
• Field of Search: 380/23, 380/25, 380/28, 380/33, 380/37, 380/42, 380/49, 364/200, 364/900
• US Class Current: 713/177
• CPC Class Codes: G06Q 20/341 Active cards, i.e. cards including their own processing means, e.g. including an IC or chip
• CPC Class Codes: G06Q 20/35765 Access rights to memory zones
• CPC Class Codes: G07F 7/1008 Active credit-cards provided with means to personalise their use, e.g. with PIN-introduction/comparison system
• CPC Class Codes: G07F 7/1016 Devices or methods for securing the PIN and other transaction-data, e.g. by encryption arrangements for secret communication, see H04L9/00
• CPC Class Codes: G11C 8/00 Arrangements for selecting an address in a digital store for stores using transistors G11C11/407, G11C11/413
• CPC Class Codes: H04L 2209/56 Financial cryptography, e.g. electronic payment or e-cash
• CPC Class Codes: H04L 2209/60 Digital content management, e.g. content distribution
• CPC Class Codes: H04L 9/0836 using tree structure or hierarchical structure
• CPC Class Codes: H04L 9/0891 Revocation or update of secret information, e.g. encryption key update or rekeying

Abstract

An apparatus and a method for the identification and encrypting/decrypting of messages permits converting an input message provided as characters, in character-by-character fashion and depending on preceding characters, to form an output message. An address branching network is employed for encrypting/decrypting. The address branching network includes selectable branches that are carriers of encrypting/decrypting characteristics. The selection of such branches is done in a step-by-step selection run through the branching network to convert any specific input message of optional length character-by-character into a specific selection path through the branching network. The output message is formed on the basis of the encrypting/decrypting characteristics from the branches selected on said selection path.

Claims

1. A method of encrypting/decrypting messages, whereby an input message provided as characters is converted character-by-character, dependent on preceding characters, into an output message, the steps of the method comprising:

defining a branching network as a carrier of encrypting/decrypting characteristics, said branching network comprising nodes linked together by selectable branches, wherein each node has a number of selectable branches leading to optional nodes, and wherein at least one encrypting/decrypting character is assigned to each of said selectable branches;

defining a selection run, which is a step-by-step selection of said selectable branches on the basis of the character-by-character input message to select character-by-character an encrypting/decrypting characteristic;

defining said output message, which is formed on the basis of said selected encrypting/decrypting characteristic;

said selection run, starting from a first selected node, selecting on the basis of currently active characters of the input message said selectable branches, to convert any specific input message of optional length character-by-character into a specific selection path through said branching network, whereby the same nodes on said selection path can be selected repeatedly; and

forming said output message in at least one selection run on the basis of said encrypting/decrypting characters assigned to said branches selected on said selection path.

2. The method as defined in claim 1, further comprising forming said branching network to carry said encrypting/decrypting characters for selectable opposite encrypting/decrypting directions.

3. The method as defined in claim 1, further comprising forming said characters of the output message by means of several of said selection runs, so that an input message of a next selection run is based on the output message of a preceding selection run, whereby the character sequence of said input message can be altered.

4. The method as defined in claim 1, further comprising forming said branching network on the basis of internal process messages and/or external messages.

5. The method as defined in claim 1, further comprising forming identical branching networks for coded transmission of messages, said branching networks carrying said encrypting/decrypting characters for opposite encrypting/decrypting directions on the transmitting and receiving sides respectively of the formed networks.

6. The method as defined in claim 1, further comprising associating said individual branching networks with particular objects to identify, transmitting at least one said input message as inquiry message for the purpose of encrypting/decrypting by means of said associated individual branching networks into at least one said output message as response message which is individual with regard to said inquiry message and said encrypting/decrypting, and identifying said obtained response message as an identification base or key for subsequent processes or communications.

7. The method as defined in claim 6, wherein said step of identifying the obtained response messages comprises the following substeps:

defining a branch tree for storing the characters of said response messages in the form of selectable branches, said branch tree comprising a root node at a first level, and additional nodes arranged at subsequent levels, said root node and additional nodes being linked together by branches, whereby, beginning with said root node, from each node of said levels a number of selectable branches lead to nodes at subsequent levels until a branch leads to a last selected node, wherein said last selected nodes are carriers of key information for identifying;

defining a formation run, which is a step-by-step forming of said selectable branches on the basis of said character-by-character response messages, to convert any specific response message character-by-character into a specific selection path through said branch tree which ends at said last selected node and whereby each node on said selection path is selected once only;

defining a selection run, which is a step-by-step selection of said formed selectable branches on the basis of a character-by-character response message, to identify said response message;

said selection run, starting from said root node, selecting on the basis of the currently active characters of said response message, said selectable branches until either it reaches said last selected node for identifying or until, in the case of an unknown response message, no branch is assigned to a present character, whereby said missing following branches including the last selected node will be formed by said formation run.

8. The method as defined in claim 1, further comprising forming said branching network on the basis of random events.

9. A message encrypting/decrypting system comprising:

forming means for forming a branching network as a carrier of encrypting/decrypting characteristics, which branching network comprising nodes linked together by selectable branches, wherein each node has a number of selectable branches leading to optional nodes and further wherein at least one encrypting/decrypting character is assigned to each said selectable branch;

selecting means for selecting in a step-by-step selection run said selectable branches on the basis of the character-by-character input message to select character-by-character an encrypting/decrypting characteristic;

controlling means for forming the output message on the basis of said selected encrypting/decrypting characteristic;

said selection run, starting from a first selected node, selects on the basis of the currently active characters of the input message, said selectable branches, to convert any specific input message of optional length character-by-character into a specific selection path through said branching network, whereby the same nodes on said selection path can be selected repeatedly; and

wherein

said output message is formed in at least one selection run on the basis of said encrypting/decrypting characters assigned to said branches selected on said selection path.

10. The system as defined in claim 9, wherein said forming means further comprise means for forming said branching network on the basis of random events.

11. The system as defined in claim 9, wherein said forming means form said branching network, to carry said encrypting/decrypting characters for selectable opposite encrypting/decrypting directions.

12. The system as defined in claim 9, wherein said controlling means form said characters of the output message by means of several said selection runs, characterized in that the input message of a next selection run is based on the output message of a preceding selection run, whereby the character sequence of said input message can be altered.

13. The system as defined in claim 9, further comprising processing means forming said branching network or altering said branching network on the basis of internal process messages.

14. The system as defined in claim 9, further comprising:

processing means forming said branching network or altering said branching network on the basis of external messages.

15. The system as defined in claim 9, further comprising means for forming identical said branching networks for coded transmission of messages, said branching networks carrying said encrypting/decrypting characters for opposite encrypting/decrypting directions on the transmitting and receiving sides respectively of the formed networks.

16. The system as defined in claim 9, further comprising means for associating individual said branching networks to particular objects to be identified, means for transmitting at least one said input message as inquiry message for the purpose of encrypting/decrypting by means of said associated individual branching networks into at least one said output message as response message;

and identifying means identifying said obtained response message as an identification base or key for subsequent processes or communications.

17. The system as defined in claim 15, further comprising means for recording and reproduction of protected messages on said transmitting and receiving sides, and wherein said branching networks for opposite encrypting/decrypting directions are connected to said means for recording and reproduction.

18. The system as defined in claim 9, further comprising memory units as said forming means, the memory locations of which form said nodes of said branching network.

19. The system as defined in claim 18, wherein said memory locations are storing a number of said selectable branches as a number of selectable memory location addresses, one of said memory location addresses is selected on the basis of said currently active character of the input message, as the address for a subsequent memory location which is to be called.

20. The system as defined in claim 19, wherein each of said memory locations is storing two of said memory location addresses as two said branches which carry different said encrypting/decrypting characters, and wherein said selecting means divide said input message into characters with two possible information statuses, each said information status selects one of two said branches as said address for a subsequent memory location.

21. The system as defined in claim 9, further comprising means for supplementing said encrypting/decrypting characters with individual characteristics, said individual characteristics can be stipulated externally and cause individually identifiable output messages.

22. The system as defined in claim 9, further comprising means enabling the system to receive and process at least one activating signal in an initial time phase, said activating signal providing the operating energy for the circuit by means of the energy content of said activating signal, and means enabling the system to transmit at least one reaction signal in a second time phase, wherein all said means are constructed by large-scale integration technology, in the form of a miniaturized, integrated circuit.

23. The system as defined in claim 9, further comprising means for storing and exchanging monetary sums, said input messages and said output messages are equivalents to said monetary sums.

24. The system as defined in claim 16, wherein said identifying means for identifying the obtained response messages comprises:

first means for forming a branch tree to store the characters of said response messages in the form of selectable branches, said branch tree comprising a root node, at a first level and additional nodes arranged at subsequent levels, said nodes being linked together by branches, whereby, beginning with said root node, from each node of said levels a number of selectable branches lead to nodes at subsequent levels until a last branch leads to a last selected node, wherein said last selected nodes are carriers of key information for identifying,

second means for forming in a formation run step-by-step said selectable branches on the basis of said character-by-character response messages, to convert any specific response message character-by-character into a specific selection path through said branch tree which ends at said last selected node and whereby each node on said selection path is selected once only;

third means for selecting in a selection run step-by-step said formed selectable branches on the basis of a character-by-character response message, to identify said response message;

said selection run, starting from said root node, selects on the basis of the currently active characters of said response message said selectable branches until either it reaches said last node for identifying or until, in the case of an unknown response message, no branch is assigned to a present character, whereby said missing following branches including the last node will be formed by said formation run.

25. The system of claim 9, wherein said means are all incorporated in a personal object.