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.