Uniform permutation privacy system

Claim 2

A privacy communication system comprising means for partitioning an intelligence signal into groups of N successive signal segments; means responsive to each group of signal segments for uniformly permuting the temporal sequence of the N successive segments to form a scrambled signal segment group comprising means for transposing the i th signal segment (i = 1,2, . . . N) to the K 1 i th (modulo N) segment position, where K 1 is an integer prime with respect to N; and means for reconstructing the group of N successive signal segments from the scrambled group comprising means for transposing the j th signal segment (j = 1,2, . . . ,N) of the scrambled segment group to the K 2 j th (modulo N) segment position, where K 2 K 1 = 1 (modulo N).

Claim 3

A privacy communication system comprising means for sampling a speech signal at a predetermined rate, means for partitioning said speech signal samples into groups of N successive samples; means for uniformly permuting each group of N successive samples including first means for transposing the i th sample (i = 1,2, . . . ,N) of the successive sample group to the K 1 i th (modulo N) sample position, where K 1 is an integer prime with respect to N, and means for reconstructing the group of N successive samples from said uniformly permuted group comprising second means for transposing the j th sample (j = 1,2, . . . ,N) of the uniformly permuted group to the K 2 j th (modulo N) sample position, where K 2 K 1 = 1 (modulo N).

Claim 4

A privacy communication system comprising means for sampling a speech signal at a predetermined rate, means for partitioning said speech signal samples into groups of N successive samples; means for uniformly permuting each group of N successive samples including first means for transposing the i th sample (i = 1,2, . . . ,N) of the successive sample group to the K 1 i th (modulo N) sample position, where K 1 is an integer prime with respect to N, and means for reconstructing the group of N successive samples from said uniformly permuted group comprising second means for transposing the j th sample (j = 1,2, . . . ,N) of the uniformly permuted group to the K 2 j th (modulo N) sample position, where K 2 K 1 = 1 (modulo N).

Claim 5

A privacy communication system according to claim 2 wherein said first transposing means comprises means for storing the group of N successive samples in successive order and means for rearranging said successively ordered stored samples to place the K 1 i th (modulo N) stored sample in the i th position, and said second transposing means comprises means for storing the uniformly permuted group of N samples in successive order; and means for rearranging said permuted stored samples to place the K 1 i th (modulo N) stored sample in the j th position.

Claim 6

A privacy communication system according to claim 2 wherein said first transposing means comprises first means for storing the i th sample of the N successive sample group in the K 1 i th (modulo N) position of said first storing means, and means for sequentially retrieving the stored samples from said first storing means in sequence (i = 1,2, . . . ,N); and said second transposing means comprises second means for storing the j th sample of the uniformly permuted group of N samples in the K 2 j th (modulo N) position of said second storing means, and means for sequentially retrieving the stored samples from said second storing means in sequence (j = 1,2, . . . ,N).

Claim 7

A privacy communication system comprising means for sampling an intelligence signal at a predetermined rate; means responsive to successively occurring samples for generating a multibit digital code representative of said intelligence signal samples to form a stream of code bits; means responsive to said code bit stream for partitioning said bit stream into group of N successive bits, first means responsive to each N successsive bit group for transposing the i th bit (i = 1,2, . . . ,N) to the K 1 i th (modulo N) bit position to form a uniformly permuted bit group, where K 1 is an integer prime with respect to N; and means for reconstructing said N successive bit group from said uniformly permuted bit group including second means for transposing the j th bit (j = 1,2, . . . ,N) of the uniformly permuted bit group to the K 2 j th (modulo N) position, where K 2 K 1 = 1 (modulo N).

Claim 8

A privacy communication system comprising means for sampling an intelligence signal at a predetermined rate; means responsive to successively occurring samples for generating a multibit digital code representative of said intelligence signal samples to form a stream of code bits; means responsive to said code bit stream for partitioning said bit stream into group of N successive bits, first means responsive to each N successsive bit group for transposing the i th bit (i = 1,2, . . . ,N) to the K 1 i th (modulo N) bit position to form a uniformly permuted bit group, where K 1 is an integer prime with respect to N; and means for reconstructing said N successive bit group from said uniformly permuted bit group including second means for transposing the j th bit (j = 1,2, . . . ,N) of the uniformly permuted bit group to the K 2 j th (modulo N) position, where K 2 K 1 = 1 (modulo N).

Claim 9

A privacy communication system according to claim 5 wherein said first transposing means comprises means for storing the group of N successive bits in successive order and means for recombining said stored successive ordered bits to place the K 1 i th (modulo N) bit in the i th position of the group; and said second transposing means comprises means for storing the uniformly permuted bit group in successive order and means for recombining said stored permuted ordered bits to place the K 2 j th (modulo N) bit in the j th position.

Claim 10

A privacy communication system according to claim 5 wherein said first transposing means comprises first means for storing the i th sample in the K 1 i th position of said first storing means and means for retrieving said stored bits in sequence from said first storing means in sequence (= 1,2, . . . ,N); and said second transposing means comprises second means for storing the j th sample in the K 2 j th (modulo N) position of said second storing means and means for retrieving said stored bits from said second storing means in sequence (j = 1,2, . . . ,N).

