Communication method for multisubscriber networks, which is protected from deception, eavesdropping and hacking

• US 9,037,853 B2
• Filed: 11/17/2008
• Issued: 05/19/2015
• Est. Priority Date: 02/22/2008
• Status: Expired due to Fees

• Current Assignee: Fachhochschule Schmalkalden
• Original Assignee: Fachhochschule Schmalkalden
• Inventors: Rozek, Werner, Rozek, Thomas, Rozek, Jan
• Primary Examiner(s): Armouche, Hadi
• Assistant Examiner(s): SONG, HEE K
• Application Number:
  US12/918,557
• Publication Number:
  US 20110047375A1
• Time in Patent Office: 2,374 Days
• Field of Search: 713/150, 713/161
• US Class Current: 713/161
• CPC Class Codes: H04L 2209/80 Wireless network architectures or network communication protocols for wireless network security H04W12/00
• CPC Class Codes: H04L 63/0428 wherein the data content is protected, e.g. by encrypting or encapsulating the payload
• CPC Class Codes: H04L 63/068 using time-dependent keys, e.g. periodically changing keys cryptographic mechanisms or cryptographic arrangements for controlling usage of secret information H04L9/088
• CPC Class Codes: H04L 63/123 received data contents, e.g. message integrity
• CPC Class Codes: H04L 9/3236 using cryptographic hash functions

Abstract

The invention relates to a P2P communication method for multi-subscriber networks, which is protected from deception, eavesdropping and hacking, and wherein the communication carried out in an interval is predominantly carried out in separate rooms, allocated to the P2P communication, and with separate reference data allocated to the P2P communication. At least part of the separate random reference data and/or random data is generated in at least one unit that participates in the P2P communication and is exchanged within the P2P communication in the form of relative data. The separate P2P communication is initiated with respect to at least one global random reference date valid for the time of the P2P communication, the random reference date being valid for a randomly determined time range and being stored in all units that carry out the P2P communications in a secret and non-deceivable manner.

Claims

1. A method for unalterable, tap-proof and non-hackable P2P communication in multi-subscriber networks wherein part of data are relative data calculated with reference to a space or a plurality of spaces, to a reference point or a plurality of reference points, comprising:

performing each P2P communication with reference to at least one global random reference data element valid for a randomly defined time interval, and to a separate random reference data element and/or random data element valid for one P2P communication,

storing at least said global random reference data valid for randomly defined time intervals secretly and unalterably in each P2P communication performing transmitting/receiving unit,

wherein only units involved in a P2P communication have knowledge about the separate random reference data and/or random data valid for said P2P communication,

determining at least a part of the separate random reference data and/or random data valid for said P2P communication in at least one unit involved in said P2P communication, and exchanging said at least a part in form of relative data between the units involved in said P2P communication,

determining at least one exchanged relative data element of at least one random reference data element, and/or random data element, and/or data element identifying a person, and/or data element identifying a unit, and/or P2P control data element with reference to said currently valid global random reference data element,

determining at least another exchanged relative data element or all of the other exchanged relative data with reference to said separate random reference data and/or random data valid for said P2P communication, and

determining a relative data element by vector subtractions with a vector of a respective data element point as a minuend and a vector of a random reference point as a first subtrahend and a translation/rotation vector as a second subtrahend with reference to a space associated with a type of the relative data element, wherein;

a transmitting unit of a subscriber determines a plurality of random numbers, at least one data element identifying a person and/or a unit, and/or an interlace data element, and/or a P2P control data element, and a component data element or a plurality of component data, wherein presence of a component data element is indicated by an activated bit in a component identification data element associated with that component data element,

at least one component data element is a permutation data element PI,

the transmitting unit determines relative data having a data length DATL1 from the determined data, arranges said relative data in a predefined order into one data block or two data blocks or a plurality of data blocks, determines at least one hash value from said data blocks, interlaces partial data of each hash value into at least one predefined portion of the associated data block in function of interlace control data 2, packages the interlaced data into P2P data blocks having a data length of DATL2, and calculates relative data thereof,

the transmitting unit uses all of the relative data of the P2P data blocks as data blocks of a P2P header, or uses a predefined number of relative data of the P2P data blocks as data blocks of the P2P header and the remaining rest as data blocks of a P2P data end block,

the transmitting unit interlaces partial data of the relative data element of the first P2P data block into the relative data of the other P2P data blocks of the P2P header in function of interlace control data 1 which are identical for all units, first transmits said interlaced P2P data blocks as a P2P header, in presence of interlace data intended for proper data interlaces the proper data with the interlace data and continues to use it as proper data, and/or divides the proper data into data packets, generates a hash value for each data packet, adds the hash value to the respective data packet, encrypts and/or permutes and/or re-permutes a data packet with its hash value or data packets with its hash values, wherein said permutations and/or re-permutations are applied before and/or following encryption,

the transmitting unit determines, from all the hash values or from all preceding hash values or from all the hash values of the data packets a total hash value, provides it with at least one flag, adds both to the proper data at the end of the proper data, and encodes and/or permutes and/or re-permutes in conjunction with the last data packet with its hash value added or the last data packets with their hash values added,

