Data encryption on the physical layer of a data transmission system
Summary by NHIP
Physical Layer OFDM Encryption
The method encrypts data on a physical layer by multiplying QAM symbols with a K-ary key stream sequence before assigning them to sub-carriers. Distinctive elements include complex-valued keys of the form e^(jφn) where K equals 4 and phase shifts are multiples of π/2, alongside encrypted training symbols for synchronization.
Claim Score by NHIP
Abstract
The present invention is concerned with a method to encrypt OFDM modulation, by multiplying its underlying QAM symbols by a complex-valued generalized key stream sequence. Performing encryption on the physical layer ensures that all services and applications running over the OFDM modem will be protected against eavesdropping. It is also proposed to include in the encryption any training symbols used for synchronization and channel estimation. Only the legitimate receiver knowing the encryption key is hence able to synchronize and correctly demodulate the received signal. Attackers will not even be able to acquire the encrypted signal.

Term
Projected expiry 15 March 2028.
- Priority
- Filed
- Granted
- Today
- Projected expiry
11 claims: 3 independent, 8 dependent
- 1A method of encrypting data on a physical layer of a data transmission system that includes a modem, comprising the steps of providing, through a key stream generator of the modem, a K-ary key stream sequence {k n }, mapping, on the physical layer of the data transmission system and in a QAM mapper of the modem, each of a sequence of data blocks on a QAM symbol Z n , altering, in an encryptor of the modem, each of the QAM symbols z n according to an element k n of the key stream sequence {k n }, and creating encrypted symbols v n on the physical layer of the data transmission system, wherein the encrypted symbols v n are assigned to N≧2 distinct sub-carriers of an Orthogonal Frequency Division Multiplex (OFDM) transmission scheme.
- 9Broadest claimClaim Score 51, average(NHIP)A modem for encrypting data on a physical layer of a data transmission system the modem comprising:a key stream generator for providing a K-ary key stream sequence {k n }, a QAM mapper for mapping, on the physical layer of the data transmission system, each of a sequence of data blocks on a QAM symbol Z n , an encryptor for altering each of the QAM symbols z n according to an element k n of the key stream sequence {k n }, and for creating encrypted symbols v n on the physical layer of the data transmission system, wherein the modem further comprises an Inverse Fast Fourier Transformer for superposing the encrypted symbols v n according to an Orthogonal Frequency Division Multiplex (OFDM) transmission scheme.
- 11A method of encrypting Orthogonal Frequency Division Multiplex (OFDM) data transmission systems, comprising the steps of:providing, at a transmitter and a receiver, a K-ary key stream sequence {k n }as well as training OFDM symbols z n , altering, at the transmitter and the receiver, each of the training OFDM symbols z n according to an element k n of the key stream sequence {k n }, and creating encrypted training OFDM symbols v n on a physical layer of the data transmission system, assigning, at the transmitter, the encrypted training OFDM symbols v n to N≧2 distinct sub-carriers of an OFDM transmission scheme, and transmitting, comparing, by a synchronizer/channel estimator, encrypted training OFDM symbols v n created at the receiver to received transmitted encrypted training OFDM symbols, and deducing there from a channel transfer function h n or synchronization information.
Independent claims3
29 paragraphs in 5 sections, as filed
FIELD OF THE INVENTION
The invention relates to encryption techniques for data transmission. It departs from a method of encrypting data on the physical layer of a data transmission system as described in the preamble of claim <b>1</b>.
BACKGROUND OF THE INVENTION
Signals from wireless data transmission in general as well as signals from powerline communication are easily intercepted by appropriate receivers, necessitating encryption techniques in order to provide for some level of confidentiality. Digital encryption is usually applied to the transmitted bits at the link layer or at higher protocol layers of the communication protocol stack. Block encryption techniques permute blocks of bits in a key-dependent way, while stream ciphers first generate a key-dependent pseudo-random binary key stream, which is then XOR-ed with the plaintext bit sequence to produce the cipher text. A separate key management procedure ensures that sender and legitimate receiver both know the secret key and can thus establish a confidential data transmission path. An eavesdropper without access to the key cannot easily recover the plaintext from an intercepted cipher text.
Performing encryption on a certain higher protocol layer makes it application- or service-specific. Other services running on top of unencrypted lower protocol layers remain unprotected or must implement their own encryption. Further, some data bits e.g. for synchronization, addressing, and other control functions may remain unencrypted. Eavesdroppers using so-called “sniffers” are thus able to synchronize to intercepted data packets, read control information, and obtain the binary cipher text, which can then be crypto-analyzed separately.
Performing encryption on the lowest protocol layer of the information transfer process, i.e. the physical communication layer or modem layer where the digital modulation occurs, overcomes the disadvantages mentioned above. The U.S. Pat. No. 6,157,679 describes a method to encrypt radio frequency (RF) single carrier 2<sup>4</sup>-QAM signals by transmitting altered QAM constellation symbols directly and sequentially. The alteration is based on a binary key stream and involves a complex conjugation of QAM symbols, i.e. flipping the sign of their components. This sign change is easy to implement as it involves no computation. However, as with all time-domain QAM, intersymbol interference of the QAM symbols introduces complications for synchronization and channel equalization for the intended receiver, even without encryption of the QAM symbols.
DESCRIPTION OF THE INVENTION
It is therefore an objective of the invention to provide for a data encryption technique which prevents eavesdroppers from synchronizing to intercepted data packets and at the same time facilitates channel equalization by the intended receiver. These objectives are achieved by a method of encrypting and decrypting data according to the claims <b>1</b> and <b>8</b>, and by a modem for encrypting and decrypting data according to claims <b>9</b> and <b>10</b>. Further preferred embodiments are evident from the dependent patent claims.
In the inventive encryption technique, an encryption on the physical communication layer is combined with Orthogonal Frequency Division Multiplex (OFDM) transmission schemes. OFDM is a digital modulation technique particularly adapted to transmission channels or bands with frequency-dependent characteristics (e.g. signal-to-noise) such as wireless or powerline transmission. In contrast to single carrier QAM, OFDM modulation involves a superposition of several sub-channels or sub-carriers, wherein inter-sub-carrier interference is avoided and sub-carrier-equalization is facilitated by a cyclic prefix.
In other words, the invention introduces encryption on the physical protocol layer, i.e. directly on the digital modulation level of the OFDM modulation scheme. OFDM symbols to be transmitted comprise several underlying Quadrature Amplitude Modulated (QAM) symbols which are altered in a manner determined by an encryption key. Specifically, the concept of stream ciphers is modified in that a generalized key stream sequence is concatenated with the sequences of said underlying QAM symbols. The generation of the key stream sequence takes advantage of known methods to generate cryptographically secure binary key streams. The actual encryption is easy to implement.
In a preferred variant of the invention, said key stream sequence consists of elements chosen at random from a set of K>2 distinct values. This allows more varied alterations of the underlying QAM symbols that just a change in sign or a complex conjugation, further obstructing signal acquisition attempts by an eavesdropper.
In a further preferred embodiment of the invention, the encryption operation consists of a simple complex multiplication with the elements of the key stream sequence, which can be efficiently performed by the digital signal processors typically used for the implementation of OFDM modems. (Traditional binary encryption schemes require bit-wise manipulations which cannot be performed efficiently on such processors). If the elements of the key stream sequence are of equal amplitude, the amplitude of the QAM symbols and therefore the transmitted power of the corresponding sub-channels are left unchanged.
In the case of an underlying 2<sup>m </sup>QAM modulation involving 2<sup>m </sup>constellation points (or potential QAM symbols), the latter are symmetrically distributed in the four quadrants of the complex plane. If the operation then equals a congruent rotation, every altered symbol again is a regular constellation point. The number K of distinct complex elements of the key stream sequence is therefore preferably set to 4 and the elements themselves are multiples of π/2. Another possible QAM constellation consists of 16 equally spaced points on a circle, i.e. a pure phase modulation. Here K=16 (roots of unity) also preserves the original constellation points.
In an alternative preferred embodiment of the invention, the encryption operation consist in a pseudo-random permutation of the constellation points, i.e. the QAM symbols are exchanged by other QAM symbols. In order not to upset power allocation to the sub-channels, the permutation preferably takes place among subsets of constellation points with equal amplitude.
In another preferred variant, training OFDM symbols are periodically inserted, encrypted and transmitted just as ordinary data OFDM symbols. At the receiver, the received training OFDM symbols are evaluated in order to facilitate synchronization and channel estimation.
BRIEF DESCRIPTION OF THE DRAWINGS
The subject matter of the invention will be explained in more detail in the following text with reference to preferred exemplary embodiments which are illustrated in the attached drawings, in which:
<figref idrefs="DRAWINGS">FIG. 1</figref> schematically shows a transmitter block diagram, and
<figref idrefs="DRAWINGS">FIG. 2</figref> schematically shows a receiver block diagram.
The reference symbols used in the drawings, and their meanings, are listed in summary form in the list of reference symbols. In principle, identical parts are provided with the same reference symbols in the figures.
DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS
<figref idrefs="DRAWINGS">FIG. 1</figref> shows a transmitter block diagram for constructing an encrypted OFDM symbol with N sub-carriers according to the invention. The data bits comprising physical layer bits for synchronization and channel estimation in addition to higher layer bits, are prepared in packets at the data source <b>10</b> and enter serially into and are divided in data block of m<sub>n </sub>bits (n=0 . .N−1) by an OFDM vectorizer <b>11</b>. These blocks are processed in parallel in a QAM mapper <b>12</b>, each block being assigned a complex number z<sub>n</sub>, i.e. being mapped to a QAM symbol or constellation point according to the 2<sup>m</sup>-QAM scheme and possibly scaled by a gain g<sub>n</sub>. The number m<sub>n </sub>of bits and the gain g<sub>n </sub>may depend on the sub-carrier index n, if some optimized frequency-dependent bit loading and gain allocation schemes are used.
In the following encryption step, the sequence of complex numbers z<sub>n </sub>is operated on in an encryptor <b>13</b> by multiplying with a generalized complex-valued key stream sequence {k<sub>n</sub>} and a cipher text sequence v<sub>n </sub>is obtained, i.e. <br /><i>v</i><sub>n</sub><i>=k</i><sub>n</sub><i>·z</i><sub>n </sub><br /> The generation of {k<sub>n</sub>}, a K-ary Pseudo-Random Sequence PRS with e.g. K=4 or 8, in the key stream generator <b>18</b> is described below. For the present case of OFDM, the preferred choice of {k<sub>n</sub>} has the form <br />k<sub>n</sub>=e<sup>jφn </sup>,<br /> where {φn} is a K-ary pseudo-random sequence with 0≦φ<sub>n</sub>≦2π. The OFDM time-discrete signal is then generated as a superposition of the N modulated sub-carriers, i.e.
<maths id="MATH-US-00001" num="00001"><math overflow="scroll"><mrow><msub><mi>x</mi><mi>k</mi></msub><mo>=</mo><mrow><munderover><mo>∑</mo><mrow><mi>n</mi><mo>=</mo><mn>0</mn></mrow><mrow><mi>N</mi><mo>-</mo><mn>1</mn></mrow></munderover><mo></mo><mrow><msub><mi>v</mi><mi>n</mi></msub><mo>·</mo><msup><mi>ⅇ</mi><mrow><mi>j2π</mi><mo></mo><mstyle><mspace width="0.3em" height="0.3ex" /></mstyle><mo></mo><mfrac><mi>nk</mi><mi>N</mi></mfrac></mrow></msup></mrow></mrow></mrow></math></maths><br /> which is most efficiently calculated by an Inverse Fast Fourier Transform in IFFT <b>14</b>. Adding a so-called cyclic prefix in a prefix adder <b>15</b> reduces inter-subcarrier interference at the receiver. Finally, a digital-to-analogue conversion and possibly a mixing or frequency-translation to the actual carrier frequency takes place in a mixer and digital to analog (D/A) converter <b>16</b>, resulting in the transmitted signal x(t).
As mentioned above, encryption is provided by the K-ary key stream sequence {k<sub>n</sub>} or {φ<sub>n</sub>}. Key streams are pseudo-random sequences which are uniquely determined by an encryption key, they must be of large length (period) and unpredictable (given an extract of the sequence) for anyone not knowing the encryption key. Generation of binary key streams for binary stream ciphers is a well-known subject.
For the present application, a K-ary key stream sequence {φ<sub>n</sub>} can simply be obtained by using log<sub>2</sub>K successive output bits of a binary key stream generator. These bits address a table with K entries containing the mapping to values of φ<sub>n</sub>, or to Re(k<sub>n</sub>)=cos(φ<sub>n</sub>) and Im(k<sub>n</sub>)=sin(φ<sub>n</sub>). With reasonable choices of the table entries, cryptographically good binary sequences then yield cryptographically good K-ary {φ<sub>n</sub>}. Obviously, the size of the encryption key determining the key stream {φ<sub>n</sub>} must be large to prevent brute force attacks and preferably comprise 128 bits or more. Also, the period of the key stream must cover a large number of OFDM symbols, wherein for each OFDM symbol with N sub-carriers or N QAM symbols z<sub>n</sub>, N-log<sub>2</sub>(K) bits of the binary key stream are consumed. The index n in {k<sub>n</sub>} must therefore count over many such OFDM symbols.
The optimum choice of the K levels of φ<sub>n </sub>(assigned equidistantly between 0 and 2π), depends on m<sub>n</sub>, or more precisely on the constellation points of the 2<sup>m</sup>-QAM symbols z<sub>n</sub>. For example, the regular 2<sup>2</sup>=4 point constellation would be congruently rotated with K=2<sup>2</sup>=4 levels of φ<sub>n</sub>, (namely 0, π/2, π, 3π/2) hence K=4 should be sufficient to encrypt these QAM symbols z<sub>n</sub>. On the other hand, a higher value of K may be preferable in order to obstruct any open loop carrier synchronization attempted by an eavesdropper.
<figref idrefs="DRAWINGS">FIG. 2</figref> shows the block diagram of a receiver which in principle simply inverts the steps performed by the transmitter. The received analog signal y(t) is down-mixed and digitized in the down-mixer and analog to digital (A/D) converter <b>26</b> and passes through the cyclic prefix remover <b>25</b>. A Fast Fourier Transformer <b>24</b> calculates the symbols y<sub>n </sub>(n=0 . . N−1) which are then decrypted in decryptor <b>23</b> with the aid of the key stream sequence {k<sub>n</sub>} provided by the key stream generator <b>28</b>. Finally, demapping and serializing is performed in QAM de-mapper <b>22</b> and symbol serialiser <b>21</b>.
A channel transfer function h<sub>n </sub>represents a possible distortion of the received signal y<sub>n</sub>at the n-th sub-carrier frequency by the propagation characteristics of the channel. Thus a receiver estimate {circumflex over (v)}<sub>n </sub>of the cipher text sequence is approximated by <br /><i>y</i><sub>n</sub><i>=h</i><sub>n</sub><i>·{circumflex over (v)}</i><sub>n</sub>,<br /> and the distortion is corrected for in equalizer <b>30</b>, i.e. the combined operation
<maths id="MATH-US-00002" num="00002"><math overflow="scroll"><mrow><msub><mover><mi>z</mi><mo>^</mo></mover><mi>n</mi></msub><mo>=</mo><mrow><mrow><msubsup><mi>k</mi><mi>n</mi><mrow><mo>-</mo><mn>1</mn></mrow></msubsup><mo>·</mo><mfrac><msub><mi>y</mi><mi>n</mi></msub><msub><mi>h</mi><mi>n</mi></msub></mfrac></mrow><mo>=</mo><mrow><msup><mi>ⅇ</mi><mrow><mo>-</mo><msub><mi>jφ</mi><mi>n</mi></msub></mrow></msup><mo></mo><mfrac><msub><mi>y</mi><mi>n</mi></msub><msub><mi>h</mi><mi>n</mi></msub></mfrac></mrow></mrow></mrow></math></maths><br /> equalizes and decrypts the QAM symbol {circumflex over (z)}<sub>n </sub>which can then be fed to the QAM de-mapper <b>22</b> to finally recover the transmitted data bits. This requires that the receiver knows the encryption/decryption key and also the precise clocking information.
Synchronization to obtain this clock information and estimation of the channel transfer function h<sub>n </sub>are the two crucial ancillary tasks of the receiver. As depicted in <figref idrefs="DRAWINGS">FIG. 2</figref>, these tasks are performed by a synchronizer/channel estimator <b>32</b>. The latter correlates the received signal against known replicas of “training” OFDM-symbols <b>31</b> which the transmitter periodically inserts into the sequence of “data” OFDM-symbols. According to a preferred variant of the present invention, it is proposed to also encrypt the training OFDM symbols <b>31</b> used to support synchronization and channel estimation, i.e. any training symbol inserted by the transmitter shall be encrypted by an alteration based on k<sub>n </sub>in the same way as normal data-carrying symbols. The receiver having knowledge of both the key stream {k<sub>n</sub>} and the unencrypted training OFDM symbols <b>31</b> is able to generate the encrypted time-varying training signals and use these for synchronization and channel estimation in the usual manner. However, an eavesdropper without knowledge of the encryption key is not even able to synchronize to the intercepted signal. This provides an additional strong level of protection. Preferably, it is ensured that the key stream {k<sub>n</sub>} encrypting known plaintext such as, in particular, the training symbols <b>31</b>, will not be re-used to encrypt other data.
In summary, the present invention is concerned with a method to encrypt OFDM modulation, by multiplying its underlying QAM symbols by a complex-valued generalized key stream sequence. Performing encryption on the physical layer ensures that all services and applications running over the OFDM modem will be protected against eavesdropping. It is also proposed to include in the encryption any training symbols used for synchronization and channel estimation. Only the legitimate receiver knowing the encryption key is hence able to synchronize and correctly demodulate the received signal, whereas attackers will not even be able to acquire the encrypted signal.
List of designatioins
<ul><li id="ul0001-0001" num="0028"><b>10</b> data source</li><li id="ul0001-0002" num="0029"><b>11</b> OFDM vectorizer</li><li id="ul0001-0003" num="0030"><b>12</b> QAM mapper</li><li id="ul0001-0004" num="0031"><b>13</b> encryptor</li><li id="ul0001-0005" num="0032"><b>14</b> inverse fast fourier transformer IFFT</li><li id="ul0001-0006" num="0033"><b>15</b> prefix adder</li><li id="ul0001-0007" num="0034"><b>16</b> mixer and digital to analog (D/A) converter</li><li id="ul0001-0008" num="0035"><b>18</b> key stream generator</li><li id="ul0001-0009" num="0036"><b>21</b> symbol serialiser</li><li id="ul0001-0010" num="0037"><b>22</b> QAM de-mapper</li><li id="ul0001-0011" num="0038"><b>23</b> decryptor</li><li id="ul0001-0012" num="0039"><b>24</b> fast fourier transformer FFT</li><li id="ul0001-0013" num="0040"><b>25</b> cyclic prefix remover</li><li id="ul0001-0014" num="0041"><b>26</b> downmixer and analog to digital (A/D) converter</li><li id="ul0001-0015" num="0042"><b>28</b> key stream generator</li><li id="ul0001-0016" num="0043"><b>31</b> “training” OFDM-symbols</li><li id="ul0001-0017" num="0044"><b>32</b> synchronizer/channel estimator</li></ul>
Contents5
4 sheets
Sheet 1 Sheet 2 Sheet 3 Sheet 4
Every citation, both ways
| Document | Relation | Office | Cited during |
|---|---|---|---|
| US8855247B2 | Cited by | United States of America | Search report |
| US2007153726A1 | Cited by | United States of America | Pre-grant |
| US2008267314A1 | Cited by | United States of America | Pre-grant |
| US8711888B2 | Cited by | United States of America | Applicant |
| US9059866B2 | Cited by | United States of America | Search report |
| US2022239532A1 | Cited by | United States of America | Search report |
| US2012039379A1 | Cited by | United States of America | Pre-grant |
| US8645678B2 | Cited by | United States of America | Applicant |
| US12432098B2 | Cited by | United States of America | Search report |
| US9749133B2 | Cited by | United States of America | Search report |
| US2013044841A1 | Cited by | United States of America | Pre-grant |
| US8355463B2 | Cited by | United States of America | Search report |
| US8731007B2 | Cited by | United States of America | Applicant |
| US2013343541A1 | Cited by | United States of America | Pre-grant |
| US8345809B2 | Cited by | United States of America | Search report |
| US12095594B2 | Cited by | United States of America | Search report |
| US2024314000A1 | Cited by | United States of America | Search report |
| US9059866B2 | Cited by | United States of America | Search report |
| WO2019154447A1 | Cited by | World Intellectual Property Organization (WIPO) | Applicant |
| US2011158349A1 | Cited by | United States of America | Pre-grant |
| WO0147167A1 | Cites | World Intellectual Property Organization (WIPO) | Applicant |
| US2002122465A1 | Cites | United States of America | Search report |
| US2003095662A1 | Cites | United States of America | Search report |
| US2004081131A1 | Cites | United States of America | Search report |
| US4458355A | Cites | United States of America | Search report |
| US4924516A | Cites | United States of America | Search report |
| US5235645A | Cites | United States of America | Search report |
| US5341425A | Cites | United States of America | Search report |
| US5351134A | Cites | United States of America | Search report |
| US5608764A | Cites | United States of America | Search report |
| US5703952A | Cites | United States of America | Search report |
| US5748677A | Cites | United States of America | Search report |
| US5825807A | Cites | United States of America | Search report |
| US5854840A | Cites | United States of America | Search report |
| US6028933A | Cites | United States of America | Search report |
| US6035040A | Cites | United States of America | Search report |
| US6118976A | Cites | United States of America | Search report |
| US6157679A | Cites | United States of America | Search report |
| US6349138B1 | Cites | United States of America | Search report |
| US6359938B1 | Cites | United States of America | Search report |
| US6438367B1 | Cites | United States of America | Search report |
| US6516065B1 | Cites | United States of America | Search report |
| US6611513B1 | Cites | United States of America | Search report |
| US6973141B1 | Cites | United States of America | Search report |
| US6980649B1 | Cites | United States of America | Search report |
| US6996129B2 | Cites | United States of America | Search report |
| US7095856B2 | Cites | United States of America | Search report |
| US7130427B2 | Cites | United States of America | Search report |
| US7269403B1 | Cites | United States of America | Search report |
| US7324600B2 | Cites | United States of America | Search report |
| US7564908B2 | Cites | United States of America | Search report |
10 members in 6 offices
Priority claims4
| Document | Office | Kind | Date |
|---|---|---|---|
| 03405655 | European Patent Office (EPO) | A | |
| 03405655 | European Patent Office (EPO) | A | |
| 03405655 | – | – | – |
| EP20030405655 | – | – | – |
Members10
| Document | Office | Kind | |
|---|---|---|---|
| EP1513279A1 | European Patent Office (EPO) | A1 | |
| US2005055546A1 | United States of America | A1 | |
| EP1513279B1 | European Patent Office (EPO) | B1 | |
| AT377303T | Austria | T | |
| ATE377303T1 | Austria | T1 | |
| DE60317195D1 | Germany | D1 | |
| ES2295543T3 | Spain | T3 | |
| SI1513279T1 | Slovenia | T1 | |
| DE60317195T2 | Germany | T2 | |
| US7752430B2This record | United States of America | B2 |
72 transactions on the USPTO file
Allowed after 2 non-final rejections, 2 final rejections and 1 RCE.
- Non-final rejections
- 2
- Final rejections
- 2
- RCEs
- 1
- Appeals
- 0
Over time
Point at a mark for the transactionTransactions
| Event | Code | |
|---|---|---|
| Expire PatentEXP. | EXP. | |
| Maintenance Fee Reminder MailedREM. | REM. | |
| Recordation of Patent Grant MailedPGM/ | PGM/ | |
| Patent Issue Date Used in PTA CalculationAllowedPTAC | PTAC | |
| Email NotificationEML_NTR | EML_NTR | |
| Issue Notification MailedAllowedWPIR | WPIR | |
| Dispatch to FDCD1935 | D1935 | |
| Email NotificationEML_NTR | EML_NTR | |
| Mail Response to 312 Amendment (PTO-271)MN271 | MN271 | |
| Application Is Considered Ready for IssuePILS | PILS | |
| Response to Amendment under Rule 312N271 | N271 | |
| Issue Fee Payment VerifiedN084 | N084 | |
| Issue Fee Payment ReceivedIFEE | IFEE | |
| Amendment after Notice of Allowance (Rule 312)AllowedA.NA | A.NA | |
| Electronic ReviewELC_RVW | ELC_RVW | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Notice of AllowanceAllowedMN/=. | MN/=. | |
| Notice of Allowance Data Verification CompletedAllowedN/=. | N/=. | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Response after Non-Final ActionA... | A... | |
| Electronic ReviewELC_RVW | ELC_RVW | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Non-Final RejectionNon-final rejectionMCTNF | MCTNF | |
| Non-Final RejectionNon-final rejectionCTNF | CTNF | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Disposal for a RCE / CPA / R129AbandonedABN9 | ABN9 | |
| Request for Continued Examination (RCE)RCEX | RCEX | |
| Workflow - Request for RCE - BeginBRCE | BRCE | |
| Email NotificationEML_NTR | EML_NTR | |
| Mail Advisory Action (PTOL - 303)MCTAV | MCTAV | |
| Advisory Action (PTOL-303)CTAV | CTAV | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Response after Final ActionA.NE | A.NE | |
| Electronic ReviewELC_RVW | ELC_RVW | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Final Rejection (PTOL - 326)Final rejectionMCTFR | MCTFR | |
| Final RejectionFinal rejectionCTFR | CTFR | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Response after Final ActionA.NE | A.NE | |
| Electronic ReviewELC_RVW | ELC_RVW | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Final Rejection (PTOL - 326)Final rejectionMCTFR | MCTFR | |
| Final RejectionFinal rejectionCTFR | CTFR | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Response after Non-Final ActionA... | A... | |
| Electronic ReviewELC_RVW | ELC_RVW | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Non-Final RejectionNon-final rejectionMCTNF | MCTNF | |
| Non-Final RejectionNon-final rejectionCTNF | CTNF | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| IFW TSS Processing by Tech Center CompleteTSSCOMP | TSSCOMP | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| Application Return from OIPEWROIPE | WROIPE | |
| Application Return TO OIPEROIPE | ROIPE | |
| Application Dispatched from OIPEOIPE | OIPE | |
| Application Is Now CompleteCOMP | COMP | |
| Cleared by L&R (LARS)L128 | L128 | |
| Referred to Level 2 (LARS) by OIPE CSRL198 | L198 | |
| IFW Scan & PACR Auto Security ReviewSCAN | SCAN | |
| Information Disclosure Statement consideredIDSC | IDSC | |
| Preliminary AmendmentA.PE | A.PE | |
| Reference capture on IDSRCAP | RCAP | |
| Information Disclosure Statement (IDS) FiledM844 | M844 | |
| Information Disclosure Statement (IDS) FiledWIDS | WIDS | |
| Request for Foreign Priority (Priority Papers May Be Included)RQPR | RQPR | |
| Initial Exam Team nnIEXX | IEXX |
7 legal events, as the office reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | |
|---|---|---|
| Lapsed due to failure to pay maintenance feeLapsedFP | FP | |
| Lapse for failure to pay maintenance feesLapsedPATENT EXPIRED FOR FAILURE TO PAY MAINTENANCE FEES (ORIGINAL EVENT CODE: EXP.)LAPS | LAPS | |
| Information on status: patent discontinuationPATENT EXPIRED DUE TO NONPAYMENT OF MAINTENANCE FEES UNDER 37 CFR 1.362STCH | STCH | |
| Fee payment procedureMAINTENANCE FEE REMINDER MAILED (ORIGINAL EVENT CODE: REM.)FEPP | FEPP | |
| Fee paymentFPAY | FPAY | |
| Fee payment procedurePAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITYFEPP | FEPP | |
| AssignmentAS | AS |
Numbers
- Publication
- 07752430
- Publication, DOCDB
- 7752430
- Publication, EPODOC
- US7752430
- Application
- 10928135
- Application, DOCDB
- 92813504
- Application, EPODOC
- US20040928135
Titles
- English
- Data encryption on the physical layer of a data transmission system
Patent term adjustment
- A delay
- +914 daysthe office missed an examination deadline
- B delay
- +655 dayspendency past three years
- Overlap
- −245 daysdelays counted once
- Applicant delay
- −31 days
- Net adjustment
- 1,293 days
Classification
- CPC, 5
- H04K1/00
- H04L27/2626
- H04L27/2647
- H04L27/2602
- H04W12/03
- IPC, 3
- H04L29 06
- H04K1 00
- H04L27 26
- USPC, 1
- 713151000