Claim 11

A privacy communication system comprising a communication network, a plurality of stations each having an outgoing line and an incoming line, an encrypting circuit connected to the outgoing line of each station, a decrypting circuit connected to the incoming line of each station, said encrypting circuit comprising means for receiving an outgoing signal from said station outgoing line, means for sampling said outgoing signal at a predetermined rate, means for partitioning said outgoing signal samples into groups of N successive samples, first means for transposing the i th sample (i = 1,2, . . . ,N) of said N successive sample group to the K 1 i th (modulo N) sample position to form a uniformly permuted group, where K 1 is an integer prime with respect to N, and said decrypting circuit comprises means for receiving successive groups of N permuted samples from said communication network, means for reconstructing a group of N successive samples from said permuted group including second means for transposing the j th sample (j = 1,2, . . . ,N) of said uniformly permuted group to the K 2 j th (modulo N) sample position to form a group of N successive samples, where K 2 K 1 = 1 (modulo N), means responsive to said reconstructed group for forming an analog signal, and means for applying said analog signal to said station incoming line.

Claim 12

A privacy communication system comprising a communication network, a plurality of stations each having an outgoing line and an incoming line, an encrypting circuit connected to the outgoing line of each station, a decrypting circuit connected to the incoming line of each station, said encrypting circuit comprising means for receiving an outgoing signal from said station outgoing line, means for sampling said outgoing signal at a predetermined rate, means for partitioning said outgoing signal samples into groups of N successive samples, first means for transposing the i th sample (i = 1,2, . . . ,N) of said N successive sample group to the K 1 i th (modulo N) sample position to form a uniformly permuted group, where K 1 is an integer prime with respect to N, and said decrypting circuit comprises means for receiving successive groups of N permuted samples from said communication network, means for reconstructing a group of N successive samples from said permuted group including second means for transposing the j th sample (j = 1,2, . . . ,N) of said uniformly permuted group to the K 2 j th (modulo N) sample position to form a group of N successive samples, where K 2 K 1 = 1 (modulo N), means responsive to said reconstructed group for forming an analog signal, and means for applying said analog signal to said station incoming line.

Claim 13

A privacy communication system according to claim 8 wherein said first transposing means comprises first means for storing said N successive samples in successive order, and means for retrieving the samples from said first storing means in the K 1 i th (modulo N) order (i = 1,2, . . . ,N); and said second transposing means comprising second means for storing the uniformly permuted group of N samples in successive order and means for retrieving the stored samples from said second storing means in the K 2 j th (modulo N) order (j = 1,2, . . . ,N).

Claim 14

A privacy communication system according to claim 8 wherein said first transposing means comprises first means for storing the i th sample of the N successive sample group in the K 1 i th (modulo N) position (i = 1,2, . . . ,N) of said first storing means, and means for retrieving the stored samples from said first storing means in successive sequence; and said second transposing means comprises second means for storing the j th sample of the uniformly permuted group of N samples in the K 2 j th (modulo N) position (j = 1,2, . . . ,N) of said second storing means, and means for retrieving the stored samples from said second storing means in successive sequence.

Claim 15

A privacy communication system comprising a communication network; a plurality of stations each having an outgoing line and an incoming line; an encrypting circuit connected to the outgoing line of each station, a decrypting circuit connected to the incoming line of each station; said encrypting circuit comprising means for receiving an outgoing signal from said station outgoing line; means for sampling said outgoing signal at a predetermined rate; means responsive to said outgoing signal samples for generating a coded multibit stream corresponding to said outgoing signal; means responsive to said multibit stream for partitioning said bits into groups of N successive bits, and first means for transposing the i th bit (i = 1,2, . . . ,N) of said N successive bit group to the K 1 i th (modulo N) bit position to form a uniformly permuted group, where K 1 is an integer prime with respect to N; and said decrypting circuit comprises means for receiving successive groups of N permuted bits from said communication network; means for reconstructing a group of N successive bits from said uniformly permuted group including second means for transposing the j th bit (j = 1,2, . . . ,N) of said uniformly permuted group to the K 2 j th (modulo N) bit position to form a group of N successive bits, where K 2 K 1 = 1 (modulo N); means responsive to said reconstructed group for forming a replica of the samples of said received permuted bits; means responsive to said sample replicas for forming an analog signal; and means for applying an analog signal to said station incoming line.

Claim 16

A privacy communication system comprising a communication network; a plurality of stations each having an outgoing line and an incoming line; an encrypting circuit connected to the outgoing line of each station, a decrypting circuit connected to the incoming line of each station; said encrypting circuit comprising means for receiving an outgoing signal from said station outgoing line; means for sampling said outgoing signal at a predetermined rate; means responsive to said outgoing signal samples for generating a coded multibit stream corresponding to said outgoing signal; means responsive to said multibit stream for partitioning said bits into groups of N successive bits, and first means for transposing the i th bit (i = 1,2, . . . ,N) of said N successive bit group to the K 1 i th (modulo N) bit position to form a uniformly permuted group, where K 1 is an integer prime with respect to N; and said decrypting circuit comprises means for receiving successive groups of N permuted bits from said communication network; means for reconstructing a group of N successive bits from said uniformly permuted group including second means for transposing the j th bit (j = 1,2, . . . ,N) of said uniformly permuted group to the K 2 j th (modulo N) bit position to form a group of N successive bits, where K 2 K 1 = 1 (modulo N); means responsive to said reconstructed group for forming a replica of the samples of said received permuted bits; means responsive to said sample replicas for forming an analog signal; and means for applying an analog signal to said station incoming line.

