Patent EP0278740A2 successfully refreshed from Google Patents.
EP0278740A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
A method for encrypting a code and an encryption device
Assignee: Veritec Inc
•
Filing: 1988-02-10
•
Granted: —
•
Expires: 2008-02-10
Abstract
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.
Inventors
- 👤 Carl Sant'anselmo
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-10-25 08:11
CPC Classifications
G; G07; G07F; G07F7/00; G07F7/08; G07D; G07D7/00; G07D7/20; G07F7/12; G09; G09C; G09C5/00
Claims Analysis
Total Claims: 24
Claim 1
Independent Claim
62 words
A method for encrypting a code in a matrix array comprising the steps of: a.) generating a first code having a series of signals; and b.) permuting said signals to form a second code in a pseudo-random scheme within a matrix having a plurality of signal locations in a first Cartesian direction and a plurality of locations in a second Cartesian direction.
Claim 2
Independent Claim
62 words
A method for encrypting a code in a matrix array comprising the steps of: a.) generating a first code having a series of signals; and b.) permuting said signals to form a second code in a pseudo-random scheme within a matrix having a plurality of signal locations in a first Cartesian direction and a plurality of locations in a second Cartesian direction.
Claim 3
Dependent Claim
61 words
The method of Claim 1 wherein said first code is generated by the steps of: a.) digitizing information sought to be encrypted into a binary code form; b.) inputing said binary code in increments of no more than n bits each into a n-bit shift register; and c.) shifting all bits a predetermined number of bit locations within said shift register.
Claim 4
Dependent Claim
34 words
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.
Claim 5
Dependent Claim
40 words
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.
Claim 6
Dependent Claim
42 words
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.
Claim 7
Dependent Claim
23 words
The method of Claim 5 further comprising the step of comparing the deciphered code with the series of signals comprising said first code.
Claim 8
Dependent Claim
39 words
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.
Claim 9
Dependent Claim
42 words
The method of Claim 7 further comprising the step of dividing said n bits into a series of segments, the sum of bits in the segments equalling n, and sequentially arranging said segments into a matrix of bits representative of binary signals.
Claim 10
Dependent Claim
16 words
The method of Claim 8 further comprising the step of encrypting said matrix onto an object.
Claim 11
Dependent Claim
11 words
The method of Claim 7 wherein said pre-determined scheme is non-linear.
Claim 12
Dependent Claim
46 words
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 limited by said matrix array.
Claim 13
Dependent Claim
46 words
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 limited by said matrix array.
Claim 14
Dependent Claim
102 words
The encryption device of Claim 11 wherein said code generating means further comprises means for digitizing information sought to be encrypted into binary code form having a set of binary signals, and further comprising: a.) a shift register capable of processing n bits at a time; b.) means for inputing said binary code in increments of no more than n bits each into said n-bit shift register; c.) 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.
Claim 15
Dependent Claim
37 words
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.
Claim 16
Dependent Claim
40 words
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.
Claim 17
Dependent Claim
70 words
The encryption device of Claim 1 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.
Claim 18
Dependent Claim
21 words
The encryption device of Claim 11 further comprising means for encoding said second code into a matrix array onto an object.
Claim 19
Dependent Claim
40 words
A system comprising the encryption device of Claim 16 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.
Claim 20
Dependent Claim
23 words
The system of Claim 17 wherein said reading means includes means for photo-optically reading said second in a matrix array on said object.
Claim 21
Dependent Claim
48 words
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 n bits embodying said information digitized into binary code form.
Claim 22
Dependent Claim
32 words
The system of Claim 19 further comprising means for comparing said set of n bits embodying said information digitized into binary code form, with the binary code form of said information digitized.
Claim 23
Dependent Claim
85 words
An encrypted code for encoding information, said code having portions arrayed in a matrix format having at least four sides comprising dark and substantially non-light reflective portions and comprising light and substantially light reflective portions, 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 permutations of information to be encoded generating at least a second order of code therefrom.
Claim 24
Dependent Claim
85 words
An encrypted code for encoding information, said code having portions arrayed in a matrix format having at least four sides comprising dark and substantially non-light reflective portions and comprising light and substantially light reflective portions, 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 permutations of information to be encoded generating at least a second order of code therefrom.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.