To achieve security and anonymity for communications in communication.
In the protocol, a plurality of computer nodes communicate with each other by using an seemingly random IP transmitting source address, an seemingly random IP destination address, and an seemingly random discriminator field (optionally). Data packets matching criteria defined by a moving window of valid addresses are accepted for further processing, while those not meeting the criteria are rejected. A hopped address has a non-repeating sequence length, can jump sequentially only by an arbitrary number of random steps in advance at high speed and is further generated by a random-number generating program. Synchronization can be reestablished between a transmitting-side node and a receiving-side node, and self synchronizing art wherein a synchronizing field is transmitted as a portion of each packet and a "checkpoint method" wherein the transmitting-side node and the receiving-side node can proceed to the points known in the hopping method are provided.
SABIO VINCENT J
SHORT ROBERT DUNHAM III
GLIGOR VIRGIL D
SCHMIDT DOUGLAS CHARLES
| JPH1168735A | 1999-03-09 | |||
| JPH10290262A | 1998-10-27 | |||
| JPH10268762A | 1998-10-09 | |||
| JPS62214744A | 1987-09-21 | |||
| JPS62195949A | 1987-08-29 |