Claim 17

A privacy communication system according to claim 11 wherein said first transposing means comprises first means for storing said N successive bits in successive order and means for retrieving the stored set from said first storing means in the K 1 i th (modulo N) order (i = 1,2, . . . ,N), and said second transposing means comprises second means for storing the uniformly permuted group bits in successive order and means for retrieving the stored bits from said second storing means in the K 2 j th (modulo N) order (j = 1,2, . . . ,N).

Claim 18

A privacy communication system according to claim 11 wherein said first transposing means comprises first means for storing the i th bit of the N successive bit group in the K 1 i th (modulo N) position (i = 1,2, . . . ,N) of said first storing means and means for retrieving the stored samples from said first storing means in successive sequence, and said second transposing means comprises second means for storing the j th bit of the uniformly permuted group of N bits in the K 2 j th (modulo N) position (j = 1,2, . . . ,N) of said second storing means and means for retrieving the stored samples from said second storing means in successive sequence.

Claim 19

A privacy communication method comprising the steps of partitioning an intelligence signal into groups of N successive signal segments, uniformly permuting the temporal sequence of the N successive elements to form a scrambled signal segment group by transposing the i th signal segment (i = 1,2, . . . ,N) to the K 1 i th (modulo N) segment position, where K 1 is an integer prime with respect to N, and reconstructing the group of N successive signal segments from said scrambled group by transposing the j th segment (j = 1,2, . . . ,N) of the scrambled segment group to the K 2 j th (modulo N) segment position, where K 2 K 1 = 1 (modulo N).

Claim 20

A privacy communication method comprising the steps of partitioning an intelligence signal into groups of N successive signal segments, uniformly permuting the temporal sequence of the N successive elements to form a scrambled signal segment group by transposing the i th signal segment (i = 1,2, . . . ,N) to the K 1 i th (modulo N) segment position, where K 1 is an integer prime with respect to N, and reconstructing the group of N successive signal segments from said scrambled group by transposing the j th segment (j = 1,2, . . . ,N) of the scrambled segment group to the K 2 j th (modulo N) segment position, where K 2 K 1 = 1 (modulo N).

Claim 21

A privacy communication method comprising the steps of sampling an intelligence signal at a predetermined rate, partitioning said intelligence signal samples into groups of N successive samples; uniformly permuting each group of N successive samples by transposing the i th sample (i = 1,2, . . . ,N) to the K 1 i th (modulo N) sample position, where K 1 is an integer prime with respect to N; and means for reconstructing the group of N successive samples from said uniformly permuted group by transposing the j th sample (j = 1,2, . . . ,N) of the uniformly permuted group to the K 2 j th (modulo N) sample position, where K 2 K 1 = 1 (modulo N).

Claim 22

A privacy communication method comprising the steps of sampling an intelligence signal at a predetermined rate, partitioning said intelligence signal samples into groups of N successive samples; uniformly permuting each group of N successive samples by transposing the i th sample (i = 1,2, . . . ,N) to the K 1 i th (modulo N) sample position, where K 1 is an integer prime with respect to N; and means for reconstructing the group of N successive samples from said uniformly permuted group by transposing the j th sample (j = 1,2, . . . ,N) of the uniformly permuted group to the K 2 j th (modulo N) sample position, where K 2 K 1 = 1 (modulo N).

Claim 23

A privacy communication method comprising the steps of sampling an intelligence signal at a predetermined rate, generating a multibit digital code representative of said intelligence signal from said samples to form a stream of code bits, partitioning said stream of code bits into groups of N successive bits, transposing the i th bit (i = 1,2, . . . ,N) to the K 1 i th (modulo N) bit position to form a uniformly permuted N bit group, where K 1 is an integer prime with respect to N, and reconstructing said N successive bit group from said uniformly permuted group by transposing the j th bit (j = 1,2, . . . ,N) of the uniformly permuted group to the K 2 j th (modulo N) bit position, where K 2 K 1 = 1 (modulo N).

Claim 24

A privacy communication method comprising the steps of sampling an intelligence signal at a predetermined rate, generating a multibit digital code representative of said intelligence signal from said samples to form a stream of code bits, partitioning said stream of code bits into groups of N successive bits, transposing the i th bit (i = 1,2, . . . ,N) to the K 1 i th (modulo N) bit position to form a uniformly permuted N bit group, where K 1 is an integer prime with respect to N, and reconstructing said N successive bit group from said uniformly permuted group by transposing the j th bit (j = 1,2, . . . ,N) of the uniformly permuted group to the K 2 j th (modulo N) bit position, where K 2 K 1 = 1 (modulo N).