Authenticating pseudo-random code and apparatus

• US 4,972,475 A
• Filed: 02/03/1989
• Issued: 11/20/1990
• Est. Priority Date: 02/10/1987
• Status: Expired due to Fees

• Current Assignee: Veritec Incorporated (Matthews Group LLC)
• Original Assignee: Veritec Incorporated (Matthews Group LLC)
• Inventors: Sant'Anselmo, Carl
• Primary Examiner(s): BUCZINSKI, STEPHEN C
• Application Number:
  US07/306,212
• Time in Patent Office: 655 Days
• Field of Search: 380/42, 380/46, 380/50, 380/54, 380/23, 380/27
• US Class Current: 380/54
• CPC Class Codes: G07F 7/08 by coded identity card or credit card or other personal identification means without personal verification means G07F7/02
• CPC Class Codes: G07F 7/12 Card verification
• CPC Class Codes: G09C 5/00 Ciphering apparatus or methods not provided for in the preceding groups, e.g. involving the concealment or deformation of graphic data such as designs, written or printed messages

Abstract

A matrix code generating method generates a first predetermined code in binary form. A second step permutes the first determined code according to a non-linear feedback method described as pseudo-random. The code is segmented with linear segments positioned in a two dimensional matrix array. Apparatus generates and permutes the code, and segments the resultant code into matrix array form. Apparatus encrypts such information onto objects, photo-optically reads such encrypted information and deciphers the coded information.

Claims

1. A method for encrypting a code in a matrix array, comprising the steps of:

(a.) generating a first code having a series of signals;

(b.) permuting said signals to form a second code in a pseudo-random scheme including nonlinear feedback permutations and producing a representation of a two dimensional spatial matrix pattern of the second code having a plurality of signal locations in a first Cartesian direction and a plurality of locations in a second Cartesian direction; and

(c.) printing, from the representation, a two dimensional spatial matrix pattern of light reflective and non light reflective portions arranged according to said permutations on a surface of a substrate.

2. A method of encrypting a code in a matrix array, comprising the steps of:

a. generating a first code having a series of signals, said first code being generated by the steps of;

a1. digitizing information sought to be encrypted into a binary code form of at least m bits;

a2. inputting said binary code in increments of no more than n bits each into a n-bit shift register where n is less than and integer divisible into m; and

a3. shifting all bits a predetermined number of bit locations within said shift register;

b. permuting said signals to form a second code in a pseudo-random scheme producing a two dimensional spatial matrix pattern of the second code having a plurality of signal locations in a first Cartesian direction and a plurality of locations in a second Cartesian direction; and

c. imprinting the two dimensional spatial matrix pattern on a substrate.

3. The method of claim 2 where in the step of shifting all bits, further comprises the step of replacing the most significant bits in a sequence by a function of the least significant bits.

4. The method of claim 3 where in the step of shifting all bits, replacing the most significant bits as they are sequentially shifted by the modulo-2 sum of the lesser significant bits at the time increment immediately prior to shifting.

5. The method of claim 2 wherein said pseudo-random scheme is predetermined and said second code is generated according to said pseudo-random scheme which is stored into a retrievable memory, and further comprising the step of deciphering said code using said pseudo-random scheme.

6. The method of claim 5 further comprising the step of comparing the deciphered code with the series of signals comprising said first code.

7. The method of claim 5 wherein said pseudo-random scheme comprises an algorithm which permutes each of said n bits of said first code according to a pre-determined permutation scheme and feeds back each permuted bit into said shift register.

8. The method of claim 7 further comprising the step of dividing said m bits into a series of segments, the sum of bits in the segments equalling m and sequentially arranging said segments into a matrix of bits representative of binary signals.

9. The method of claim 8 further comprising the step of encrypting said matrix onto an object.

10. The method of claim 7 wherein said pre-determined scheme is non-linear.

22. The method of claim 2, wherein said matrix in an n by n matrix and the generation of the first code depends on a value of n.

11. An encryption device capable of generating a set of decipherable information for encryption in a matrix array form, comprising:

(a.) means for generating a plurality of signals comprising a first code;

(b.) means for permuting said signals into a pseudo-random scheme including nonlinear feedback permutations and producing a representation of a two dimensional spatial matrix pattern of the second code; and

(c.) means for printing, from the representation a, two dimensional spatial matrix pattern of light reflective and non-light reflective portions arranged according to said permutations on a surface of a substrate.

12. An encryption device capable of generating a set of decipherable information for encryption in a matrix array form, comprising:

(a.) means for generating a plurality of signals comprising a first code, said code generating means comprising means for digitizing information sought to be encrypted into binary code form having a set of binary signals and at least m bits;

(b.) means for permuting said signals into a pseudo-random scheme producing a two dimensional spatial matrix pattern of the second code;

(c.) means for imprinting the two dimensional spatial matrix pattern on a substrate;

(d.) a shift register capable of processing n bits at a time where n is less than an integer divisible into m;

(e.) means for inputting said binary code in increments of no more than n bits each into said n-bit shift register; and

(f.) an algorithm operatively connected to said shift register for running instruction sequences in said shift register and having a program for shifting said binary signals according to a predetermined scheme into a second code.

13. The encryption device of claim 12 further comprising means for shifting all bits one bit position and replacing the most significant bit by bits determined by a function of a determined number of the least significant bits.

14. The encryption device of claim 13 wherein said means for replacing the most significant bit comprises a function generating means for generating the modulo-2 sum of the lesser significant bits for replacing the most significant bit prior to any shift.

15. The encryption device of claim 12 wherein said permuting means further comprises an algorithm operatively connected to said permuting means for running instruction sequences within said permuting means and having a program capable of permuting each of said binary signals of said first code according to said predetermined scheme of said permuting means algorithm, and further capable of inputing each said binary signal so permuted into a second shift register.

16. The encryption device of claim 12, further comprising means for encoding said second code into a matrix onto an object.

17. A system comprising the encryption device of claim 12 further comprising:

(a.) means for reading said second code encoded onto said object; and

(b.) means for deciphering said second code to produce the information originally digitized into binary code form.

18. The system of claim 17 wherein said reading means includes means for photo-optically reading said second in a matrix array on said object.

19. The system of claim 17 wherein said deciphering means includes means for decoding said second code into the set of binary signals comprising said first code, and further means for decoding said first code into said set of m bits embodying said information digitized into binary code form.

20. The system of claim 19 further comprising means for comparing said set of m bits embodying said information digitized into binary code form, with the binary code form of said information digitized.

23. The device of claim 12, wherein said matrix is an n by n matrix and said means for generating the first code generates the first code responsive to a value of n.

21. An encrypted code for encoding information, said code being printed on a substrate and having portions arrayed in a two dimensional matrix pattern having at least four sides comprising dark and substantially non-light reflective portions on a surface of said substrate and comprising light and substantially light reflective portions on a surface of said substrate, wherein the light reflective portions and the non-light reflective portions are arranged in predetermined positions in a plurality of substantially linear rows, said positions being determined by an algorithm implementing at least a plurality of nonlinear feedback permutations of information to be encoded generating at least a second order of code therefrom.

24. The code of claim 21, wherein said matrix is an n by n matrix and said algorithm generates the second order code dependent on a value of n.