System using data compression and hashing adapted for use for multimedia encryption

• US 7,978,847 B1
• Filed: 09/24/1999
• Issued: 07/12/2011
• Est. Priority Date: 09/24/1999
• Status: Expired due to Fees

• Current Assignee: Lawrence Livermore National Security LLC (Government of the United States of America)
• Original Assignee: Lawrence Livermore National Security LLC (Government of the United States of America)
• Inventors: Coffland, Douglas R.
• Primary Examiner(s): Betit, Jacob F
• Application Number:
  US09/405,031
• Time in Patent Office: 4,309 Days
• Field of Search: 364/717, 364/78, 380/28, 380/46, 380/264, 380/213, 380/205, 380/214, 380/267, 380/44, 380/277, 380/283, 386/94, 705/51, 705/57, 713/171
• US Class Current: 380/44
• CPC Class Codes: H04L 2209/08 Randomization, e.g. dummy operations or using noise
• CPC Class Codes: H04L 2209/30 Compression, e.g. Merkle-Damgard construction
• CPC Class Codes: H04L 9/0662 with particular pseudorandom sequence generator
• CPC Class Codes: H04N 21/23476 by partially encrypting, e.g. encrypting the ending portion of a movie

Abstract

A system and method is disclosed for multimedia encryption. Within the system of the present invention, a data compression module receives and compresses a media signal into a compressed data stream. A data acquisition module receives and selects a set of data from the compressed data stream. And, a hashing module receives and hashes the set of data into a keyword. The method of the present invention includes the steps of compressing a media signal into a compressed data stream; selecting a set of data from the compressed data stream; and hashing the set of data into a keyword.

Claims

1. A method adapted for use for multimedia encryption, comprising the steps of:

acquiring a random noise only media signal containing random noise that is unpredictable from one moment to the next and not being chaotic noise;

compressing said random noise only media signal containing random noise that is unpredictable from one moment to the next and not being chaotic noise;

selecting a set of data from the compressed media signal; and

hashing the set of data into a keyword.

2. The method of claim 1 wherein:

the compressed media signal includes data frames; and

the selecting step includes the step of selecting one frame of data.

3. The method of claim 1 wherein:

the compressed media signal includes data frames and data frame boundaries; and

the selecting step includes the step of selecting a set of data which crosses over several data frame boundaries.

4. The method of claim 1 wherein:

the compressed media signal includes compression transform coefficients; and

the selecting step includes the step of selecting a set of compression transform coefficients.

5. The method of claim 1 wherein:

the compressed media signal includes data frames of varying length; and

the selecting step includes the step of selecting a set of data frames.

6. The method of claim 1 wherein:

the compressed media signal includes predictive data frames; and

the selecting step includes the step of selecting a predictive data frame.

7. The method of claim 1:

wherein the media signal includes a noise signal amplitude;

further comprising the step of quantizing the media signal with a quantization step size smaller than the noise signal amplitude; and

wherein the compressing step includes the step of compressing the quantized media signal.

8. A system adapted for use for multimedia encryption comprising:

acquisition means for acquiring a media signal, said acquisition means including a random noise transducer for acquiring random noise only, said random noise being unpredictable from one moment to the next and not being chaotic noise;

data compression means coupled to said acquisition means to receive and compress said media signal containing random noise that is unpredictable from one moment to the next and not being chaotic noise into a compressed data stream;

data acquisition means coupled to said data compression means to receive and select a set of data from the compressed data stream; and

hashing means coupled to said data acquisition means to receive and hash the set of data into a keyword.

9. The system of claim 8 wherein the set of data is one frame of data within the compressed data stream.

10. The system of claim 8 wherein the set of data crosses over several frame boundaries within the compressed data stream.

11. The system of claim 8 wherein:

the compressed data stream includes compression transform coefficients; and

the set of data includes a set of compression transform coefficients.

12. The system of claim 8 wherein:

the compressed data stream includes data frames of varying length; and

the set of data includes a set of data frames.

13. The system of claim 8 wherein:

the compressed data stream includes predictive data frames; and

the set of data includes a predictive data frame.

14. The system of claim 8:

wherein the media signal includes a noise signal amplitude;

further comprising, an analog to digital converter, having a quantization step size smaller than the noise signal amplitude, coupled to receive and quantize the media signal; and

wherein the data compression module compresses the quantized media signal into a compressed data stream.

15. The system of claim 8 wherein the data compression module compresses the media signal into one from a group consisting of:

MJPEG, MPEG1, MPEG2, or MPEG4, H.261, H.320, and H.323 formats.

16. The system of claim 8 further comprising:

a pseudo-random number generator coupled to receive and process the keyword in to a set of keywords.

17. A system adapted for use for multimedia encryption, comprising:

acquisition means for acquiring a media signal, said acquisition means including a random noise transducer for acquiring said media signal, said random noise transducer acquiring said media signal containing only random noise that is unpredictable from one moment to the next and not being chaotic noise;

data compression means coupled to said acquisition means to receive and compress said media signal containing random noise that is unpredictable from one moment to the next into a compressed data stream;

selection means coupled to said data compression means for selecting a set of data from the compressed data stream; and

hashing means coupled to said selection means for hashing the set of data into a keyword.

18. The system of claim 17 wherein:

the compressed media signal includes data frames; and

the means for selecting includes means for selecting one frame of data.

19. The system of claim 17 wherein:

the compressed media signal includes data frames and data frame boundaries; and

the means for selecting includes means for selecting a set of data which crosses over several data frame boundaries.

20. The system of claim 17 wherein:

the compressed media signal includes compression transform coefficients; and

the means for selecting includes means for selecting a set of compression transform coefficients.

21. The system of claim 17 wherein:

the compressed media signal includes data frames of varying length; and

the means for selecting includes means for selecting a set of data frames.

22. The system of claim 17 wherein:

the compressed media signal includes predictive data frames; and

the means for selecting includes means for selecting a predictive data frame.

23. The system of claim 17:

wherein the media signal includes a noise signal amplitude;

further comprising means for quantizing the media signal with a quantization step size smaller than the noise signal amplitude; and

wherein the means for compressing includes means for compressing the quantized media signal.

24. A computer-useable medium embodying computer program code adapted for use for multimedia encryption by executing the steps of:

acquiring a random noise only media signal, said random noise only media signal containing random noise that is unpredictable from one moment to the next and not being chaotic noise;

compressing said random noise only media signal, said random noise only media signal containing random noise that is unpredictable from one moment to the next and not being chaotic noise;

selecting a set of data from the compressed media signal; and

hashing the set of data into a keyword.

25. The computer-useable medium of claim 24 wherein:

the compressed media signal includes data frames; and

the selecting step includes the step of selecting one frame of data.

26. The computer-useable medium of claim 24 wherein:

the compressed media signal includes data frames and data frame boundaries; and

the selecting step includes the step of selecting a set of data which crosses over several data frame boundaries.

27. The computer-useable medium of claim 24 wherein:

the compressed media signal includes compression transform coefficients; and

the selecting step includes the step of selecting a set of compression transform coefficients.

28. The computer-useable medium of claim 24 wherein:

the compressed media signal includes data frames of varying length; and

the selecting step includes the step of selecting a set of data frames.

29. The computer-useable medium of claim 24 wherein:

the compressed media signal includes predictive data frames; and

the selecting step includes the step of selecting a predictive data frame.

30. The computer-useable medium of claim 24:

wherein the media signal includes a noise signal amplitude;

further comprising the step of quantizing the media signal with a quantization step size smaller than the noise signal amplitude; and

wherein the compressing step includes the step of compressing the quantized media signal.