Skip to main content

Questions tagged [key-generation]

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

Filter by
Sorted by
Tagged with
0 votes
1 answer
51 views

Is it possible for seed phrases to collide?

I recently read about hierarchical deterministic keys, which allow a single seed to produce multiple private and public keys. In decentralized systems, identity can be represented by a wallet, which ...
Muhammad Ikhwan Perwira's user avatar
0 votes
0 answers
26 views

Should Homomorphic Encryption Keys Be Generated by a Key Generation Server or the Data Owner?

I'm currently working on a project involving homomorphic encryption and I'm trying to determine the best practices for key generation. Specifically, I'm unsure whether the keys should be generated by ...
snow's user avatar
  • 1
1 vote
1 answer
506 views

Key generation from partially random data

Suppose an embedded system without a true random number generator peripheral, but nevertheless it is necessary to generate a secret key. Suppose also that this embedded system has an analog-to-digital ...
swineone's user avatar
  • 880
4 votes
2 answers
4k views

What is better source of random bytes: Yubikey or /dev/random (or both)? [closed]

Let's say I need to generate a key, I have these three options as to where to get random data: Yubikey (gpg-connect-agent 'SCD RANDOM 16384' /bye) ...
DimanNe's user avatar
  • 151
0 votes
1 answer
65 views

Public proven methods to generate SSH key from pass phrase?

Do we have something proven APPS for generate ssh key from some words? I mean private key(without reason wich type rsa or eleptic curves) generated deterministic from seed I found this fork of ssh-...
Andrew's user avatar
  • 1
6 votes
1 answer
374 views

RSA with 3e≡1 (mod p−1) and 5e≡1 (mod q−1)

Consider RSA with $p$ and $q$ large distinct secret safe primes in interval $\bigl(2^{(n-1)/2},\,2^{n/2}\bigr)$, and private key $(N,e,d,p,q,d_p,d_q,q_\text{inv})$ computed as $$\begin{align} N&=p\...
fgrieu's user avatar
  • 142k
2 votes
0 answers
74 views

Why are most ABE KeyGen algorithms probabilistic algorithms?

It seems that in most Attribute Based Encryption schemes, the keygen algorithm is probabilistic, which means that given the same public key, master secret key and attribute set (or access structure), ...
CHG's user avatar
  • 31
1 vote
1 answer
208 views

Could FIPS 186-5 A.1.6 method generate P and Q with different bit size?

refers to FIPS 186-5 document, I have a question about RSA Key generation A.1.6 method, "Generation of Probable Primes with Conditions Based on Auxiliary", my understanding is that, this ...
gx16's user avatar
  • 45
1 vote
1 answer
112 views

Pitfalls of manual AES encryption for data transfer

Context I've used OpenSSL to encrypt some socket communications. I am however using some functionality from the windows API that prevents me from using OpenSSL's opaque builtin sockets, so I am ...
TrisT's user avatar
  • 151
3 votes
2 answers
1k views

RSA key generation with large random numbers and no primality testing

Does the security of RSA rest entirely on the modulus having at least 2 large random primes? Suppose you were to generate 2 random 1,000,000-bit numbers and just use the product of those as the ...
user avatar
3 votes
2 answers
563 views

RSA perfect square phi

So I've been learning about RSA for quite a while (mainly by playing around in CTF competitions) and I came across an interesting problem. The other day I was looking to create a challenge in which I ...
Anonymous's user avatar
0 votes
1 answer
87 views

Is there an open source key-derivation service?

Hello sorry if this is a silly question and do say if this would be more suitable for a software stack-exchange but after a lot of googling I've still not found anything suitable, so starting to worry ...
Alex Dawn's user avatar
0 votes
0 answers
50 views

In RSA Encryption, Can I choose the public exponent e > m (modulus) ? or e > φ(n)? [duplicate]

