US5161244A — Cryptographic system based on information differe…

Claim 1

Independent Claim 325 words

A method of generating a cipher key based on information difference in a cryptographic system comprised of at least a first and a second cryptography stations, said method comprising the steps of storing, in said first and second stations (A,B), a respective string (S A ,S B ) of digits selected from a finite alphabet, in said first station (A), generating an error-control information string (C) from the respective string (S A ) stored in said first station (A), transmitting said error-control information string (C) from said first station (A) to said second station (B) over an error-free public channel CH1, in said second station (B), generating a particular string (D) and a decision bit (F) representative of a reliability estimate, said particular string (D) being that string which maximizes a predetermined reliability function of a string combination (S B ,C,D) consisting of said string (S B ) stored in said second station (B), said error-control information string (C) and said particular string (D), and said decision bit (F) being assigned the value 1 if and only if, when said predetermined reliability function is maximized as said above, a maximum value taken on by said predetermined reliability function is greater than a predetermined threshold, said decision bit (F) else being assigned the value 0, transmitting said value of said decision bit (F) from said second station (B) to said first station (A) over an error-free public channel CH2, in said first and second stations (A,B), tagging as accepted said respective strings (S A ,S B ) stored in said first and second stations (A,B) when said decision bit (F) has the value 1, performing the above sequence of steps a predetermined number of times to result in a corresponding plurality of tagged strings, and at said first and second stations (A,B), concatenating said tagged strings (S A ,S B ) to result in a random cipher key shared by said first and second stations (A,B).

Claim 2

Independent Claim 325 words

A method of generating a cipher key based on information difference in a cryptographic system comprised of at least a first and a second cryptography stations, said method comprising the steps of storing, in said first and second stations (A,B), a respective string (S A ,S B ) of digits selected from a finite alphabet, in said first station (A), generating an error-control information string (C) from the respective string (S A ) stored in said first station (A), transmitting said error-control information string (C) from said first station (A) to said second station (B) over an error-free public channel CH1, in said second station (B), generating a particular string (D) and a decision bit (F) representative of a reliability estimate, said particular string (D) being that string which maximizes a predetermined reliability function of a string combination (S B ,C,D) consisting of said string (S B ) stored in said second station (B), said error-control information string (C) and said particular string (D), and said decision bit (F) being assigned the value 1 if and only if, when said predetermined reliability function is maximized as said above, a maximum value taken on by said predetermined reliability function is greater than a predetermined threshold, said decision bit (F) else being assigned the value 0, transmitting said value of said decision bit (F) from said second station (B) to said first station (A) over an error-free public channel CH2, in said first and second stations (A,B), tagging as accepted said respective strings (S A ,S B ) stored in said first and second stations (A,B) when said decision bit (F) has the value 1, performing the above sequence of steps a predetermined number of times to result in a corresponding plurality of tagged strings, and at said first and second stations (A,B), concatenating said tagged strings (S A ,S B ) to result in a random cipher key shared by said first and second stations (A,B).

Claim 3

Dependent Claim 102 words

The method of claim 1, in which said predetermined reliability function is defined as a conditional probability P(S A =D|S B =S B ,C=C) that a random variable (S A ) corresponding to said string (S A ) stored in said first station (A) is equal to said particular string (D), given the conditions that a random variable (S B ) corresponding to said string (S B ) stored in said second station (B) is equal to that latter string (S B ) and a random variable (C) corresponding to said error-control information string (C) is equal to that latter string (C).

Claim 4

Dependent Claim 89 words

