EP0923826A1 - Dispositif et procede destines au traitement cryptographique d'un flux de donnees numeriques qui presente un nombre quelconque de donnees - Google Patents

Dispositif et procede destines au traitement cryptographique d'un flux de donnees numeriques qui presente un nombre quelconque de donnees

Info

Publication number
EP0923826A1
EP0923826A1 EP97935421A EP97935421A EP0923826A1 EP 0923826 A1 EP0923826 A1 EP 0923826A1 EP 97935421 A EP97935421 A EP 97935421A EP 97935421 A EP97935421 A EP 97935421A EP 0923826 A1 EP0923826 A1 EP 0923826A1
Authority
EP
European Patent Office
Prior art keywords
data block
previous
unit
linking
cryptographically processed
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
EP97935421A
Other languages
German (de)
English (en)
Other versions
EP0923826B1 (fr
Inventor
Martin Euchner
Wolfgang Klasen
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Siemens AG
Original Assignee
Siemens AG
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Siemens AG filed Critical Siemens AG
Publication of EP0923826A1 publication Critical patent/EP0923826A1/fr
Application granted granted Critical
Publication of EP0923826B1 publication Critical patent/EP0923826B1/fr
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/32Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
    • H04L9/3236Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions
    • H04L9/3242Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions involving keyed hash functions, e.g. message authentication codes [MACs], CBC-MAC or HMAC
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/06Cryptographic 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/0618Block ciphers, i.e. encrypting groups of characters of a plain text message using fixed encryption transformation
    • H04L9/0637Modes of operation, e.g. cipher block chaining [CBC], electronic codebook [ECB] or Galois/counter mode [GCM]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/50Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L2209/00Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
    • H04L2209/12Details relating to cryptographic hardware or logic circuitry
    • H04L2209/125Parallelization or pipelining, e.g. for accelerating processing of cryptographic operations

Definitions

  • a so-called message authentication code was usually determined as proof of the integrity.
  • any hash method or also methods according to the ISO 9797 standard can be used to form a MAC.
  • block encryption methods were used for the transmission of data blocks.
  • chaining mode in the context of block encryption for stream-oriented encryption, for example the so-called cipher block chaining mode (CBC mode).
  • an encryption mode that is block-oriented for the transmission of data blocks would be required, which has the property of accidental or willful disturbances of the encrypted data stream during the transmission between a sender and a receiver to cause a strong error propagation of the decrypted data stream at the recipient.
  • the known chaining modes often have weak error propagation due to the so-called self-synchronization, for example the CBC mode.
  • the well-known chaining modes with strong error propagation also contain cryptographic weaknesses, so that they are implicitly used in an encryption process for the mutual guarantee of integrity and confidentiality, ie. H. in one process step are unsuitable.
  • CBC message authentication code contains only a limited and fixed number of information bits. This ensures the security of an identity check value used
  • the invention is therefore based on the problem of specifying an arrangement and a method for the cryptographic processing of a digital data stream, with which or with which both the security service of confidentiality and the security service of integrity are possible with a reduced need for computing capacity.
  • a first processing element is provided for at least some of the data blocks of the data stream to be transmitted, which processing element contains at least a first link unit, an encryption unit and a second link unit.
  • the data of the respective data block is fed to the first linking unit via a first input
  • the data of a previous data block is fed via the second input
  • a previous intermediate variable is fed via a third input.
  • These sizes become a link size in the link unit connected .
  • the link size is supplied to the link unit in which a block encryption method is applied to the link size.
  • the result of the block encryption is an intermediate variable which is fed to the second linking unit.
  • a previous cryptographically processed data block is fed to the second linking unit.
  • the cryptographically processed data block for the respective data block is determined.
  • the entirety of the cryptographically processed data blocks results in the digital data stream to be transmitted.
  • a second processing element is provided for at least a part of cryptographically processed data blocks, which has at least a third link unit, a decryption unit and a fourth link unit.
  • the third linking unit is supplied with the received cryptographically processed data block via a first input and at least one previous cryptographically processed data block via a second input.
  • the data blocks are linked together in the third link unit.
  • the result of the link in the third link unit is the intermediate size.
  • the intermediate size is decrypted with the decryption unit and a link size is determined.
  • the fourth linking unit is supplied with the link size via a second input, at least one previous intermediate size and via a third input, at least one previous data block, and linked in the fourth linking unit to form the data block.
  • a transmitting unit and a receiving unit are provided, which are each designed according to the arrangement according to claim 1 and according to the arrangement according to claim 2. Furthermore, an over- Carrying system between the transmitting unit and the receiving unit provided for the transmission of the cryptographically processed data stream.
  • the arrangements have u. a. the advantage that for the first time encryption and integrity protection in one processing step, encryption becomes possible. An additional, explicit integrity assurance is no longer required with this arrangement. This leads to a considerable processing speed that can be doubled during the cryptographic processing of a data stream.
  • the arrangements have the advantage that a chaining mode is implemented which is clearly superior to the known chaining modes, since on the one hand it has a strong propagation of errors and on the other hand those attacks which cannot be recognized with the PCBC mode can be detected can be.
  • Ensuring the implicit integrity by using a constant integrity check value (CICV) and encrypting the data with a highly error-propagating chaining mode allows an advantageous scaling of the security by using arbitrarily long ICVs.
  • CICV constant integrity check value
  • an intermediate size is determined from a data block by encrypting the data block using a block encryption method, taking into account at least one previous data block and at least one previous intermediate size. Furthermore, the intermediate size is cryptographically processed by linking to at least one preceding one Data block determines a cryptographically processed data block.
  • the method according to claim 9 essentially has the inverse steps to the method according to claim 8.
  • an intermediate size is determined from the cryptographically processed data block by linking to a previous cryptographically processed data block
  • a link size is determined from the intermediate size by a block encryption method by decrypting the intermediate size.
  • the link size is linked to at least one previous intermediate size and to at least one previous data block, whereby a data block is determined.
  • the method steps according to the method according to claim 8 and the method according to claim 9 are linked to one another in such a way that the cryptographically processed data are first formed in a transmitting unit, are transmitted from the transmitting unit to a receiving unit, and then the cryptographically processed data are processed again according to the method according to claim 9.
  • the security of the chaining mode can be advantageously increased compared to other known chaining modes by using a second initialization value as an additional secret parameter in the first processing stage.
  • Both the arrangements and the methods can advantageously be used both for encryption alone, for integrity protection alone and for common encryption and integrity protection.
  • Figure 1 is a sketch of the arrangement according to claim 1;
  • Figure 2 is a sketch of an arrangement according to claim 2;
  • 3 is a sketch of the arrangement according to claim 3.
  • the digital data stream has any number of data blocks P n .
  • the data blocks P n each have any number of bits.
  • An index n uniquely designates each data block of the digital data stream and is a natural number between 1 and 1, 1 being a number of data blocks P n .
  • a first processing element Bin is provided for at least some of the data blocks P n , the structure of which is explained in more detail below.
  • a first linking unit VK1, an encryption unit E ⁇ and a second linking unit VK2 are provided in the first processing element Bin.
  • the first logic unit VKl has three inputs.
  • the data block P n is fed to the first linking unit VK1 via a first input E1VK1 of the first encryption unit.
  • a previous block of data P n is at least _ ⁇ the first linking unit vkl supplied to a second input of the first combination unit E2VK1 vkl.
  • the first combination unit VKl is supplied with at least one previous intermediate variable I n _ ⁇ .
  • E2VK1 or the third input E3VK1 of the first linking unit VKl is supplied with the directly preceding data packet P n _ ⁇ or the directly preceding intermediate variable I n _ ⁇ , however it is provided in alternative configurations of the arrangement that data packets P n which are further back _2. ••• Pl and more recent intermediate quantities I n _2 •• ⁇ Ii to the first linking unit VKl.
  • the first linking unit VK1 is coupled to an encryption unit E ⁇ .
  • a link size V n which is determined by linking sizes supplied to the first link unit VK1, is encrypted in the encryption unit E ⁇ .
  • the encryption takes place using any so-called block encryption method, for example according to the DES method or also according to the IDEA method. Further block encryption methods can be used without restriction within the framework of these arrangements and within the framework of the methods.
  • the secret cryptographic key used for encryption and for the decryption described below is designated by k.
  • the encryption unit E - delivers a size I n that corresponds to the encrypted link size V n .
  • the intermediate variable I n becomes, on the one hand, a second linking unit VK2 described below and the first link unit VKl of the following first processing element Bln + l supplied.
  • the intermediate variable I n is fed to the second logic unit VK2 via a first input E1VK2 of the second logic unit VK2.
  • the second logic unit VK2 has a second input E2VK2, via which at least one previous cryptographically processed data block C n _ 1 ( C n _2-... C j _) is fed to the second logic unit VK2.
  • the at least one previous cryptographically processed data block C n _! and the intermediate variable I n linked to one another and the linking result forms the cryptographically processed data block C n .
  • the first linking unit VK1 and / or the second linking unit VK2 can be designed in a further development of the arrangement in such a way that the supplied data are linked by a bit-wise EXCLUSIVE-OR link.
  • first processing element B1 of a different structure for processing the first data block P- ⁇ .
  • the first processing element B1 in turn contains the first linking unit VK1, the encryption unit E ⁇ and the second linking unit VK2.
  • the first data block P -] _ is fed to the first linking unit VK1 via a first input E1VK1 of the first linking unit VK1. Furthermore, however, a freely definable, advantageously secret first value IV1 is supplied to the first logic unit VK1 in the configuration. In a further development, it is provided that a freely definable second value is fed to the first logic unit VK1 via a third input E3VK1.
  • the first processing element Bin differs from the above-described construction of this first processing element Bll for processing the first data packet P-j _ in a further development of the fact that the second Verknüpfungs- unit VK2 not at least one preceding cryptographically phisch processed data block C n - ⁇ is supplied, but via the second input E2VK2 the first value IV1 of the second logic unit VK2.
  • the method for processing the digital data stream and for determining the cryptographically processed data blocks C n essentially corresponds to the structure of the arrangement described above.
  • At least some of the data blocks P n are encrypted to the intermediate size I n using a block encryption method. At least one previous data block P n _ ⁇ and at least one previous intermediate variable I n _ ⁇ are taken into account in the encryption.
  • the intermediate variable I n is linked to a previous cryptographically processed data block n - ⁇ , whereby a cryptographically processed data block C n is formed.
  • the data block P n , the previous data block P n _ ⁇ and the previous intermediate size I n _ ⁇ are linked to form a link size V n to which the block encryption method is applied.
  • At least one of the two links described above is designed as an EXCLUSIVE-OR link. It is also provided in a further development to link the first data block P- ⁇ with the first value IV1 and in a further embodiment with the second value IV2. It is also provided that the first intermediate variable 1 ⁇ formed is only linked with the first value IV1 to form the first cryptographically processed data block C ] _.
  • the arrangement is supplied with cryptographically processed data blocks C n .
  • a second processing element B2n is provided, which contains at least a third link unit VK3, a decryption unit D ⁇ and a fourth link unit VK4.
  • the third linking unit VK3 has a first input E1VK3, via which at least one preceding cryptographically processed data block C n _ ⁇ is fed to the third linking unit VK3.
  • a second input of the third logic unit E2VK3 VK3 is provided, the third through the at least one preceding cryptographically processed data block n _ ⁇ d he logic unit is supplied to VK3.
  • the third linking unit VK3 the cryptographically processed data block C n and the at least one previous cryptographically processed data block C n - are linked to form the first intermediate variable I n .
  • the intermediate variable I n is supplied to the decryption unit ⁇ -, for example by coupling the third linking unit VK3 to the decryption unit Dj ⁇ .
  • the decryption unit D ⁇ is designed such that the intermediate variable I n is decrypted using a cryptographic method using the cryptographic key k.
  • the result of the decryption is the link size V n .
  • the link quantity V n is fed to the fourth link unit VK4 via a first input E1VK4 of the fourth link unit VK4.
  • a second input E2VK4 of the fourth logic unit is provided, via which the fourth logic unit VK4 is supplied with at least one previous intermediate variable I n- 1 ' I n-2- ••• ⁇ 2> ⁇ l.
  • a third input of the fourth combining unit E3VK4 VK4 provided at least one previous data block P n _l, ... Pi P2 is supplied via the combination unit of the fourth VK4.
  • the configurations of the above-described arrangement described above are also provided for this arrangement, for example the configuration of the linking units VK3, VK4 as EXCLUSIVE-OR linking units.
  • the supply of the first value IV1 via the second input E2VK3 to the third logic unit VK3 for processing the first cryptographically processed data block C ] _ is also provided. This also applies to the supply of the first value IV1 via the second input E2VK4 of the fourth logic unit VK4 to the fourth logic unit
  • VK4 as well as for the supply of the second value IV2 via the third input E3VK4 of the fourth logic unit VK4.
  • the method is designed essentially the same.
  • the cryptographically processed data block C n is preceded by at least one linked cryptographically processed data block C n _ ⁇ to the intermediate size I n .
  • the intermediate variable I n is decrypted in the decryption unit O - and forms the link variable V n .
  • the link variable V n is linked to at least one previous intermediate value I n - ⁇ , .... 12 I ⁇ and at least one previous data block P n _, ..., P 2 , P ⁇ .
  • the result of the linkage is then the data block P n again in plain text.
  • a transmission system US is provided, with which the encrypted data stream, which is formed from the cryptographically processed data blocks C n , is transmitted from the transmitter unit S to the receiver unit E.
  • Any transmission system US can be provided for the transmission of digital data, or for example after conversion into analog data in a transmission system US for the transmission of analog data (cf. FIG. 3).
  • a method is also designed in which the method steps described above of the method for forming the cryptographically processed data blocks C n are carried out without change compared to the methods described above.
  • the cryptographically processed data blocks C n and possibly other data that form the digital data stream are transmitted from the transmitter unit S to the receiver unit E.
  • the method for forming the data blocks P n in plain text, which have been described above, is, as described above, also carried out in the receiver unit E without any change to the received cryptographically processed data blocks C n .
  • all of the developments described above are provided without restrictions.
  • the value 0 is assigned to the second value IV2.
  • Both the arrangement and the methods can advantageously be used either only for encryption, only to ensure the integrity of the data to be transmitted, or also to ensure both security services, confidentiality and integrity.
  • this concatenation mode has a strong error propagation, with which it becomes possible to have only one constant CICV integrity value to ensure the integrity of a digital data stream.
  • the constant integrity check value CICV can, for example, simply be appended to the end of the digital data stream in a data block and processed equivalent to the digital data stream. If a transmission error occurs or an attempt is made to falsify the digital data stream in any way, this is recognized during decryption by the property of the strong error propagation and the special type of connection of the individual elements of the digital data stream.
  • At least the pairwise swapping of the cryptographically processed data blocks C n during the transmission of the digital data stream is recognized in the receiver unit E when the method is carried out or when the arrangement is used. Furthermore, these arrangements or these methods are secure against the so-called "known-plaintext attacks", provided that it is still impossible for an attacker to know the data blocks P n and the cryptographically processed data blocks C n , " the key K and the Determine values IVl and IV2 with an exhaustive key search.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Power Engineering (AREA)
  • Storage Device Security (AREA)
  • Signal Processing For Digital Recording And Reproducing (AREA)