In RSA ,the encryption, Can we choose the public exponent (e) greater than m (modulus) or e > φ(n) ? I wonder about choosing public key exponents (e) because the most information on the internet or ...
Nicha59's user avatar
  • 11
3 votes
1 answer
139 views

How much can we compress RSA public keys with two equal size factors?

Can we define an RSA variant in which the public key with $n$-bit public modulus $N$ has a compact representation of $\kappa\ll n/2$ bits, with a security argument that it is as safe as regular RSA ...
fgrieu's user avatar
  • 142k
0 votes
0 answers
54 views

In RSA Encryption, Can the public exponent e > m (modulus) ? and can we choose any public key without paying attention to the conditions? [duplicate]

In RSA ,the encryption, Can we choose the public exponent (e) greater than m (modulus) or e > φ(n) ? I wonder about choosing public key exponents (e) because the most information on the internet or ...
Nicha59's user avatar
  • 11
2 votes
1 answer
90 views

in NTRU, can g be recovered given f and h?

The NTRU key generation involves polynomials and their arithmetic in polynomial rings, which is a bit different from arithmetic in modular integers. In the NTRU cryptosystem, the public key $h$ is ...
Tobsec's user avatar
  • 23
0 votes
0 answers
69 views

Security of the trivium stream cipher

So I've been trying to implement a Non-Deterministic RBG based on randomness polling from non-hardware sources (nothing novel, just a side-project). Since collecting entropy and further conditioning ...
vibhav950's user avatar
0 votes
0 answers
33 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 ...
yael's user avatar
  • 1
1 vote
1 answer
118 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 ...
zhengyuansu's user avatar
0 votes
0 answers
149 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 ...
nomad.lw's user avatar
0 votes
0 answers
50 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, Φ)=...
Srity Ahmed's user avatar
0 votes
1 answer
132 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 ...
r j's user avatar
  • 101
1 vote
2 answers
132 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 ...
Muhammad Ikhwan Perwira's user avatar
0 votes
1 answer
83 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 ...
Alexander Magyari's user avatar
0 votes
1 answer
393 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
james's user avatar
  • 1
0 votes
1 answer
218 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 &...
MaXbeMan's user avatar
0 votes
1 answer
166 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, ...
Sukru's user avatar
  • 11
3 votes
1 answer
516 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 ...
user10433098's user avatar
7 votes
1 answer
294 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 ...
user109261's user avatar
1 vote
1 answer
1k 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-...
Uwe Kohl's user avatar
2 votes
2 answers
78 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 ...
Michael Hammer's user avatar
4 votes
1 answer
1k 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 ...
Uwe Kohl's user avatar
0 votes
1 answer
151 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....
SN-Grotesque's user avatar
1 vote
2 answers
77 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: ...
Javier Albarracin's user avatar
1 vote
0 answers
102 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 ...
rouguex's user avatar
  • 11
4 votes
1 answer
105 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 ...
Ali Haktan German's user avatar
2 votes
0 answers
69 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 ...
werki's user avatar
  • 21
5 votes
1 answer
194 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 ...
crypt's user avatar
  • 2,449
1 vote
0 answers
24 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 ...
ubiquibacon's user avatar
7 votes
1 answer
404 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}$. ...
fgrieu's user avatar
  • 142k
1 vote
0 answers
100 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?
Shi Li's user avatar
  • 13
2 votes
1 answer
85 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 ...
gx16's user avatar
  • 45
2 votes
0 answers
136 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. ...
Haidepzai's user avatar
  • 121
1 vote
0 answers
69 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, ...
joxavy's user avatar
  • 11
1 vote
1 answer
110 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 ...
heduncook's user avatar
1 vote
0 answers
42 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 ...
seeker58's user avatar
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 ...
SamTest's user avatar
  • 157
0 votes
1 answer
10k 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 ...
thanks_in_advance's user avatar
0 votes
1 answer
42 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 ...
Quantum Guy 123's user avatar
0 votes
1 answer
44 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 ...
Edward's user avatar
  • 1