US4910772A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Video scrambling apparatus and method based on space filling curves
Assignee: Yeda Research & Development Co. Ltd.
•
Filing: 1988-08-12
•
Granted: 1990-03-20
•
Expires: 2008-08-12
Abstract
Abstract A method of encrypting a video signal employing a pseudo-random Space Filling Curve having a highly irregular scanning pattern for scanning the pixel addresses of a video picture stored in a frame buffer. The method is used with a video scrambler/descrambler device and is characterized by a much higher cryptographic strength than existing techniques, which is not subject to simple correlation attacks by comparing and matching of line portions. In addition, the method features a reduction in the video signal bandwidth for typical pictures.
Inventors
- 👤 Yossi Matias
- 👤 Adi Shamir
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-30 09:46
CPC Classifications
H; H04; H04N; H04N7/00; H04N7/16; H04N7/167; H04N7/169; H04N7/1696
Claims Analysis
Total Claims: 20
Claim 1
Independent Claim
105 words
A method of encrypting a video signal comprising the steps of: storing in the locations of a frame buffer the pixel values of a group of video information lines representing at least a portion of a video picture contained in the video signal; defining a pseudo-random Space Filling Curve (SFC), being a Hamiltonian path and providing a sequence corresponding to locations of the frame buffer mapping random directions of movement between adjacent pixels of the video picture portion; and addressing the locations of the frame buffer in accordance with the defined sequence to read the pixel values thereof for encrypted transmission of the video signal.
Claim 2
Independent Claim
105 words
A method of encrypting a video signal comprising the steps of: storing in the locations of a frame buffer the pixel values of a group of video information lines representing at least a portion of a video picture contained in the video signal; defining a pseudo-random Space Filling Curve (SFC), being a Hamiltonian path and providing a sequence corresponding to locations of the frame buffer mapping random directions of movement between adjacent pixels of the video picture portion; and addressing the locations of the frame buffer in accordance with the defined sequence to read the pixel values thereof for encrypted transmission of the video signal.
Claim 3
Dependent Claim
29 words
The method of claim 1 wherein said frame buffer forms an element of a video scrambler which generates said SFC and addresses said frame buffer location in accordance therewith.
Claim 4
Dependent Claim
29 words
The method of claim 1 wherein said SFC is a Hamiltonian path which visits substantially all the pixels in the video picture exactly once by movement between adjacent pixels.
Claim 5
Dependent Claim
29 words
The method of claim 2 wherein said SFC is a Hamiltonian path which visits substantially all the pixels in the video picture exactly once by movement between adjacent pixels.
Claim 6
Dependent Claim
33 words
The method of claim 1 wherein said SFC provides mapping of at least two of vertical, horizontal and diagonal random directions of movement between substantially all adjacent pixels of the video picture portion.
Claim 7
Dependent Claim
81 words
The method of claim 2 wherein the encryption provided by said video scrambler in the transmission of the video signal is decoded by a descrambler by use of a shared key stream between said scrambler and descrambler, such that the latter generates the same pseudo-random SFC as is used in said scrambler, thereby providing it with the correct sequence with which to write the video signal into the locations of a frame buffer included therein for restoring the original video signal.
Claim 8
Dependent Claim
81 words
The method of claim 3 wherein the encryption provided by said video scrambler in the transmission of the video signal is decoded by a descrambler by use of a shared key stream between said scrambler and descrambler, such that the latter generates the same pseudo-random SFC as is used in said scrambler, thereby providing it with the correct sequence with which to write the video signal into the locations of a frame buffer included therein for restoring the original video signal.
Claim 9
Dependent Claim
81 words
The method of claim 4 wherein the encryption provided by said video scrambler in the transmission of the video signal is decoded by a descrambler by use of a shared key stream between said scrambler and descrambler, such that the latter generates the same pseudo-random SFC as is used in said scrambler, thereby providing it with the correct sequence with which to write the video signal into the locations of a frame buffer included therein for restoring the original video signal.
Claim 10
Dependent Claim
81 words
The method of claim 5 wherein the encryption provided by said video scrambler in the transmission of the video signal is decoded by a descrambler by use of a shared key stream between said scrambler and descrambler, such that the latter generates the same pseudo-random SFC as is used in said scrambler, thereby providing it with the correct sequence with which to write the video signal into the locations of a frame buffer included therein for restoring the original video signal.
Claim 11
Dependent Claim
82 words
The method of claim 2 wherein the encryption provided by said video scrambler in the transmission of the video signal is decoded by a descrambler which has stored therein a plurality of SFC's from which a selection is made in accordance with a signal indicating the SFC being used in the scrambler, thereby providing the descrambler with the correct sequence with which to write the video signal into the locations of a frame buffer included therein for restoring the original video signal.
Claim 12
Dependent Claim
82 words
The method of claim 3 wherein the encryption provided by said video scrambler in the transmission of the video signal is decoded by a descrambler which has stored therein a plurality of SFC's from which a selection is made in accordance with a signal indicating the SFC being used in the scrambler, thereby providing the descrambler with the correct sequence with which to write the video signal into the locations of a frame buffer included therein for restoring the original video signal.
Claim 13
Dependent Claim
82 words
The method of claim 4 wherein the encryption provided by said video scrambler in the transmission of the video signal is decoded by a descrambler which has stored therein a plurality of SFC's from which a selection is made in accordance with a signal indicating the SFC being used in the scrambler, thereby providing the descrambler with the correct sequence with which to write the video signal into the locations of a frame buffer included therein for restoring the original video signal.
Claim 14
Dependent Claim
82 words
The method of claim 5 wherein the encryption provided by said video scrambler in the transmission of the video signal is decoded by a descrambler which has stored therein a plurality of SFC's from which a selection is made in accordance with a signal indicating the SFC being used in the scrambler, thereby providing the descrambler with the correct sequence with which to write the video signal into the locations of a frame buffer included therein for restoring the original video signal.
Claim 15
Dependent Claim
61 words
The method of claim 2 wherein the SFC used for encryption in said video scrambler is included in the transmission of the video signal for use by a descrambler, such that the latter is provided with the correct sequence with which to write the video signal into the locations of a frame buffer included therein, for restoring the original video signal.
Claim 16
Dependent Claim
62 words
The method of claim 3 wherein said pseudo-random SFC is generated by execution of an algorithm whose output domain is a family of said Hamiltonian paths in the rectangular grid graph provided by said scrambler frame buffer, with said SFC being chosen from said Hamiltonian path family and used to define the sequence in which said scrambler frame buffer addresses are read.
Claim 17
Dependent Claim
24 words
The method of claim 15 wherein after a predetermined period of time, the original SFC is replaced by another SFC from the Hamiltonian family.
Claim 18
Dependent Claim
27 words
The method of claim 1 wherein the bandwidth of the video signal is reduced and said SFC preserves the correlation between adjacent pixels of the video picture.
Claim 19
Dependent Claim
40 words
The method of claim 1 wherein the said SFC is applied to a sequence of consecutive frames in the video picture, providing a three-dimensional sequence of possible frame buffer locations within a cubic grid built by the consecutive video frames.
Claim 20
Dependent Claim
10 words
A video scrambling system incorporating the method of claim 1.
References Cited (Backward Citations)
US4070693A
Cited
GB1590579A
Cited
US4405942A
Cited
WO1983003942A1
Cited
US4636851A
Cited
US4575754A
Cited
WO1984002911A1
Cited
EP0123422A2
Cited
US4604650A
Cited
EP0127383A1
Cited
US4594609A
Cited
US4605961A
Cited
US4742544A
Cited
US4620224A
Cited
US4807298A
Cited
US4736420A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1993-03-19 | 1993-09-18 | 1994-03-20 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1997-03-19 | 1997-09-18 | 1998-03-20 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2001-03-19 | 2001-09-18 | 2002-03-20 | $7700.00 | Window Closed / Lapsed |