Questions tagged [key-generation]
Key generation is the process of generating keys for cryptographic purposes.
88
questions
4
votes
1answer
89 views
Consequence of $p\bmod e=2$ in RSA prime generation
When generating a prime $p$ for use in an RSA modulus with public exponent $e$, it is necessary that $\gcd(p-1,e)=1$. When $e=3$, and since $p$ is a large prime, that implies $p\bmod e=2$.
Assume an ...
0
votes
1answer
94 views
Symmetric key validity hypothesis?
Can I use something like Shannon entropy to determine the suitability of a symmetric key? I found a symmetric key which wasn't generated using a CSPRNG and it had a very low Shannon entropy.
I ran an ...
2
votes
2answers
110 views
When is a cryptosystem or its algorithm (like RSA) considered efficient?
When is a cryptosystem (like RSA) or its algorithm for keygeneration, encryption and decryption of messages considered efficient? Is there some bound in complexity which splits both efficient and not ...
2
votes
1answer
229 views
How to find the inverse of a polynomial in NTRU-PKCS
I am coding a java based implementation of the NTRU public-key cryptosystem. I can comprehend the majority of the algorithms involved in the encryption and decryption process well enough, but the key ...
0
votes
0answers
115 views
What are the safe primes for $p$ and $q$ used in ElGamal?
I need to generate a 2048 bit key for ElGamal and I was looking for the $p$ and $q$ for PGP but I couldn't find them. the only thing I could find was this RFC but those are not safe primes.
Does ...
1
vote
1answer
77 views
Proof that Niederreiter Cryptosystem is correct
I read about Niederreiter Cryptosystem. I understood the Key Generator, encryption and decryption of the cryptosystem, but if I want to prove that is a correct cryptosystem, what should I do?
1
vote
2answers
239 views
The importance of randomness in the creation of a key
Why does it matter what kind of random number generation is used during key generation?
E.g. this answer states ...
1
vote
1answer
62 views
Is there a way to generate a password from another but those 2 will have no relation?
For example I have the password X and I want to encrypt 2 different things. Even if one of them was stolen due to a keylogger, other will be completely safe. I wonder how safe something like this ...
1
vote
1answer
63 views
How should one handle the identity value and other “obviously” weak secret random values?
In RSA, ECDSA, ElGamal and quite a few other schemes, using a secret (random) value equal to 1 might not provide any form of security, while still being mathematically sound.
For RSA, ECDSA or ...
1
vote
1answer
86 views
Difference between Key Scheduling and Key Generation?
I am a little bit confused in the terms i.e Key Scheduling and Key Generation. What is the actual difference between these two terms? According to Wikipedia, the terms are described as:
Key ...
0
votes
1answer
37 views
Vulnerability of low value generated key
I have read here that Elgamal is resistant to brute-force attack, because the group to where the key is selected is very large. But since the key generation is random, (i assume)there is a chance that ...
0
votes
1answer
95 views
Using a classical method, is it possible to create a key that is indistinguishable from one made in a truly random manner?
Is there a classical method that will allow us to create a key that cannot be distinguished from one that was generated in a truly random manner?
For example, let's say we use three "words" to create ...
2
votes
1answer
104 views
What is a randomly derived key?
It is a well-known fact that using the same key + nonce combination with a stream cipher twice breaks security. The NaCl library has different primitives for authenticated encryption (i.e., ...
2
votes
0answers
26 views
Is there a scheme to force a party to generate a fresh key?
Is there a way to force one party to generate a fresh key, such that another party can be convinced that the key was freshly generated, without that party also knowing the key?
I'm motivated by a ...
2
votes
1answer
2k views
curve25519 by openSSL
How can i generate ec curve25519 keys using openSSL?
When I run
openssl ecparam -name curve25519 -genkey -noout -out private.ec.key
I have this message
...
1
vote
2answers
399 views
Generate PGP keys very very fast
Is there a way to generate thousands of PGP keys at a very very fast rate?
I am generating thousands of 3072-bit PGP keys looking like part of a personal research project. Obviously, this is a very ...
2
votes
1answer
205 views
Generating a key pair using a signature generated by an existing key
I’ve built an app in which each user has a private/public key pair and I want to generate a second one for them, however I cannot store the second private key anywhere.
What would be the drawbacks ...
6
votes
1answer
519 views
Is forward secrecy overhyped or necessary?
Forward Secrecy, also perfect forward secrecy, gives assurance about session keys even the private key is compromised. This is achieved by generating a random key per session without using a ...
0
votes
1answer
288 views
Finding a secret key corresponding to a public key
As far as I know, a secret key corresponding to a given public key is not unique. So, for example, there are actually multiple secret keys that can produce the same digital signature under RSA ...
2
votes
0answers
80 views
Distributed key generation (for discrete-log based cryptosystems) with fake shares
Under the definition of Gennaro et al (link), a DKG protocol needs to satisfy “correctness” and “secrecy”. Correctness is divided into three sub-properties:
C1. All subsets of $t+1$ shares provided ...
1
vote
0answers
48 views
Why (N+1)sec's mDP Implementation does not check whether all the XORED received $z$ values are 0
In the original mDP protocol once all $z$ values received from each participant the following calculation is being done:
If either $XOR(z_1,z_2,...,z_n) = 0 $ or received invalid Signature then ...
1
vote
1answer
73 views
Why do general encryption key generators also take the algorithm as input?
To my understanding the key generation logic only needs a source of randomness and the length of the key to be generated as input. However, we still provide the algorithm (names) like AES, DES, ...
0
votes
1answer
82 views
Binary representation of the inverse of a big number [closed]
In one of the first FHE schemes by Gentry, the KeyGen algorithm is defined as follow:
For a security parameter $\lambda$, set $N = \lambda ^ 2, P = \lambda ^ 2, Q = \lambda ^ 5$.
KeyGen$(\lambda)$: ...
2
votes
0answers
79 views
General Private/Public key generation [closed]
I wanted to get an idea on how the whole cold-storage private/public key generation works for different cryptocurrencies. So I was playing around with BIP32 deriviation path on:
https://iancoleman.io/...
3
votes
1answer
389 views
How to generate a distributed private key?
Shamir's Secret Sharing scheme is really interesting but the pain point is that the secret is generated by one trusted party, then the shares are distributed to other peoples.
Is there any scheme ...
1
vote
1answer
108 views
Doubts regarding implementing AES-128 bit algorithm in my IOT system
I want to implement AES-128 in my IoT network which consists of a Master device which runs Linux on it and slave devices which are 8-bit micro-controllers that periodically transmit data packets to ...
2
votes
0answers
28 views
What are SNFS-safe limits for an RSA moduli optimized for simple modular reduction?
I consider $n$-bit RSA moduli $N$ having high-order bits starting by with $k$ bits at 1, then $k$ bits at 0, then $m-2k$ bits at ...
2
votes
2answers
101 views
Multiparty secret generation protocol
The goal is to create a secret S on a trusted server by having users A, B and C each send a private seed to the server, in such a way that any 2 of them can later recover S by resubmitting their ...
2
votes
2answers
246 views
Can the key-generation algorithm always be uniform?
Assume that the encryption uses $n$-bit keys to encrypt $l(n)$-length messages.
If a symmetric key encryption scheme is defined as $\Pi_{1} = ( \mathrm{Enc}, \mathrm{Dec} )$, then for every $x_{0}, ...
0
votes
1answer
517 views
Diffie Hellman vs Three Pass Exchange
Given an insecure channel, what are the pros and cons of using Diffie Hellman to generate a symmetric shared key and then send encrypted data with this key, or simply use Shamir's three-pass protocol ...
3
votes
1answer
3k views
Generating a NIST P-256 private key
From the Curve25519 spec I learned that it possible to take a random 32 bytes and with a few operations make it on the curve:
To generate a 32-byte Curve25519 secret key, start by generating 32 ...
3
votes
1answer
204 views
Safety of encrypting a plaintext with its hash as the key
What are the safety issues of using the the hash of plaintext as the key to encrypt it? The first that comes to mind is that if I can guess an approximation or part of the plain text, brute force ...
4
votes
3answers
645 views
What is proper use of a True Random Number Generator?
Let's say I have a true random number generator TRNG. Random numbers are generated on demand from a HW-entropy source, resulting in a 32-bit random value each time it is called.
I have to fill an ...
0
votes
2answers
477 views
Algorithm to generate ECDSA keys with random number generator
I have a certified random number generator (TRNG, it does not matter what it is for the question).
I would like to use it as a source to generate secp384r1 ECDSA keys. What is the algorithm I should ...
1
vote
1answer
230 views
Key expansion for cryptographic keys
I have seen some applications use key expansion when deriving AES-keys.
E.g. the application will generate some random data (e.g. 128bits), then use PBKDF2 to expand it into 512bits (2x256 keys).
Why ...
0
votes
2answers
559 views
Are cryptographies based on bitwise operations considered secure?
I have recently been reading (and writing) a lot off ECC on top of TCP via pythons sockets. I've stubbled across a couple of things mentioning how elliptical curves are more secure with the same key ...
39
votes
1answer
4k views
What is “Fast Prime”?
In this note, the manufacturer of a RSA key generation gizmo vulnerable to the new ROCA attack (see second section) explains that
it is common practice to employ acceleration algorithms in order to ...
0
votes
1answer
356 views
SHA2 Certificate generating (create Signed Certificate) [closed]
i was requested to write a programmer that can generate A SHA2 certificate. So i wrote a tester class to try and mimic Keytool process of generating One (referencing base of this: url https://www....
2
votes
0answers
118 views
RSA - find d,e with restrictions
For academic purposes, assuming $n, p, q$ with $n\approx 2^{4096}$ and $p,q\approx 2^{2048}$.
I need to find ($e,d$) such that:
$e$ is smaller than $2^{64}$
$d\approx 2^{4096}$ and will have as ...
0
votes
2answers
724 views
How should one create an ephemeral Diffie-Hellman private key?
When picking an ephemeral Diffie-Hellman private key (little a or little b), can I reasonably just pick 32 random bytes? I am specifically interested in use within SRPv6.
RFC5054 says that these ...
5
votes
2answers
7k views
Why are ephemeral/session/temporary keys useful?
One reason that communication protocols use ephemeral keys is to help with implementing Perfect Forward Security.
They're also used in SSL to go from using RSA to using a faster symmetric encryption.
...
1
vote
1answer
281 views
Offline session key agreement protocol
Is there any implemented solution to agree on a session key in offline way.
I can exchange some keys before being offline but I need both sides to create the session key offline.
I need implemented ...
0
votes
1answer
2k views
How to Check Strength of RSA Public Private Key
How to measure strength of RSA public private key pair. is it enough to only measure the length of primes used to generate N? how to check that primes p,q used to make N were selected truly randomly ...
1
vote
1answer
126 views
McEliece parameter tuple (n, k, t) through BouncyCastles (m, t, poly) [closed]
I am using BouncyCastles Java API and want to use McEliece encryption. After browsing through various paper for finding good parameters (e.g. How to choose McEliece's parameters?) I am now having the ...
5
votes
2answers
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 ...
1
vote
1answer
877 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 ...
0
votes
3answers
259 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 ...
2
votes
0answers
265 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 ...
1
vote
0answers
311 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 ...
0
votes
1answer
91 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 ...
