Classifications

• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
  • H04L9/30—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04J—MULTIPLEX COMMUNICATION
  • H04J13/00—Code division multiplex systems
  • H04J13/0074—Code shifting or hopping
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04J—MULTIPLEX COMMUNICATION
  • H04J13/00—Code division multiplex systems
  • H04J13/10—Code generation
  • H04J13/12—Generation of orthogonal codes
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04J—MULTIPLEX COMMUNICATION
  • H04J13/00—Code division multiplex systems
  • H04J13/16—Code allocation
  • H04J13/18—Allocation of orthogonal codes
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
  • H04L9/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
  • H04L9/065—Encryption by serially and continuously modifying data stream elements, e.g. stream cipher systems, RC4, SEAL or A5/3
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
  • H04L9/14—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using a plurality of keys or algorithms
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L2209/00—Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
  • H04L2209/34—Encoding or coding, e.g. Huffman coding or error correction

Definitions

• the invention relates to a method for encrypting a digital data stream in a transmission system which has a transmitter for modulating a digital data stream and for transmitting the modulated digital data stream, as well as a receiver for receiving the modulated digital data stream and for recovering the digital data stream.
• a transmission system that carries out the modulation or encryption on the basis of an orthogonal code.
• the invention also relates to such a transmission system.
• the invention relates in particular to an encryption method that uses an orthogonal code for the modulation.
• the invention furthe ⁇ nore relates to a transmission system that can be used for cordless as well as line-based networks. It can be used for single-carrier as well as multi- carrier modulation.
• cordless transmission systems it can be used for systems with a single antenna as well as for those with several antennae.
• CDMA Code Division Multiple Access
• the CDMA method carries out a division of the spectrum into a broad frequency band, referred to in the following as
• the digital data stream comprises a successive sequence of symbols.
• Each symbol of the digital data stream d® of the k th connection (link) is multiplied during the entire connection by the same spreading frequency or by the same spreading code c w .
• the vector stated in the equation (2) describes a spreading code c ⁇ that is composed of positive and negative rectangular pulses as well as zero values. Its period T c is a constant of P bits and expresses the duration of the validity of one of the elements en to Cp- ⁇ _. If— as in the CDMA method - an orthogonal spreading code is used, the spread signal s® can be received by the k th subscriber as a reception signal r (k) ' and the digital data stream can be recovered through correlation of the reception signal r ' with the same spreading code c ⁇ that was also used in the mixing.
• Establishment of the spreading code takes place for example after connection set-up. Since the CDMA method is used in networks in which different connections can be set up simultaneously, numerous different spreading codes exist. Here, each connection is assigned a different spreading code, so that the transmitted data can be decoded only by the authorized recipient. The number of spreading codes used in the CDMA method is limited; the spreading codes themselves can be found out. During the entire data transmission from one network subscriber to another, according to equation (1) only the one spreading code established by the transmitting subscriber, is used. This leads to the situation that data streams that have been intercepted and stored by unauthorized receivers can be decoded through correlation of the received spectrum with various orthogonal codes. Such transmission systems are thus not secure against eavesdropping.
• the patent application GB 2 331 207 A discloses a communication system that uses orthogonal codes in the CDMA method.
• it relates to an orthogonal multiple access system that divides the channels according to a hopping pattern of the orthogonal code.
• the transmitter has a first generator for the orthogonal hopping code, which has an orthogonal code generator for producing the orthogonal code in accordance with a hopping pattern, and a hopping controller that is connected to the orthogonal code generator for producing the hopping pattern.
• the first generator for the hopping orthogonal code includes a memory for storing the orthogonal code for the output in accordance with the hopping pattern, and a hopping controller for producing the hopping pattern and for outputting the hopping pattern to the memory.
• different orthogonal codes have different hopping periods T n0p -
• T hop an encryption function is realized on the transmitter side, or a decoding function is realized on the receiver side: however, this is aimed only at the overall communication system and not at the individual channels, each of which is assigned a spreading code that is to be used constantly.
• the orthogonal codes are produced by a Hopping Code Generator (HCG) in accordance with a hopping pattern that can be selected by the hopping controller.
• HCG Hopping Code Generator
• the hopping time of an individual orthogonal code can be shorter than the duration of a data unit, identical to the duration of a data unit, or an n-multiple of the length of a data unit, where n is a whole number.
• the international patent application WO 02/056 17 Al discloses a method for operating a CDMA communication system, which in a coverage area of a base station assigns one spreading code out of a number of spreading codes to individual subscribers of a number of subscriber stations, and which then during transmission periodically hops between the spreading codes within the cell, and in fact within the quantity of spreading codes. So that at any given time, no two subscriber stations are working with the same spreading code, all subscribers are registered in a table containing the PN codes, with the subscribers being offset relative to one another.
• the subscribers are moved to the same extent, so that they hop from one code to another whilst retaining their offset.
• the step of periodic hopping preferably changes from the currently-used spreading code to the next spreading code at a symbol rate or a multiple of the symbol rate.
• the system can be one with a fixed data rate or with a variable data rate. What is decisive here is that all subscribers registered in the table are moved to the same extent, so that their offset is maintained and it is thus ensured that each subscriber works with a different spreading code. In order to ensure this, the allocation of the spreading codes and of the pattern for the hopping takes place in a centralized and co-ordinated manner.
• the pattern for the hopping is established and is known to every subscriber, so that it is ensured that the distance between the subscribers in the table is maintained. By hopping from the currently-used spreading code to another spreading code, any interference that may be present between two subscribers is reduced. It is an object of the present invention to define a method for encrypting a digital data stream in a transmission system that uses orthogonal codes for the modulation, which increases the security of the data stream against eavesdropping. It is furthermore an object of the invention to define a method for decoding a digital data stream that has been transmitted encrypted. It is furthermore the task of the invention to define a device for carrying out such a method.
• Increasing the degree of encryption by varying the encryption, as described in claim 1, during an existing connection makes it more difficult for an unauthorized third party to find out the content of the data stream on the basis of intercepted data by trying out all known spreading codes, since each individual spreading code, even if it is actually known, is applied only for a short time, and then in a quasi-random sequence another spreading code from the established quantity is applied and/or the length of the hop interval from one spreading code to the next is varied.
• the assigned sequence for the application of the different spreading codes is valid only for a single k th connection, and is known only to the transmitting and the receiving device. This sequence is not produced centrally and is not assigned to several connections, so that the assigned sequence for a particular connection is not known to others.
• the sequence is established by the transmitting device and is for example produced by a random generator or taken from a table stored in a memory.
• the sequence for the use of the different spreading codes is preferably of a random nature here.
• the hop intervals assigned to a k th connection indicates the validity for a spreading code, and can be defined as a period, i.e. a time-related period of validity, or as a number of data packets.
• the hop interval is established decentrally by the transmitting device, and is notified to the receiving device.
• the sequence for the use of the content of a set of spreading codes can bedefmed by a permutation function which is constructed as a vector and which states the respective position of the spreading code that is to be used at that moment. In the first place of the vector is the position of the first spreading code that is to be used, in the second place the position of the second spreading code to be used, etc.
• the permutation function includes M elements.
• a first permutation procedure is executed, which contains a loop with the following steps: setting of an interval to " 1 " ; waiting for the end of a predefined hop interval; increasing the interval by the value 1 ; - carrying out a comparison to see whether the current value of the interval is greater than the total number of elements of a permutation function which states the positions of the spreading code of a set of spreading codes that is to be used for encrypting the digital data stream, wherein alternatively the following takes place: - if the comparison has a positive result: resetting of the interval to "1"; - if the comparison has a negative result: equating the current spreading code with the spreading code that stands at the position stipulated by the permutation function.
• This method describes the definition or allocation of the spreading code that is to be used respectively at a given time.
• the task of the invention is fulfilled in that the device has a first code generator that produces the respectively current spreading code.
• the production of the respectively current spreading code can take place contemporaneously during encryption, or can be concluded before encryption, wherein then the spreading codes to be used during encryption are for example stored in a table in a ROM or other memory.
• the task is fulfilled through the execution of a second permutation procedure that contains a loop with the following steps: - setting an interval to "1"; waiting for the end of a predefined hop interval; increasing the interval by the value 1; carrying out a comparison to see whether the current value of the interval is greater than the total number of elements of a permutation function which states the positions of the spreading code of a set of spreading codes that is to be used for decoding the encrypted digital data stream, wherein alternatively the following takes place: - if the comparison has a positive result: resetting of the interval to "1"; - if the comparison has a negative result: equating the current spreading code with the spreading code that stands at the position stipulated by the permutation function.
• the loop describes here ensures that the received signal is respectively decoded with the same code that was used for encryption, and through this the digital data stream is recovered.
• the device for carrying out a decoding method the task is solved in that the device has a second code generator that produces the current spreading code.
• the current spreading code can be produced contemporaneously during decoding, or can be produced in advance and stored in a suitable memory.
• a second code generator means that both the transmitting device and the receiving device have a code generator.
• the code generator that is used during the k th connection as the second code generator, namely as the code generator for the decoding, can also be the first code generator used for the encryption during another connection.
• the transmission system has a first device in which the digital data stream is mixed with a spreading code, and has a second device in which the received, encrypted signal and the spreading code are supplied to a correlator, and the transmission system has means for carrying out encryption, carrying out decoding of a digital data stream that was transmitted encrypted.
• These means can be a clock generator, a memory (ROM) for storing the spreading code and the instructions which are communicated with the aid of the encryption key.
• the method according to the invention for encrypting and decoding a digital data stream can be used in both cordless and line-based networks, wherein the level of the degree of encryption and thus the level of protection against unauthorized eavesdropping can be adapted to the respective requirement.
• Advantages of the invention are that the degree of encryption is increased during data transmission, whilst the necessary bandwidth remains unchanged. This advantage is achieved through the fact that the encryption of the digitized data takes place in the physical layer (layer 1) of the OSI 7-layer model. In this connection, the degree of encryption stands for a level of complexity.
• Fig. 1 shows schematically a CDMA transmitter according to the prior art
• Fig. 2 shows schematically a CDMA receiver according to the prior art
• Fig. 3 shows a device for encryption in accordance with the invention, in a schematic representation
• Fig. 4 shows a device for decoding in accordance with the invention, in a schematic representation
• Fig. 5 shows in a schematic representation a flow chart [for] a method in accordance with the invention, for encrypting a digital data stream
• Fig. 6 shows schematically, in a flow chart, a method in accordance with the invention, for decoding and recovering a digital data stream
• Fig. 7 contains a table with certain permutation functions.
• Figure 1 shows schematically a transmitter for transmission with the CDMA method.
• the digital data stream d 1 - - 1 of the k th connection is mixed with a spreading code c ⁇ .
• the transmission signal s® that is created thus is sent to the receiving subscriber, either cordlessly or line-based.
• the spreading code c® is constant for the duration of the connection.
• An unauthorized receiver can intercept the transmission signal s ( ' and store it, and could determine, by trial and error, the single spreading code that was used.
• Figure 2 shows schematically a CDMA receiver, which adds the coded input signal r ⁇ in a correlator to the same spreading code c ⁇ .
• FIG. 3 shows, in a schematic representation, a device 1 in accordance with the invention, for encryption for the CDMA transmission system.
• the digital data stream d w is mixed with a dynamic code c (k) (t) here.
• a dynamic code generator 2 produces orthogonal codes of differing content, and controls their use, so that during a connection different spreading codes are used.
• a quantity G of orthogonal codes ⁇ g ⁇ (k) , g 2 (k - ) ... g H W ⁇ is established.
• the encryption varies, for example through the application of a first code cj®, a second code c 2 ⁇ etc.
• a first degree of encryption is achieved.
• Figure 4 shows, in a schematic representation, a device 3 in accordance with the invention, for decoding the received signal r® and for recovering the digital data stream y ( ' in a transmission system.
• the received signal r w is supplied to a correlator just as the dynamic code c ⁇ t) is.
• a dynamic second code generator 4 creates orthogonal codes of different content and controls their use, so that during a connection different spreading codes are applied.
• the application of different spreading codes during a single connection is intended to be visualized through the illustration (t) and through the adjective "dynamic".
• the dynamic code generator 2 for the transmission device 1 and the code generator 4 for the receiver device can be physically the same ones.
• a mobile radio telephone has a part for transmitting and a part for receiving, wherein according to one embodiment of the invention, both make use of the same dynamic code generator.
• Figure 5 schematically shows a method in accordance with the invention, for encrypting a digital data stream.
• the encryption key is communicated. This triggers the following, in any order: the establishment of a permutation function S; 210; the establishment of a set of spreading codes G; 220; the establishment of a hop interval I op 230.
• the encryption key is created by the transmitting unit and contains the parameters necessary for decoding the transmitted data signal.
• the permutation function S; ⁇ _l, p_2 ...
• p_M ⁇ indicates in which order the individual codes gi ⁇ , g 2 w ... gH W of the set Gj are applied.
• the establishment 210 of the permutation function that is valid for the current transmission can alternatively take place through: a) communication of a vector S; which includes the concrete permutation sequence ⁇ p_l, p_2 ... p_M ⁇ , or b) communication only of the name of a single permutation function S;.
• Alternative a) enables an unauthorized third party subscriber to eavesdrop the permutation sequence and thus to obtain an aid for decoding the digital data stream that has been transmitted.
• this method has the advantage that storage space is saved on both the transmitter and receiver sides, since the permutation sequence that is valid for the current communication needs only to be stored in the buffer memory, and can be deleted after the ending of the transmission.
• Alternative b) requires that on both the transmitter and receiver sides, all the possible permutation functions Si, S 2 ... S L (L: whole-number) have to be permanently stored, so that the permutation function S; that is valid for the transmission can be called up.
• the advantage of this variant is that an unauthorized third party subscriber cannot find out the sequence of orthogonal codes G; that lies behind the permutation function S; that is used, since it is not communicated, wherein H and P are whole numbers.
• a set G contains H individual orthogonal codes that are suitable for use in the CDMA method.
• each individual one of the H orthogonal codes g is built up as a vector with P elements.
• the step of establishing a set Gj of spreading codes 220 can alternatively take place either through c) Cornmu ication of the concrete individual orthogonal codes in the form of vectors or d) communication of the names of the orthogonal codes that are to be used.
• Step 230 for establishing the hop interval Ih op , alternatively means either e) stipulation of a period Th op , i.e. of a time-related duration of validity, or f) stipulation of a quantity Q of data packets.
• the first permutation procedure 400 is as follows: at step 410 the interval n is set to " 1 ", that orthogonal code from the set G; is used that stands at the place p_l of the permutation function Sj. At step 420, the expiry of the hop interval I hop is waited for. The measuring of time for establishing the end of the period, or the counting of the data packets that have been transmitted, takes place through corresponding devices such as for example a counter or a flip-flop. When the end of the hop interval Ih op has been reached, in step 430 the interval n is increased by the value 1. At step 440 the comparison is then carried out to see whether the current value for the interval n is greater than the total number M of the elements of the permutation vector.
• step 450 that code is called up as a current code c n (k) which stands at the n h position p_n of the permutation function S;, i.e. c n (k) and it is used until, in the course of the loop, in step 420 the end of the hop interval Ihop is reached and subsequently in step 430 the interval n is increased by the value 1.
• c n (k) which stands at the n h position p_n of the permutation function S;, i.e. c n (k) and it is used until, in the course of the loop, in step 420 the end of the hop interval Ihop is reached and subsequently in step 430 the interval n is increased by the value 1.
• the encryption key which is corrimunicated in step 600, following on from the connection set-up 500, triggers the following: the establishment of a permutation function S; 610; the establishment of a set of spreading codes G; 620; - the establislrment of a hop interval I hop 630.
• the establishment 610 of the permutation function that is valid for the current transmission can alternatively take place through either communication of a vector S; which contains the concrete permutation sequence ⁇ p_l, p_2 ...
• the step for establishing a set G; of spreading codes 620 can take place alternatively either through communicating the concrete individual orthogonal codes in the form of vectors or communicating the names of the orthogonal codes that are to be used, and/or - the step 630 for establishing the hop interval I hop can alternatively mean the stipulation of either a period T hop , i.e. a time-related period of validity, or a quantity Q of data packets.
• the first permutation procedure 800 is as follows: at step 810 the interval n is set to " 1 ", that orthogonal code from the set G; is used which stands at the place p_l of the permutation function S;. At step 820 the expiry of the hop interval I h0p is waited for. The measuring of time for determining the end of the period, or the counting of data packets that have been transmitted, is carried out by corresponding devices such as for example a counter or a flip-flop. Once the end of the hop interval I hop has been reached, in step 830 the interval n is increased by the value 1. At step 840 the comparison is then carried out to see whether the current value for the interval n is greater than the total number M of the elements of the permutation vector.
• p_M ⁇ and the code c that follows from that.
• p_l, p_2 ... p_M are any whole numbers 1, 2 ... H.

Landscapes

• Engineering & Computer Science (AREA)
• Computer Networks & Wireless Communication (AREA)
• Signal Processing (AREA)
• Computer Security & Cryptography (AREA)
• Computing Systems (AREA)
• Theoretical Computer Science (AREA)
• Mobile Radio Communication Systems (AREA)

Priority Applications (1)

Applications Claiming Priority (3)

Publications (1)

Family

ID=34178562

Family Applications (1)

Country Status (6)

Families Citing this family (7)

Family Cites Families (26)

• 2004
  • 2004-08-03 EP EP04744711A patent/EP1656744A1/de not_active Withdrawn
  • 2004-08-03 US US10/567,841 patent/US20060215735A1/en not_active Abandoned
  • 2004-08-03 KR KR1020067002898A patent/KR20060073596A/ko not_active Application Discontinuation
  • 2004-08-03 CN CNA2004800231138A patent/CN1836380A/zh active Pending
  • 2004-08-03 WO PCT/IB2004/051363 patent/WO2005018103A1/en active Application Filing
  • 2004-08-03 JP JP2006523087A patent/JP2007502566A/ja active Pending

Non-Patent Citations (1)

Also Published As

Similar Documents

Legal Events