![]() This would increase to 4,950 if there were 100 communicating parties! This can be calculated as n(n-1)/2 where n is the number of communicating parties.įor example, if ten parties want to communicate with each other securely they would need 45 different key pairs: 10(10-1)/2 = 45. This quickly becomes difficult to manage the more there are. While the key was in transit, it could be stolen or copied by a third party who would then be able to decrypt any ciphertexts encrypted with that key.Īnother problem is that a large number of key pairs are needed between communicating parties. Traditionally, symmetric encryption suffered one enormous shortcoming – it was necessary for either the sender or the recipient to create a key and then send it to the other party. Interactive feature not available in single page view ( see it in standard view). ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |