Category Archives: key-generation

Explanation of Burmester-Desmedt group key exchange and Ingemarsson-Tang-Wong (ITW) group key exchange algorithm [migrated]

Posted on by

I know that both algorithms are similar to the Diffie-Hellman key exchange and are used for exchanging secret keys in a group but I still cannot figure out the key differences between both algorithms.
Is the difference only in the number o… Continue reading Explanation of Burmester-Desmedt group key exchange and Ingemarsson-Tang-Wong (ITW) group key exchange algorithm [migrated]→

How to generate and hex encode a ED25519 keypair using openssl 3.0 c++ [migrated]

Posted on by

So far I can do the following. But I have no idea if it is working because I can’t see the keys. I am planning on extracting them into a char array and storing them In a struct. So I need the full encoded byte array for the private and pub… Continue reading How to generate and hex encode a ED25519 keypair using openssl 3.0 c++ [migrated]→

Is there a viable zero-knowledge approach for using oAuth to generate and manage private keys?

Posted on by

I’ve been doing a deep dive into how products like Web3Auth work under the hood and wonder if this is a viable approach to building applications where a user can have the convenience of using oAuth to generate and manage a private key. Add… Continue reading Is there a viable zero-knowledge approach for using oAuth to generate and manage private keys?→

Create "bare" pgp private key / Make private key without being able to generate the public key from it

Posted on by

How do you create a private-key/public-key pair without the public key’s information in the private key? So you should basically not be able to extract the public key from the private key. The private key should contain the bare minimum.
I… Continue reading Create "bare" pgp private key / Make private key without being able to generate the public key from it→

Key distribution protocol involves only 2 parties, given E[k1,E(k2,m)]=E[k2, E(k1, m)]

Posted on by

Given an one-key cipher such that:
E[k1,E(k2,m)]=E[k2, E(k1, m)]
Is there any key distribution protocol that involves only two parties (Alice and Bob) without the key distribution center?
The protocol should allow Alice to send a session k… Continue reading Key distribution protocol involves only 2 parties, given E[k1,E(k2,m)]=E[k2, E(k1, m)]→