if a P2P data end block is present, the transmitting unit transmits it last,

a receiving unit receives the P2P header, de-interlaces the data of the relative data element of the first P2P data block from the relative data of the other P2P data blocks of the P2P header using said interlace control data 1, determines, from the relative data of the first P2P data block, the first part of the predefined sequence of relative data with a data length of DATL1 of the first data block,

the receiving unit determines, from the relative data with a data length DATL1 of the first P2P data block, the random numbers, P2P control data, data identifying the data transmitting person and/or the data transmitting unit and the data receiving person and/or unit, identifies, from said identifying data, itself as an authorized recipient, thereupon determines the remaining part of the first data block interlaced with the partial data of its hash values from the remaining relative P2P data blocks of the P2P header,

the receiving unit determines all the hash values by de-interlacing the partial data of the hash values from the first data block interlaced with the partial data of its hash values, calculates the hash value or the hash values over the de-interlaced data block, compares all the receiver and transmitter side hash values of the first data block with each other, in case of a match detects the integrity of the data of the first data block,

the receiving unit determines, from the remaining portion of the predefined sequence of the first data block, the relative data with a data length of DATL1, and therefrom the first existing component data such as the permutation data element or permutation data PI,

the receiving unit re-permutes and/or permutes and/or decrypts the encrypted and/or permuted and/or re-permuted data packets with its hash values added, wherein said re-permutations and/or permutations are applied before and/or following decryption,

the receiving unit determines the hash value for each data packet, compares it with the received hash value, calculates the total hash value, identifies the received total hash value by the hash value indication or indications, and compares the received total hash value with the calculated total hash value, detects integrity of the data upon a match in all comparisons,

the receiving unit, if a P2P data end block is present, determines the remaining P2P data blocks from the relative data with a data length of DATL2, de-interlaces the partial data of the hash value or hash values from the second data block interlaced with the partial data of its hash values, calculates the hash value or hash values over the second data block, compares all the receiver and transmitter side hash values of the second data block with each other, in case of a match detects the integrity of the data of the second data block, and

the receiving unit determines the remaining component data provided from the predefined sequence of relative data of the second data block.

2. The method according to claim 1, wherein:

the relative data of the first portion of the first data block are determined in at least one space identical for all units, wherein the spatial data of each identical space are taken from a random reference data element identical for all units,

all other relative data are determined within at least one separate space, wherein the spatial data are newly determined and defined for each separate space and for each P2P communication, by the transmitting unit,

the separate spatial data are taken from the random reference data element known to all units involved in said P2P communication or from at least one random data element newly generated in the transmitting unit for each P2P communication,

the transmitting unit generates, as control data, at least one position data element 1 related to the data element identifying a person and/or a unit, and/or a time data element of card transmission, and/or a time data element of P2P transmission and/or return transmission, and/or a distance number, and/or a P2P control word, and/or interlace control data 2 for the hash values of the data blocks, and/or interlace control data 3 for interlacing interlace data into the proper data, and/or data about the data packet length, and/or a position data element 2 and/or spatial data of separate spaces, and/or a key data element, and/or a key length data element, and/or key repetition data element, and/or a component identification data element, and/or a permutation data element PERM,

said position data element 1 indicates the bit position of extraction of interlace data from the random reference data element identical for all units, wherein said interlace data serve for generating secret identifying data combined with a person and/or a unit, and/or

said position data element 2 indicates the bit position of extraction of separate spatial coordinate values and/or separate references data, and/or

said distance number, as an enumeration index with respect to a reference data element, informs about the most recent identical random reference data element existent and used by the unit, so that the receiving unit, upon a change-over to a new identical random reference data element, can select the random reference data element on which the communication is based, and/or

said permutation data element PERM serves for permuting the permutation data PI, and/or

one of the applied permutations is performed using permutation data PI, and the other permutation is performed using the permuted data of PI, and/or

one of the permutations is bit permutation which is performed block-by-block, and/or

encryption is performed with a random key, wherein at least a portion of the random key is included in the first data block in form of relative data, and/or

the interlace control data 1 which are identical for all units are read from the random reference data element which is identical for all units, wherein the position of extraction of the interlace control data 1 is defined for a randomly predefined time interval by a position data element 3 which is known to all units.

3. The method according to claim 2, wherein:

said P2P control data are accommodated in more than one P2P control information of the length DATL1, and/or

the random P2P control data in each P2P control information are generated using mask operations with reference to at least one random number, and/or

one data element in each P2P control information has a duplicate,

the receiving unit additionally detects the integrity of the data block from all of the duplicates, and/or

the receiving unit detects, from said distance number and its duplicate, the validity of time data and of the identical random reference data element valid for all the units and for a time interval, and/or

said interlace control data include at least one of an interlace start data element, a data element for identifying the data to be interlaced contiguously as data packets, and a data element for identifying data packet interlace spacings.

4. The method according to claim 2, wherein:

for a randomly determined time interval, at least one random reference data element is provided which is identically predefined for all units, wherein the length of the predefined random reference data element is the same or is larger than the total length of all identically predefined data reQiured for a P2P communication,

if the length of the identically predefined random reference data element is larger, at least position data element 3 is provided which is valid for all the units and for a random time interval and indicates the bit position at which a partial random reference data element which is identical for all the units and has a length equal to the total length of all the identically predefined data reQiured for a P2P communication is read from the identically predefined random reference data element,

said partial random reference data element identical for all units includes all of the identically predefined data reQiured for a P2P communication for all units and for the effective time interval,

for a new effective time interval, a new partial random reference data element identical for all units is read from the longer random reference data element identically predefined for all the units and for a longer time interval, using a new position data element 3,

only the units involved in said P2P communication have knowledge about the separate position data element 2 valid for said P2P communication, wherein said position data element 2 indicates the bit position at which a separate random reference data element having a length equal to the total length of all separate data reQiured for a P2P communication and predefined by the transmitting unit is read from the predefined random reference data element, and/or

said separate random reference data element predefines at least a part of all separate data reQiured for a P2P communication.

5. The method according to claim 2, wherein:

said random reference point is a random number or random reference number interpreted as a vector, or a random data element related to another minuend and interpreted as a vector, and/or

the vector of the respective data element point is determined by vector additions of the relative data element and the translation and rotation vector (second subtrahend) and of the vectors of the random reference point, and/or

the respective absolute data element corresponds to the sequence of coordinate values of the respective vector, and/or

said minuend is a data element point of random numbers, data identifying persons and/or units, P2P control information, and component data such as GPS data, and/or social security number, and/or tax number, and/or account number, and/or signatory data, and/or signature data, and/or device numbers, and/or card numbers, and/or identity numbers, and/or unit status data, and/or

each relative data element relates to a separate random reference point and is calculated using a separate translation and rotation vector.

6. The method according to claim 5, wherein:

the calculations of the separate random reference points are exclusive or (XOR) combinations related to coordinates and performed bit-by-bit, between a random number interpreted as a vector or a random data element interpreted as a vector, of a length ZUFL1, and a random number of a length ZUFL2 interpreted as a vector, and/or between a random number interpreted as a vector or a random data element interpreted as a vector, of a length ZUFL2, and a random number of a length ZUFL3 interpreted as a vector, wherein the length of the random number or of the random data element is equal to the sum of the coordinate dimensions of the vector,

the lengths of the random numbers and/or random data are the same or not the same with ZUFL1 larger than ZUFL2 and ZUFL2 larger than ZUFL3 and/or ZUFL3 equal three bytes,

the dimensions of the coordinates of the vectors are determined by the spatial coordinate dimensions of the underlying space,

in case of a smaller dimension of one coordinate of a vector compared to the dimension of the same coordinate of the other vector, the coordinate dimensions of both vectors are adjusted, and/or

in each random data element comprised of a plurality of bytes, the Hamming distance between two consecutive bytes is one.

7. The method according to claim 6, wherein:

the respective vector of said minuend and/or said first subtrahend is the position vector thereof, and/or

the minimal dimension of a spatial coordinate of an underlying space is one byte, and/or

adjusting the coordinate dimensions of the vectors to be XOR combined bit-by-bit is performed with reference to the spatial coordinates of the space in which the relative data element is calculated, and

in case of a smaller dimension of a vector coordinate, the coordinate value is repeatedly used in calculating the XOR combinations, or in case of a larger dimension of a vector coordinate, only that part of the vector coordinate overlapping the spatial coordinate of the space is used.

8. The method according to claim 5, wherein:

the coordinate dimensions of the translation and rotation vectors are determined or predetermined by the dimensions of the spatial coordinates of the underlying space, or are one byte each,

in case of a larger dimension of one coordinate of the vector compared to the dimension of the same coordinate of the underlying space, only the dimension of the underlying space is used,

in case of a smaller dimension of one coordinate of the vector compared to the dimension of the same coordinate of the underlying space, the value in the coordinate of the vector is padded with zeros until the dimension of the same coordinate of the underlying space is obtained.

9. The method according to claim 1, wherein:

in absence of a component data element, a random number of the same length is inserted in the respective data block instead of the relative component data element, or

only the component data flagged in its component identification data element in conjunction with the activated bits associated therewith are arranged in a sequence in the respective data block in form of its relative data, wherein said data block is supplemented with random numbers of the same length as that of the component data.

10. The method according to claim 1 wherein:

the data stream comprised of the P2P header and the proper data which are encrypted and/or permuted and/or re-permuted and/or provided with hash values, or comprised of the P2P header and the proper data which are encrypted and/or permuted and/or re-permuted and/or provided with hash values and the P2P data end block, constitutes a dedicated communication protocol, or

the data stream comprised of the P2P header and the proper data which are encrypted and/or permuted and/or re-permuted and/or provided with hash values, or comprised of the P2P header and the proper data which are encrypted and/or permuted and/or re-permuted and/or provided with hash values and the P2P data end block, are data of a communication protocol.