IP Library Granted Patent US 7,099,469
Granted Patent B2
US 7,099,469 · App. 09/978,890 · Granted Aug 29, 2006

Method of scrambling and descrambling data in a communication system

Assignee: Motorola, Inc.
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 7,099,469
App. No.
09/978,890
Granted
Aug 29, 2006
Kind
B2
Abstract

A scrambling method ( 510 ) divides a set of data ( 200 ) into a first portion and a second portion. A first scrambling method is performed on the first portion of the set of data to create a scrambled first portion of the data. The second portion of the set of data is modified with the scrambled first portion of the set of data to create a modified second portion of the set of data. A second scrambling method is performed on the modified second portion of the set of data to create a scrambled second portion of the set of data. The scrambled first portion of the set of data is modified with the scrambled second portion of the set of data to create a scrambled set of data ( 220 ). A descrambling method ( 520 ) reverses the scrambling method ( 510 ) to create a descrambed set of data ( 200 ).

Claims (26)

1. A scrambling method for use in a communication system, the method comprising the steps of:

dividing a set of data into a first portion and a second portion;

performing a first scrambling method on the first portion of the set of data to create a scrambled first portion of the data;

modifying the second portion of the set of data with the scrambled first portion of the set of data to create a modified second portion of the set of data;

performing a second scrambling method on the modified second portion of the set of data to create a scrambled second portion of the set of data; and

modifying the scrambled first portion of the set of data with the scrambled second portion of the set of data to create a scrambled set of data, wherein the scrambled set of data is stored in a source device and wherein the first and second scrambling methods recursively execute the above steps until the portion of the set of data to be scrambled reaches a predetermined length.

2. The scrambling method of claim 1 wherein the predetermined length is one byte.

3. The scrambling method of claim 1 further comprising the step of performing a predetermined function on the set of data once the portion of the set of data to be scrambled reaches the predetermined length.

4. The scrambling method of claim 3 wherein the predetermined function is an invertible function.

5. The scrambling method of claim 4 wherein the invertible function is a lookup function.

6. The scrambling method of claim 1 wherein the steps of modifying are invertible.

7. The scrambling method of claim 1 wherein the steps of modifying are selected from a group consisting of: exclusive-or, modular addition, and modular subtraction.

8. The scrambling method of claim 1 further comprising the step of programming the scrambled set of data onto a device.

9. The scrambling method of claim 1 wherein the first and second scrambling methods are cryptographic algorithms.

10. A descrambling method for use in a communication system, the method comprising the steps of:

dividing a set of data into a first portion and a second portion;

modifying the first portion of the set of data with the second portion of the set of data to create a modified first portion of the set of data;

performing a first descrambling method on the second portion of the set of data to create a descrambled second portion of the set of data;

modifying the descrambled second portion of the set of data with the modified first portion of the set of data to create a modified second portion of the set of data; and

performing a second descrambling method on the modified first portion of the set of data to create a descrambled set of data associated with a source device and wherein the first and second descrambling methods recursively execute the above steps until the portion of the set of data to be descrambled reaches a predetermined length.

11. The descrambling method of claim 10 wherein the predetermined length is one byte.

12. The descrambling method of claim 10 further comprising the step of performing a predetermined function on the set of data once the portion of the set of data to be descrambled reaches the predetermined length.

13. The descrambling method of claim 12 wherein the predetermined function is an invertible function.

14. The descrambling method of claim 13 wherein the invertible function is a lookup function.

15. The descrambling method of claim 10 wherein the steps of modifying are invertible.

16. The descramblig method of claim 10 wherein the steps of modifying are selected from a group consisting of: exclusive-or, modular addition, and modular subtraction.

Assignments (2)
CHANGE OF NAME Recorded Apr 6, 2011
From: MOTOROLA, INC
To: MOTOROLA SOLUTIONS, INC.
Reel/Frame 026081/0001 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 17, 2001
From: KUHLMAN, DOUGLAS A.; MESSERGES, THOMAS S.; COLLINS, TIMOTHY JAMES; GURNEY, DAVID P.; KUFFNER, STEPHEN L.
To: MOTOROLA, INC.
Reel/Frame 012275/0089 →
Continuity (1)
Related Publication 20030072445A1 · Apr 17, 2003