The method of claim 1, in which, in said first station (A), a random string (R) is generated and then a concatenation is performed on said string (S A ) stored in said first station (A) and said random string (R) to result in a concatenated string (S A #R) which is substituted for said string (S A ) stored in said first station (A) when said error-control information string (C) is generated, so that said error-control information string (C) is generated from said concatenated string (S A #R).

Claim 5

Dependent Claim 133 words

The method of claim 3, in which said predetermined reliability function is defined as a conditional probability P(S A #R=D|S B =S B ,C=C) that a random variable (S A #R) corresponding to said concatenated string (S A #R) stored in said first station (A) is equal to said particular string (D), given the conditions that a random variable (S B ) corresponding to said string (S B ) stored in said second station (B) is equal to that latter string (S B ) and a random variable (C) corresponding to said error-control information string (C) is equal to that latter string (C), and said decision bit (F) is assigned the value 1 if and only if said conditional probability P(S A #R=D|S B =S B ,C=C) is greater than a predetermined threshold.

Claim 6

Dependent Claim 133 words

The method of claim 4, in which said error-control information string (C) is generated by first encoding said random string (R) to result in an encoded string and then adding digit by digit said encoded string and said string (S A ) stored in said first station (A), and said predetermined reliability function is defined as a conditional probability P(R=D|S B =S B ,C=C) that a random variable (R) corresponding to said random string (R) is equal to said particular string (D), given the condition that a random variable (S B ) corresponding to said string (S B ) stored in said second station (B) is equal to that latter string (S B ) and a random variable (C) corresponding to said error-control information string (C) is equal to that latter string (C).

Claim 7

Dependent Claim 53 words

The method of claim 1, in which, when said decision bit (F) has the value 1, a string compression is performed in said first station (A) on said string (S A ) stored therein to result in a first compressed string (G A ) which is then stored in said first station (A).

Claim 8

Dependent Claim 112 words

The method of claim 6, in which the sequence of steps is repeated at least once, and in said repeated sequence said predetermined reliability function is defined as a conditional probability P(G A =|S B =S B ,C=C) that a random variable (G A ) corresponding to said first compressed string (G A ) is equal to said particular string (D), given the condition that a random variable (S B ) corresponding to said string (S B ) stored in said second station (B) is equal to that latter string (S B ) and a random variable (C) corresponding to said error-control information string (C) is equal to that latter string (C).

Claim 9

Dependent Claim 51 words

The method of claim 6, in which, when said decision bit (F) has the value 1, a string compression also is performed in said second station (B) on said particular string (D) to result in a second compressed string (G B ) which is then stored in said second station (B).

Claim 10

Dependent Claim 74 words

The method of claim 8, in which identical string compressions are performed in said first station (A) on said string (S A ) stored therein to result in a first compressed string (G A ) which is then stored in said first station (A) and in said second station (B) on said particular string (D) to result in a second compressed string (G B ) which is then stored in said second station (B).

Claim 11

Dependent Claim 79 words

The method of claim 5, in which, when said decision bit (F) has the value 1, identical string compressions are performed in said first station (A) on random string (R) to result in a first compressed string (G A ) which is then stored in said first station (A) and in said second station (B) on said particular string (D) to result in a second compressed string (G B ) which is then stored in said second station (B).

Claim 12

Dependent Claim 38 words

The method of claim 6, in which compression of a string of digits is defined as generating a compressed string consisting of digits, each of which is a linear combination of digits of said string subjected to compression.

Claim 13

Dependent Claim 41 words

The method of claim 1, in which said error-control information string (C) is generated as a string consisting of digits, each of which is a linear combination of digits of said string (S A ) stored in said first station (A).

Claim 14

Dependent Claim 12 words

The method of claim 1, in which all strings are binary strings.

Claim 15

Dependent Claim 43 words

The method of claim 11, in which all strings are binary strings consisting of a set of bits, and said linear combination of digits is defined as a sum modulo 2 of the bits comprised in a subset of said set of bits.

Claim 16

Dependent Claim 76 words

The method of claim 14, in which both said strings (S A ,S B ) respectively stored in said first and second stations (A,B) have a predetermined number N of bits, said error-control information string (C) consists of a number N-1 of parity check bits, and compression of a string is defined as replacing the latter string by a single bit which results from said linear combination being applied to all bits of the latter string.

Claim 17

Dependent Claim 84 words

The method of claim 15, in which said decision bit (F) is assigned the value 1 when said error-control information string (C) received in said second station (B) is equal to an auxiliary error-control information string (C') computed in said second station (B) for said string (S B ) stored in said second station (B) in the same manner as said error-control information string (C) is computed in said first station (A) for said string (S A ) stored in said first station (A).

Claim 18

Dependent Claim 20 words

The method of claim 1, in which the sequence of steps is performed a predetermined number of times in succession.

Claim 19

Dependent Claim 35 words

The method of claim 17, in which each of said strings (S A ,S B ) respectively stored in said first and second stations (A,B) is a result of a previously performed sequence of steps.

Claim 20

Dependent Claim 108 words

The method of claim 18, in which each of said strings (S A ,S B ) respectively stored in said first and second stations (A,B) is a result (G A ,G B ) of a previously performed sequence of steps including a string compression performed in said first station (A) on said string (S A or R) stored therein to result in a first compressed string (G A ) which is then stored in said first station (A) and in said second station (B) on said particular string (D) to result in a second compressed string (G B ) which is then stored in said second station (B).

Claim 21

Dependent Claim 24 words

The method of claim 17, in which said first and second stations (A,B) exchange their respective roles when the sequence of steps is repeated.

Claim 22

Dependent Claim 94 words

The method of claim 1, in which the sequence of steps is simultaneously performed a predetermined number of times in parallel, resulting in a same predetermined number of resulting error-control information strings (C) and resulting values of said decision bit (F), all said resulting error-control information strings (C) being merged to be transmitted from said first station (A) to said second station (B) in one message, and all said resulting values of said decision bit (F) being merged to be transmitted from said second station (B) to said first station (A) in one message.

Claim 23

Dependent Claim 242 words

A cryptographic system comprising a first and a second cryptography station (A,B), each station (A,B) comprising a respective transmitter (TRA,TRB) and a respective receiver (REA,REB) capable of mutually transferring information strings over respective error-free public channels (CH1,CH2), and a storage means (STA,STB) for storing respective strings of digits (S A ,S A ,G A ,G B ), the first station (A) further comprising a string compressor (SCA) having inputs respectively connected to an output of the respective storage means (STA) and to an output of the respective receiver (REA), and having an output connected to an input of the respective storage means (STA), and an encoder (ENC) having an input connected to said output of the respective storage means (STA) and an output connected to an input of the respective transmitter (TRA), and the second station (B) further comprising a decoder (DEC) having an input connected to an output of the respective receiver (REB) and to an output of the respective storage means (STB), a string compressor (SCB) having an input connected to an output of the decoder (DEC) and an output connected to an input of the respective storage means (STB), and a reliability estimator (RES) having inputs each respectively connected to said outputs of the decoder (DEC), the respective receiver (REB) and the respective storage means (STB), and having an output connected to a further input of the string compressor (SCB) and to an input of the respective transmitter (TRB).

Claim 24

Dependent Claim 242 words

A cryptographic system comprising a first and a second cryptography station (A,B), each station (A,B) comprising a respective transmitter (TRA,TRB) and a respective receiver (REA,REB) capable of mutually transferring information strings over respective error-free public channels (CH1,CH2), and a storage means (STA,STB) for storing respective strings of digits (S A ,S A ,G A ,G B ), the first station (A) further comprising a string compressor (SCA) having inputs respectively connected to an output of the respective storage means (STA) and to an output of the respective receiver (REA), and having an output connected to an input of the respective storage means (STA), and an encoder (ENC) having an input connected to said output of the respective storage means (STA) and an output connected to an input of the respective transmitter (TRA), and the second station (B) further comprising a decoder (DEC) having an input connected to an output of the respective receiver (REB) and to an output of the respective storage means (STB), a string compressor (SCB) having an input connected to an output of the decoder (DEC) and an output connected to an input of the respective storage means (STB), and a reliability estimator (RES) having inputs each respectively connected to said outputs of the decoder (DEC), the respective receiver (REB) and the respective storage means (STB), and having an output connected to a further input of the string compressor (SCB) and to an input of the respective transmitter (TRB).

Claim 25

Dependent Claim 23 words

A cryptographic system according to claim 22, in which said decoder (DEC) and said reliability estimator (RES) are merged into a single device.

Claim 26

Dependent Claim 42 words

A cryptographic system according to claim 22, in which the first station (A) further comprises a random generator (RAN) whose output is connected to a further input of the respective string compressor (SCA) and to a further input of the encoder (ENC).

Annuity Stage	Window Opens	Payment Deadline	Surcharge Period Until	Estimated Fee	Status
3.5 Years (Year 4)	1995-11-03	1996-05-04	1996-11-03	$2000.00	Window Closed / Lapsed
7.5 Years (Year 8)	1999-11-03	2000-05-04	2000-11-03	$3760.00	Window Closed / Lapsed
11.5 Years (Year 12)	2003-11-03	2004-05-04	2004-11-03	$7700.00	Window Closed / Lapsed

Cryptographic system based on information difference

Abstract

Inventors

Bibliographic Details

Claims Analysis

References Cited (Backward Citations)

USPTO Annuity & Maintenance Windows

Assigned Categories & Tags

Assign Category Tag