Questions tagged [key-generation]
Key generation is the process of generating keys for cryptographic purposes.
173
questions
0
votes
0
answers
17
views
Noise of Public Key Ciphertexts in HElib
I would like to get a feeling on how the noise develops in different FHE schemes. So I ran some experiments using HElib for both BGV and CKKS. I wanted to look at the noise of a fresh public key and a ...
- 1
1
vote
1
answer
63
views
How does the key generation of a homomorphic secret-sharing protocol works?
I am new to cryptography and do not have sufficient background knowledge, and I am sorry for any possible vagueness in my question.
I am reading a paper (https://eprint.iacr.org/2019/129.pdf) about ...
- 13
0
votes
0
answers
50
views
Question regarding JWK generation using RSA-PSS 4096
Summarized Question:
In the context of JWK generation using RSA-PSS 4096bit with SHA-256, where the public exponent is "e" = 65537, is there any situation ...
- 1
0
votes
0
answers
30
views
Is combining Elgamal algorithm and RSA algorithm for key generation and AES+RSA algorithm for encryption and decryption a novel approach?
Key generation: Key Generation
Firstly, the RSA algorithm will be used to generate a public and a private key.
Generate two random prime numbers p, q.
Select RSA public key, P k such that gcd(P k, Φ)=...
0
votes
1
answer
75
views
who creates the passkey (and how many will be created)? [closed]
Passkey is nice. The math is nice. The tech is nice. https://security.googleblog.com/2023/05/so-long-passwords-thanks-for-all-phish.html
What I still dont see after sooo many hours: what software ...
- 1
1
vote
2
answers
108
views
What is simple asymmetric encryption that use arbitrary key?
While XOR is used as simple symmetric encryption with arbitrary custom key, what is a simple asymmetric encryption that use arbitrary custom key?
That means I want to be able to set custom private key ...
0
votes
1
answer
69
views
Homomorphic Encryption - Integer modulus in HEAAN and key sampling
I am trying to wrap my head around Homomorphic encryption, specifically the HEAAN/CKKS scheme. I am reading through the publication, but I am getting stuck on page 11, namely the KeyGen and Enc ...
0
votes
1
answer
86
views
How to find the round key in AES 256
Can anyone explaine how to find the every 15 round key by the 64 hex digit master key of AES 256 please. I will be really greatfull
- 1
0
votes
1
answer
85
views
Clarification on the use of Key block Version ID with Thales HSM
Clarification on the use of Key block Version ID
For the first time since we migrated to the Key Block we are exchanging keys with third parties,
The keys were all generated by choosing Key Scheme &...
- 1
0
votes
1
answer
69
views
OpenSSL prime generation
Recently, I have noticed that openssl always gives numbers which have '1' in upper two bits. It always begins with 0xC or higher values (0xD, 0xE, 0xF). It doesn't give primes that starting with 0xB, ...
- 11
0
votes
0
answers
11
views
Why does compressed WIF generate a different address when importing to a wallet
I have a compressed WIF private key starting with K but when ever i try to import it gives a different address. What could the issue be. The address generated is correct for the private key as i do ...
3
votes
1
answer
447
views
How does TLS 1.3 restrict the Diffie-Hellman parameters to ones that are known to be secure?
In previous versions of TLS, the choice of the Diffie-Hellman parameters was up to the participants. This resulted in some implementations choosing incorrectly, resulting in vulnerable implementations ...
- 33
7
votes
1
answer
264
views
Generating suitable prime numbers for Paillier key pair in GG18
I am working on MPCs (multi party computation) in crypto, and now I am developing a implementation of GG 18.
In sign phase, algorithm needs MtA (Multiplicative to Additive) and uses a Paillier key ...
- 83
1
vote
1
answer
584
views
How do non-"resident" keys work in WebAuthn?
If we look at the WebAuthn specification, then, during the "registration" ceremony, the authenticator generates a new key-pair and a unique user-id. Then the public-key and the unique user-...
- 43
2
votes
2
answers
62
views
DES initial key generation
I am working through a textbook on crypto, currently on DES section. What bothers me is that there was no explanation about where do we get initial 64-bit key from. This question is also very hard to ...
3
votes
1
answer
519
views
Why does FIDO2/WebAuthn really need to generate a separate key-pair for each site?
I understand that FIDO2/WebAuthn generates a separate key-pair for each web-site (domain), and only allows a specific key-pair to be used for authentication on the same web-site (domain) who ...
- 43
0
votes
1
answer
111
views
How does the public key cryptography algorithm generate a public key based on the private key? [closed]
Because of the need of the project, I want to develop a simple public key cryptography algorithm, but I have doubts when generating the key pair.
I have learned about the key generation process of RSA....
- 21
1
vote
2
answers
75
views
How is asymmetric encryption possible if you need a passcode in order to encrypt something?
Cant you look at the algorithm used to encrypt and find the private key from the public key that way? As an example, here's a simple python algorithm that encrypts an input:
...
1
vote
0
answers
67
views
SUPERCOP benchmark of signature scheme: Number of cycles of key generation
I'm having troubles in interpreting the output of the SUPERCOP benchmarks of some digital signature schemes.
Precisely, I don't understand how to read the number of cycles for the key generation. This ...
- 11
4
votes
1
answer
94
views
NTRUEncrypt proof that there are plenty of keys
In NTRU algorithm one is supposed generate a vector which is invertible as a polynomial in both $(\mathbb{Z}/p\mathbb{Z})[x]/(x^n-1)$ and $(\mathbb{Z}/q\mathbb{Z})[x]/(x^n-1)$. But is there a ...
2
votes
0
answers
46
views
Deriving multiple deterministic keys in a Schnorr Multisig setup
Let's say that Alice and Bob have generated truly random private keys $a$ and $b$ and want to use them in Schnorr signing. They calculate $X = g^a \cdot g^b$ as their mutual public key. For whatever ...
- 21
5
votes
1
answer
169
views
RSA Key Pair Generation - limit on $e$
FIPS 186-4 and NIST SP800 56B states following limits for public exponent $e$
$e$: a pre-determined public exponent − an odd integer, such that $65,537 ≤ e < 2^{256}$.
What security issue arises ...
- 2,397
1
vote
0
answers
23
views
For RSA keys, is there any security benefit to having P and Q of different bit counts [duplicate]
In some RSA libraries I've encountered, the P bit count is left shifted by some amount and Q bit count right shifted by the same amount. For example, if generating a 2048 bit key, the P bit count ...
- 217
7
votes
1
answer
391
views
RSA public keys such that encryption is identity
In this question, we restrict to RSA public keys $(n,e)$ such that
$n$ and $e$ are odd, $3\le e<e_\max$, $e<n$
Note: For some old Windows API, $e_\max=2^{32}$. In FIPS 186-4, $e_\max=2^{256}$. ...
- 137k
1
vote
0
answers
75
views
They key size of the Schnorr Signature Algorithm
Based on the Schnorr signature below: What is the suitable size of lamda to generate a secure key?
- 13
2
votes
1
answer
65
views
What is the purpose of "q" in Safe Prime definition during key pair generation?
Consider the following case, given x(private key) and y(public key), how to determine whether this key pair is generated by a pre-defined Safe Prime Group(Say FFDHE, RFC 7919)?
In context of SP800 ...
- 33
0
votes
0
answers
50
views
Client Side Encryption For Web Apps
I want to build something where web clients encrypt some data server side and store it with me. However, I am not sure how to manage the user keys - ideally they can just sign in with social to access ...
- 1
2
votes
0
answers
78
views
Explanation of Burmester-Desmedt group key exchange and Ingemarsson-Tang-Wong (ITW) group key exchange algorithm
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.
...
- 121
1
vote
0
answers
55
views
DES next round key
I don't understand which DES key is used in the next round of Feistel construction.
As you can see below, we use our original key that has been inserted in permuted choice 1, where we got 56 bits, ...
- 11
1
vote
1
answer
73
views
Could I Use a Hash Function to Help Generate Cryptographic Key
If I had a true random number generator that had a fault where 10-20% of the bits never change (these bits always produced the same value every time the TRNG was called), could I feed the result of ...
- 13
1
vote
0
answers
40
views
Which data is communicated between participants in Distributed Key Generation
I was asked recently if it is somehow possible to use already existing keypairs stored in HSMs for, e.g. ped-DKG.
Which ultimately led me to the question, which data is actually exchanged between ...
- 11
2
votes
0
answers
281
views
In RSA, are e and d technically equivalent? [duplicate]
In the process of finding RSA key pairs, we first find a e that is relatively prime to φ(n) (where n = p × q), and then find d such that e × d mod φ(n) = 1. Is d also relatively prime to φ(n), or not ...
- 157
-1
votes
1
answer
5k
views
Step-by-step conversion of Private Key in Hex to WIF (Wallet Import Format)
According to this webpage:
The process of encoding a private key into WIF format is as follows.
Raw private keys are simply large numbers, which are represented as
bytes. WIF format adds a prefix ...
0
votes
1
answer
37
views
Are there any encryption schemes where more than one key give the same encryption and decryption operations? [duplicate]
Given an encryption scheme that takes as input a key $k$ and converts it to an encryption operation $E$ via the function $M(k) = E$, is it possible that more than one $k$ can give the same $E$?
For ...
- 101
0
votes
1
answer
41
views
Key distribution protocol involves only 2 parties, given E[k1,E(k2,m)]=E[k2, E(k1, m)]
Given an one-key cipher such that:
$E[k_1,E(k_2,m)]=E[k_2, E(k_1, m)]$
Is there any key distribution protocol that involves only two parties (Alice and Bob) without the key distribution center?
The ...
- 1
1
vote
0
answers
62
views
Should proving key be kept as a secret in NIZK?
Hi I am quite new to NIZK. I know a trusted party (Generator) generates proving key and verifying key and then distributes them to Prover and Verifier. Apparently, the verifying key can be seen as ...
- 31
0
votes
1
answer
742
views
How proxy re-encryption works - layman perspective
Here is the use case: A uses B's public key to encrypt a message and sent it to B. In later stages, a new member C joins and B would like to let C be able to see this encrypted message (i.e., give the ...
- 69
1
vote
0
answers
64
views
What are the uses of shared cipher texts and signatures?
In Distributed Key Generation(DKG), why is there a need to actually create a master secret which can then derive into a single public and private keypair(for signatures) and a secret key(encryption)?
...
- 125
0
votes
0
answers
79
views
Enumerating values from a linear congruential generator java Random()
During my research on a java application, I discovered that the nextInt(64) function of the java.Random() class is used to ...
1
vote
1
answer
618
views
Salt value in scrypt algorithm
I see there are a lot of questions relating to handling of a salt value but nothing I have seen so far has cleared the following question.
When using a KDF such a scrypt, I believe the value of the ...
- 55
2
votes
1
answer
193
views
If the symmetric key is stolen; can I key revoke without reencrypted data?
I have a question about database security. This is a scenario I have.
The data is encrypted using symmetric (i.e., AES) and stored in a database, while the secret key is stored on the client side, so ...
- 21
1
vote
0
answers
52
views
Distributed key generation when all parties need to participate
Suppose $n$ parties where $t$ are honest want to perform a distributed key generation protocol. There are many existing schemes. In the simpler setting where all $n$ parties must be online, otherwise ...
- 1,365
2
votes
2
answers
457
views
Why do most authenticated encryption primitives expect an unpredictable and uniformly random key in order to be secure?
I've noticed that keys for authenticated encryption primitives like AES must be unpredictable and uniformly random in order to be secure. IV values and seeds for PRNGs also have to be unpredictable ...
- 23
0
votes
1
answer
365
views
Usage of cookies in IKE
While creating secret keys in IKE protocol, sides use cookies but I did not understand where they come from, how they are generated and why they are used. Can someone explain? Thanks.
- 27
1
vote
0
answers
26
views
Requirements of dedicated broadcast channel in Joint-Feldman protocol
I am currently reading through Secure Distributed Key Generation For Discrete-Log Based Cryptosystems, which describes a secure variant of the Joint-Feldman protocol. In this paper, in section 2 (...
- 111
1
vote
1
answer
89
views
Generating a public-private key pair from another key pair
Is the following problem a known cryptographic problem?
Find algorithms for functions $f$ and $g$, such that
$$
f(x, \alpha_{enc}) \rightarrow \beta_{enc}\\
g(x, \alpha_{dec}) \rightarrow \beta_{dec}
$...
- 113
0
votes
3
answers
1k
views
AES Key vs RSA Key
I am compeletely new to cryptography and recently tried to understand it a bit more thoroughly.
My question is:
How does the Generation of keys differ in the case of AES and RSA.
I understood, that ...
- 101
1
vote
1
answer
58
views
Best practice to create an old-style installation key
All current best practices about creating and using cryptographic keys I've found, refer to creating an encrypted data out of raw data. However, there is (or at least was a few decades ago) a practice ...
- 513
0
votes
2
answers
446
views
How can I dentify the ECDHE group value used in a TLS session
In ECDHE, the group is a public value.
I want to get this value for a session. I inspected the session using Wireshark.
Under the ServerHello -> Key share extension -> Key share entry, I found ...
- 111
1
vote
0
answers
32
views
Choice of random in RSA-KEM [duplicate]
This may be nit-picking, I’m not sure so feel free to say so.
In RSA-KEM as described e.g. in Wikipedia or this answer, we choose a secret $x : 0 \leq x < n$, and send $x^e \bmod n$ for public ...
- 147