Abstract: A method for generating one or more cryptographic keys between users A and B, in which A generates a public value sensitive to a MIM attack and decomposes it into m segments of redundancy o, and transmits this concatenated information with a reference message Na over the network via k routing paths and vice versa for B, A and B regenerate the common secret by recalculating the inverse transform of all the combinations of o segments and by choosing the value that is statistically most represented, gab˜ for A, and g˜ab for B, A sends a verification message corresponding to Nb from B encrypted with gab˜ and sends it to the party B, B decrypts the message from A with g˜ab and checks consistency with Nb, then refers to the acknowledgment message in the same way: {Na} g˜ab to validate the common secret between the two entities.

Abstract: A method for generating encryption keys and for exchanging the parameters making it possible to generate the keys in a network comprising n entities X wishing to exchange data, the method includes the steps: the n entities elect a common array generator (GM(?)), at least one of the entities X communicates these values (?i) via several different routing paths Ci, plus a reference random number NX, NY, each entity X, Y generates an array Ts, each entity X, Y composes a secret key based on the generated array (Ts) and based on several values indexed by several pairs ((i,j); (k,l); . . . ; (o,p)) of said array in order to create its secret value, the random number of a first entity X is returned to a second entity Y, one of the n entities X, Y at least compares the consistency of the two values NX after decryption with its own key KXs.

Abstract: In a method and system for securing a software package that can be broken down into a number of “event-action” type independent tasks, the tasks managing a set of “scripts”, the method includes using a script and message encapsulation module and a transmission of encapsulated scripts to a trust resource suitable for executing them.

Abstract: A method making it possible to distribute elements for generating one or more cryptographic keys between at least two users A and B in a network implementing a routing protocol, characterized in that: to communicate with B, A generates a public value that is sensitive to a malicious MIM attack and decomposes it into m segments of redundancy o, and transmits this concatenated information with a reference message Na over the network via k routing paths and vice versa for B when he wants to communicate with A, the two parties A and B regenerate the common secret by recalculating the inverse transform of all the combinations of o segments and by choosing the value that is statistically most represented: gab˜ and g˜ab once the two secrets assumed to be common have been calculated, gab˜ for A, and g˜ab for B, the party A sends a verification message corresponding to the reference message Nb from B encrypted with the common secret: gab˜ and sends it to the party B: {Nb}gab˜, B then decrypts the message from A wi

Abstract: A method and a system for routing exchange flows of public or non-sensitive values for creating common keys between a number of areas in a system in which the entities communicate with each other by trust group, including: each entity generates a public value and communicates this public value to a router; the router, having a mapping table correlating a virtual network number and the MAC addresses of the associated entities, recovers all the public addresses transmitted by the entities by associating them with their MAC address, and retransmits, to each of the entities, a public value of another entity belonging to the same trust group; each entity recovering the public value of another entity belonging to the same trust group then determines the value of the encryption key common to the entities of one and the same trust group; and uses this key to encrypt the data to be transmitted to another entity.