EP97935421A 1996-09-03 1997-07-02 Dispositif et procede destines au traitement cryptographique d'un flux de donnees numeriques qui presente un nombre quelconque de donnees Expired - Lifetime EP0923826B1 (fr)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
DE19635757 1996-09-03
DE19635757 1996-09-03
PCT/DE1997/001397 WO1998010559A1 (fr) 1996-09-03 1997-07-02 Dispositif et procede destines au traitement cryptographique d'un flux de donnees numeriques qui presente un nombre quelconque de donnees

Publications (2)

Publication Number Publication Date
EP0923826A1 true EP0923826A1 (fr) 1999-06-23
EP0923826B1 EP0923826B1 (fr) 2002-10-23

Family

ID=7804521

Family Applications (1)

Application Number Title Priority Date Filing Date
EP97935421A Expired - Lifetime EP0923826B1 (fr) 1996-09-03 1997-07-02 Dispositif et procede destines au traitement cryptographique d'un flux de donnees numeriques qui presente un nombre quelconque de donnees

Country Status (6)

Country Link
US (1) US6542607B1 (fr)
EP (1) EP0923826B1 (fr)
JP (1) JP2000517497A (fr)
AT (1) ATE226772T1 (fr)
DE (1) DE59708572D1 (fr)
WO (1) WO1998010559A1 (fr)

