# Questions tagged [key-generation]

Key generation is the process of generating keys for cryptographic purposes.

144 questions
Filter by
Sorted by
Tagged with
2k views

### Where do key generation algorithms take the randomness from?

I was just wondering, because in many encryption tools like Veracrypt or GnuPG you have to generate pseudo randomness with your mouse movement. So, where do automatically generated keys take that ...
• 4,025
1 vote
1k views

### Find inverse in RSA

I've been reading on RSA for a while but there's something I still can't understand. When generating the key: once you find n = pq and φ(n), you choose a number d coprime with φ(n) and then you need ...
• 135
1 vote
335 views

### How to combine pepper in random string generation

I am writing a key generator program. Indeed it generates a key in the form of a random text string (not binary), with its characters chosen randomly from a set of defined characters, with a ...
• 447
271 views

### Rijndael - is there some difference in resistance between counter in generator input and in IV?

I am thinking about Rijndael implementation in order to store tokens (cannot be hashed) - one token for one user. And finally I get stuck with key/IV generation problem :( The questions are: 1) Is ...
• 121
1 vote
498 views

### Time taken to break cryptographic key

Assume it takes 512 clock cycles to check if a 64 cryptographic bit key is correct. Given a 64 bit plain text and its ciphertext, how long does it take to check all keys using a single core of a 4 GHz ...
130 views

### Are there any downsides to key stretching an already high quality entropic key?

For example, if we grab 50 bytes from a high quality source and run them through a key stretching function like Argon2 and have it generate a 32 byte secret for AES. Is there any downside to this? Do ...
• 45
120 views

### Is there an asymmetric scheme where keys form a graph and a message can only be decrypted across a certain degree of separation?

Consider a network of trust, where each user u specifies some other set of users whom u "trusts". This forms a graph with users ...
• 131
1 vote
285 views

### securing the keystore

When generating a public-private key pair you have the option to secure the keystore with a password. where is that password stored, is it a hashed version that is stored and if that is so which ...
• 155
404 views

### Why isn't ElGamal a symmetric-key scheme?

I was asked about this question by a friend. He considers that Alice and Bob share a secret key s=g^(xy). So why isn't it considered a symmentric-key scheme? ...
1 vote
480 views

• 143
3k views

### RSA public key exponent generation confusion

Quote from Wiki: $e$ having a short bit-length and small Hamming weight results in more efficient encryption — most commonly $2^{16} + 1 = 65537$. However, much smaller values of $e$ (such as $3$) ...
• 246
11k views

### Why is the private key generated first in public key crypto?

I'm still new to public key crypto. I'm trying to understand how it is that the private key is generated first in public key crypto? I would have expected the private and public key to be generated at ...
608 views

### How exactly is the output of the XOR step in PBKDF2 used?

I'm attempting to diagram PBKDF2 for a school project and I'm not 100% sure how to represent the XOR step. Specifically, I'm confused as to whether the output of the XOR step is used in subsequent ...
166 views

### Issue about randomness : what if random looks "human" ? [closed]

I read a lot of stuffs about entropy/randomness. But what if a random generator (either digits or strings) once output a "human" patern ? I know it is very unlikely to happen, but if a random code ...
2k views

### Problem with Python Implementation of Key Exchange part OTR Protocol [closed]

Being new to software development and crypto in general, I thought I would write a simple p2p encrypted chat app using the otr protocol detailed here: https://otr.cypherpunks.ca/Protocol-v3-4.0.0.html ...
1 vote
319 views

### Generating the keys for the RSA cryptosystem in probabilistic polynomial time

In general every public key cryptosystem has'' a probabilistic polynomial time algorithm $G$ such that $G(1^k)=(\textrm{public key}, \textrm{private key=trapdoor})$; $G$ is called the key generator. ...
• 263