I am using borrowed techniques from books from Bruce Schneier and Niels Ferguson. Basically, it boils down to this:
Bob does this:
pubk_A = Alice's public key
Entropy = Byte cryptographic PRNG to Quality
Encrypted_Netropp = RSA_Encrypt pubk_A (entropy) hashed_netroopy = SHA2-512 (Entropy) encrypt_key Bob then ali Sends encrypted_trropy to S Then Alice does this: privk_A = Alice's private key enterpp = rsa_drycrypt personal_a (Encrypted_entrophy) hash_droppy = Shah-2-512 (entropy) encrypt_key This Works great to generate the key that Bob interacts with Alice Area can be used for. But I need those keys which I can use in both directions. I was thinking of modifying the algorithm like this: Bob enters with the entropy: pubk_B = Bob's public key hashed_intropi encrypt_key = hashead_natropi [0:32] Hash_Intropy encrypt T_keys As you can see, now there are two sets of keys, which are used to communicate with Bob. And for the second. Is there something wrong with it? What safety is I taking? Is the security of the system low or if I just cross one Did Tweak tweak a little bit more? Is there a better way without a round trip to solve this problem? The problem with both Alice and Bob is a shared key for bi-directional communication. like. The only idea is that you can not use the same This improvement can be made on the Saturn / Ferguson Protocol, which will remove the requirement for In terms of your version of this protocol, you still have to rely on sending
encrypted_napes
hmac_key < All> ba = hash_intropi [48:64]
EncryptedAnpes
hmac_key
EncryptedAnapace
hmac_key
encrypted_napes
hmac_key iv + master key combo with any packet. Apart from it, iv.
hmac_key . This will reduce bandwidth used for handshake and CPU usage for each packet.
encrypted_tropy = RSA_Encryptpubk_A (entropy) . This is an important step because you have to share the share. Uses the known value of
pubk_A in the main generation. Keep in mind that it should be assumed that any public key is known to the attacker, the use of Sha256 is more costly or brutal force Does not make it more difficult for In this way, the number of guessing the attacker is equal to these three calculations:
sha512 (sha256 (pubk_A) + entropy) ,
sha512 (pubk_a + entropy) ,
SHA512 (Entropy) . This means that it is a waste of resources because you are not benefiting from your attacker.
Comments
Post a Comment