METHODS AND APPARATUS TO SECURE COMMUNICATIONS IN A MOBILE NETWORK

• US 20120213373A1
• Filed: 02/21/2011
• Published: 08/23/2012
• Est. Priority Date: 02/21/2011
• Status: Active Grant

• Current Assignee: Malikie Innovations Limited (Key Patent Innovations Limited)
• Original Assignee: Blackberry Limited
• Inventors: Xin, Yan, Qu, Shouxing
• Granted Patent: US 8,588,426 B2
• Time in Patent Office: Days
• US Class Current: 380/287
• CPC Class Codes: H04L 2209/08 Randomization, e.g. dummy operations or using noise
• CPC Class Codes: H04L 63/1466 Active attacks involving interception, injection, modification, spoofing of data unit addresses, e.g. hijacking, packet injection or TCP sequence number attacks
• CPC Class Codes: H04L 9/002 Countermeasures against attacks on cryptographic mechanisms network architectures or network communication protocols for protection against malicious traffic H04L63/1441
• CPC Class Codes: H04W 12/037 of the control plane, e.g. signalling traffic
• CPC Class Codes: H04W 12/12 Detection or prevention of fraud

Abstract

Methods and apparatus to secure communications in a mobile network are disclosed. An example method disclosed herein comprises randomizing a first set of bits associated with information to be communicated over a slow associated control channel by applying a scrambling factor to generate a set of scrambled bits equal in length to the first set of bits. Another example method disclosed herein comprises concatenating a set of error detection bits with a set of information bits associated with information to be transmitted over a slow associated control channel to generate a set of coded bits, and shuffling the set of coded bits to generate a set of shuffled bits.

Claims

1. A method comprising:

randomizing a first set of bits associated with information to be communicated over a slow associated control channel by applying a scrambling factor to generate a set of scrambled bits equal in length to the first set of bits.

2. A method as defined in claim 1 wherein the scrambling factor is applied by performing binary sequence division to divide the first set of bits by the scrambling factor.

3. A method as defined in claim 1 wherein the scrambling factor is a scrambling polynomial.

4. A method as defined in claim 3 wherein a degree of the scrambling polynomial is at least sixteen.

5. A method as defined in claim 1 wherein the scrambling factor is a primitive.

6. A method as defined in claim 1 wherein the scrambling factor is fixed.

7. A method as defined in claim 1 wherein the scrambling factor is determined based on a frame number and a ciphering key.

8. A method as defined in claim 1 wherein the first set of bits includes a set of information bits concatenated with a set of augmenting bits.

9. A method as defined in claim 8 further comprising performing encoding with puncturing after randomizing the first set of bits.

10. A method as defined in claim 1 wherein the set of scrambled bits comprises a first subset of scrambled bits and a second subset of scrambled bits.

11. A method as defined in claim 10 wherein the first subset of scrambled bits corresponds to a layer-1 header and the second subset of scrambled bits corresponds to higher layer information.

12. A method as defined in claim 10 further comprising concatenating a set of error detection bits with the set of scrambled bits to generate a set of coded bits.

13. A method as defined in claim 12 further comprising shuffling the set of coded bits to generate a set of shuffled bits, wherein a length of each group of consecutive bits from the second subset of scrambled bits in the generated set of shuffled bits is less than a predetermined number.

14. A method as defined in claim 13 wherein the predetermined number is five.

15. A method as defined in claim 13 wherein the set of coded bits is a first set of coded bits, and further comprising performing forward error correction coding on the set of shuffled bits to generate a second set of coded bits.

16. A method as defined in claim 15 wherein performing forward error correction coding comprises performing convolutional coding.

17. A method as defined in claim 12 further comprising shuffling the set of coded bits to generate a set of shuffled bits, wherein shuffling the set of coded bits comprises:

generating a first subset of shuffled bits and a second subset of shuffled bits, wherein

the first subset of shuffled bits comprises groups of three bits that include two bits from the first subset of scrambled bits and one bit from the second subset of scrambled bits, and

the second subset of shuffled bits comprises groups of five bits that include four bits from the second subset of scrambled bits and one bit from the set of error detection bits.

18. A tangible machine readable medium storing machine readable instructions which, when executed, cause a machine to at least perform the method as defined in claim 1.

19-36. -36. (canceled)

37. A method comprising:

concatenating a set of error detection bits with a set of information bits associated with information to be transmitted over a slow associated control channel to generate a set of coded bits; and

shuffling the set of coded bits to generate a set of shuffled bits.

38. A method as defined in claim 37 wherein the set of information bits comprises a first subset of information bits and a second subset of information bits.

39. A method as defined in claim 38 wherein a length of each group of consecutive bits from the second subset of information bits in the generated set of shuffled bits is less than a predetermined number.

40. A method as defined in claim 39 wherein the predetermined number is five.

41. A method as defined in claim 39 wherein the set of coded bits is a first set of coded bits, and further comprising performing forward error correction coding on the set of shuffled bits to generate a second set of coded bits.

42. A method as defined in claim 41 wherein performing forward error correction coding comprises performing convolutional coding.

43. A method as defined in claim 38 wherein shuffling the set of coded bits comprises:

generating a first subset of shuffled bits and a second subset of shuffled, wherein

the first subset of shuffled bits comprises groups of three bits that include two bits from the first subset of information bits and one bit from the second subset of information bits, and

the second subset of shuffled bits comprises groups of five bits that include four bits from the second subset of information bits and one bit from the set of error detection bits.

44. A tangible machine readable medium storing machine readable instructions which, when executed, cause a machine to at least perform the method as defined in claim 37.

45-96. -96. (canceled)