Families Citing this family (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
ES2270494T3 (es) * 1998-09-01 2007-04-01 Irdeto Access B.V. Sistema de comunicacion de datos.
JP3824121B2 (ja) * 1999-04-01 2006-09-20 株式会社日立製作所 暗号データの復号化処理方法および装置
JP2002202719A (ja) * 2000-11-06 2002-07-19 Sony Corp 暗号化装置及び方法、復号装置及び方法、並びに記憶媒体
JO2409B1 (en) 2000-11-21 2007-06-17 شركة جانسين فارماسوتيكا ان. في Second-phenyl carboxy amides are useful as lipid-lowering agents
US7127527B1 (en) * 2001-12-21 2006-10-24 Alcatel Network element terminal data interface system and method
US7076059B1 (en) * 2002-01-17 2006-07-11 Cavium Networks Method and apparatus to implement the data encryption standard algorithm
FR2836311B1 (fr) * 2002-02-21 2004-05-28 Gemplus Card Int Procede de cryptographie utilisant un algorithme cryptographique symetrique par flot et application a une car te a puce
US7376235B2 (en) * 2002-04-30 2008-05-20 Microsoft Corporation Methods and systems for frustrating statistical attacks by injecting pseudo data into a data system
US20040125951A1 (en) * 2002-12-26 2004-07-01 Sun Microsystems, Inc., A Delaware Corporation Bitstreaming for unreadable redundancy
US7725715B2 (en) 2005-02-24 2010-05-25 Access Business Group International Llc System and method for three-phase data encryption
US7715553B2 (en) * 2005-08-01 2010-05-11 Durward D. Dupre Encrypting a plaintext message with authentication
AU2006324920B2 (en) * 2005-12-14 2010-08-12 Nds Limited Method and system for usage of block cipher encryption
US7428306B2 (en) * 2006-04-18 2008-09-23 International Business Machines Corporation Encryption apparatus and method for providing an encrypted file system
IL214743A0 (en) * 2011-08-18 2012-02-29 Nds Ltd Block cipher modes of operation

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5517614A (en) * 1992-05-29 1996-05-14 Kabushiki Kaisha Toshiba Data compression/encryption processing apparatus
US5727062A (en) * 1995-07-06 1998-03-10 Ritter; Terry F. Variable size block ciphers

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See references of WO9810559A1 *

Also Published As

Publication number Publication date
EP0923826B1 (fr) 2002-10-23
ATE226772T1 (de) 2002-11-15
WO1998010559A1 (fr) 1998-03-12
US6542607B1 (en) 2003-04-01
JP2000517497A (ja) 2000-12-26
DE59708572D1 (de) 2002-11-28

Similar Documents

Publication Publication Date Title
DE69028254T2 (de) Verfahren zur Verwendung eines verschlüsselten Schlüssels als Schlüsselidentifizierer in einem Datenpaket eines Rechnernetzes
DE2715631C2 (de) Verschlüsselung und Absicherung von Daten
DE102005012098B4 (de) Datenchiffrierprozessor sowie AES-Chiffriersystem und AES-Chiffrierverfahren
DE69916160T2 (de) Vorrichtung und Verfahren zur kryptographischen Verarbeitung sowie Aufzeichnungsmedium zum Aufzeichnen eines kryptographischen Verarbeitungsprogramms zur Ausführung einer schnellen kryptographischen Verarbeitung ohne Preisgabe der Sicherheit
DE3883287T2 (de) Steuerung der Anwendung von Geheimübertragungsschlüsseln durch in einer Erzeugungsstelle hergestellte Steuerwerte.
EP0903026B1 (fr) Procédé de négociation d'une politique de sécurité entre une première et une seconde unité informatique
EP0872076B1 (fr) Procede d'echange assiste par ordinateur de codes cryptographiques entre un premier et un second ordinateur
DE19924986B4 (de) Verschlüsselungs-Konversionsvorrichtung, Entschlüsselungs-Konversionsvorrichtung, kryptografisches Kommunikationssystem und elektronische Gebühren-Sammelvorrichtung
EP1080557B1 (fr) Procede et dispositif d'echange assiste par ordinateur de cles cryptographiques entre une premiere unite d'ordinateur et une seconde unite d'ordinateur
EP0923826B1 (fr) Dispositif et procede destines au traitement cryptographique d'un flux de donnees numeriques qui presente un nombre quelconque de donnees
DE10148415C2 (de) Verfahren und Vorrichtung zum Verschlüsseln und Entschlüsseln von Daten
DE102005056814A1 (de) Kryptografiesystem und Datenverschlüsselungsverfahren
EP1105998B1 (fr) Procede et dispositif permettant de composer une cle secrete de communication pour une paire de cles de chiffrement asymetrique prealablement determinee
DE102009000869A1 (de) Verfahren und Vorrichtung zur manipulationssicheren Übertragung von Daten
DE19622630C1 (de) Verfahren zum gruppenbasierten kryptographischen Schlüsselmanagement zwischen einer ersten Computereinheit und Gruppencomputereinheiten
DE69911815T2 (de) Selbstkorrigierendes zufallsverschlüsselungssystem und -verfahren
EP1777913A1 (fr) Procédé pour le chiffrement/déchiffrement de paquets de données d'un flux de paquets
EP3304802B1 (fr) Procédé pour assurer la sécurité d'informations de données transmises par le biais d'un bus de données ainsi que système de bus de données
WO2002073374A2 (fr) Procede d'authentification
DE102009052456A1 (de) Verfahren und System zur beschleunigten Entschlüsselung von kryptographisch geschützten Nutzdateneinheiten
EP4099611B1 (fr) Génération de la clé quantique sûre dans un réseau
EP0198384A2 (fr) Procédé et dispositif pour chiffrer des données
DE19518546C1 (de) Verfahren zum rechnergestützten Austausch kryptographischer Schlüssel zwischen einer Benutzercomputereinheit U und einer Netzcomputereinheit N
DE102022004632B3 (de) Verfahren zur Verschlüsselung eines Klartextes
DE19642371C1 (de) Verfahren zum Austausch kryptographischen Schlüsselmaterials zwischen mindestens einer ersten Computereinheit und einer zweiten Computereinheit

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 19990219

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT CH DE FR GB LI NL

17Q First examination report despatched

Effective date: 20000920

GRAG Despatch of communication of intention to grant

Free format text: ORIGINAL CODE: EPIDOS AGRA

GRAG Despatch of communication of intention to grant

Free format text: ORIGINAL CODE: EPIDOS AGRA

GRAH Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOS IGRA

GRAH Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOS IGRA

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AT CH DE FR GB LI NL

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20021023

REF Corresponds to:

Ref document number: 226772

Country of ref document: AT

Date of ref document: 20021115

Kind code of ref document: T

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

Free format text: NOT ENGLISH

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

REF Corresponds to:

Ref document number: 59708572

Country of ref document: DE

Date of ref document: 20021128

GBT Gb: translation of ep patent filed (gb section 77(6)(a)/1977)

Effective date: 20030117

NLV1 Nl: lapsed or annulled due to failure to fulfill the requirements of art. 29p and 29m of the patents act
ET Fr: translation filed
PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GB

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20030702

Ref country code: AT

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20030702

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20030731

Ref country code: CH

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20030731

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed

Effective date: 20030724

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: DE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20040203

GBPC Gb: european patent ceased through non-payment of renewal fee

Effective date: 20030702

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: FR

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20040331

REG Reference to a national code

Ref country code: FR

Ref legal event code: ST