algorithm - In the public key cryptography, number of keys required for secure communication between n parties will be? -

algorithm - In the public key cryptography, number of keys required for secure communication between n parties will be? -

in public key cryptography, number of keys required secure communication between n parties be?

in view reply should n*n (or n^2 or n squared)

reason: there ‘n’ parties. every party has 1 (1) public key (for encryption). also, every party has n-1 private keys (paired) (for decryption) every party has 1 + n-1 = n keys, , there n parties communicating. no. of keys required = n x n = n^2. correct? (please specific & show total logic & give proper explanations).

n key pairs enough.

every party generates private/public key pair , publishes public part. when alice wants communicate bob, encrypts message bobs public key , bob (not alice!) can decrypt it.

i think confusing secret key (aka symmetric) crypto, every communication channel must have own key, , there n*(n-1)/2 channels n parties.

algorithm encryption public-key-encryption