Questions tagged [key-generation]

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

Filter by
Sorted by
Tagged with
0
votes
3answers
56 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 ...
1
vote
1answer
53 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 ...
0
votes
2answers
78 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 ...
1
vote
0answers
25 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 ...
1
vote
2answers
592 views

Recovery Passphrase Collission for BIP-39 and BIP-44

Referring to the standards of [BIP-39] and [BIP-44]: a 'master password' consisting of 12 words uniformly selected from a 2048-word dictionary corresponds to 128 bits of entropy, that is then used as ...
0
votes
1answer
45 views

Generate asymmetric key pairs based on keywords such that any public key based on set containing the generating subset is valid

Let's assume we have a ton of users, and each user has a list of fruits they like - Those will be keywords. I want my users to be able to encode any data they store (Let's say, the location of their ...
2
votes
2answers
89 views
0
votes
0answers
34 views

Questions about Blake2x: Its state size (internal state) and its security when generating keys with size more than 256/512bits

I read the Blake2x paper: https://www.blake2.net/blake2x.pdf It says Blake2x can be used to build a "DRBG" (CSPRNG): https://csrc.nist.gov/glossary/term/deterministic_random_bit_generator &...
1
vote
1answer
48 views

AWS IoT - Unique Keys per each device - Data encryption

(Probably not the right board to ask. But here goes) I'm designing an IoT Solution with RPi as client and AWS as the server. On the client hardware, I have an Security Chip that can securely generate ...
1
vote
0answers
56 views

Hashing function: Generate unique 3 letters Identifier [closed]

I need to create an id generation function that takes 4-digit number and returns a unique 3-letter identifier. I already have a function that generates a 2-letter id from 3-digit number with some ...
0
votes
1answer
40 views

Issues generating keys/cyclic group for Cramer-Shoup Cryptosystem with OpenSSL

I'm trying to implement a Cramer Shoup cryptography system in C but I've run into problems with generating the keys. From what I have found on the wiki and in other papers, to generate keys for Cramer ...
2
votes
2answers
145 views

How is Argon2 used for key derivation? [duplicate]

By my understanding, a key derivation is when you take some data, say a password, and use a function to convert it into a number that can be used as a secret key in say elliptic curve cryptography. ...
0
votes
0answers
41 views

How to decompose a public key into subgroups EC?

Is it possible to decompose the public key into its own subgroups? Suppose we know the order P with which the public key was generated ...
1
vote
1answer
134 views

RSA key generation: why use lcm(p-1, q-1) instead of the totient ϕ(n)?

As far as I can see, generating a private key from two prime numbers p and q, having calculated ...
1
vote
1answer
72 views

HMAC key generation and encoding

I've this piece of .NET code that is based on a Microsoft sample on how to generate a key and sign using HMACSH256. But I've altered the key generation a little bit and also decided to use Base64 to ...
0
votes
0answers
27 views

Is it safe to use the same seed phrase for different cryptocurrency protocols

I want to use the same seed phrase for severl cryptocoins (Bticoin, Ethereum, Nano, etc.). I understand that each protocol has its own phrase length and possibly a different way of generating the ...
0
votes
0answers
23 views

How can I change the McEliece main parameters?

I use the Bouncy Castle Crypto API to implement McEliece in Java. I have also managed to encrypt and decrypt a message and it works without any problems. When I use the debugger, I see that the ...
0
votes
0answers
81 views

How to generate private SSH RSA key from given primes?

I have two primes and public exponent. How I can generate private key with this values and "ssh-rsa" format?
11
votes
3answers
7k views

Are all possible EC private keys valid?

I usually generate a key pair using OpenSSL or Bouncy Castle. I'm using curve secp256k1. The 256bit private keys look fairly random. Do all values of "private ...
7
votes
4answers
2k views

Can we pick which key is private or public in asymmetric encryption? Do the keys actually encrypt and decrypt a cipher text?

Could you help me better understand how the key-pair works in Asymmetric encryption? I'm studying cryptography at the surface level first. While reading multiple texts and talking with colleagues I'm ...
0
votes
1answer
45 views

Necessity of PBKDF2 in current Setup?

I have a single password which is random bytes that encrypts a database. Right now I am using an encryption scheme of https://gist.github.com/jbtule/4336842. To summarize, we take our one password, ...
1
vote
0answers
75 views

Encryption of data with multiple possible decryption keys

I'm new to the Cryptography Stack Exchange, so my question might be very naive. What encryption algorithms are out there that will allow different decryption keys to decrypt the same piece of ...
1
vote
2answers
172 views

Concatenating "words," is it possible to create a key that is indistinguishable from one made in a truly random manner?

By concatenating "words" and adding them Modulo 26, can a key be created that is indistinguishable from one generated in a truly random manner? Let's say the key is more than about ten ...
0
votes
0answers
60 views

Design an algorithm to generate random session key

good day. I am asked to design the a simple algorithm to generate random session key id of block length of 8 and change continuously every time it refreshes. Is there any simple algorithm to create ...
2
votes
1answer
413 views

How is it possible to derive the public exponent from an RSA private key?

I am gonna write down formulas that I know and use to generate RSA keys. we choose $p$, $q$ $N = p\cdot q$ $\varphi(n) = (p-1)\cdot(q-1)$ choose $e$ such as $1 < e < \varphi(N)$ $e$ is coprime ...
0
votes
1answer
49 views

When using prime factorization for key gen, is there a limit on the size of the prime factors?

If there is a limit, does that leave a limited number of prime numbers that can be used for key gen? And, if that is the case is the encryption system vulnerable?
1
vote
2answers
73 views

What is this meaning disconnected from processes performing key generation or zeroization in cryptography modu

In FIPS 140-2 Part 2:Interfaces and Port in the security policy of product told : 1- "the output data path is provided by the data interfaces and is logically disconnected from processes ...
1
vote
1answer
80 views

Gennaro & Goldfeder Key Generation Protocol

As I am going through the “Fast Multiparty Threshold ECDSA with Fast Trustless Setup” paper by Gennaro & Goldfeder, 2018, I am stumbled by the key generation protocol (Sect. 4.1, p.10): In Phase ...
1
vote
1answer
67 views

How feasible is it to guess the private key of libsodium by taking into account generation time?

So suppose you are doing this locally (so no network noise), and know the exact specifics of your processor too. Is it feasible to figure out the private key (while having access to the public-key) ...
0
votes
1answer
46 views

RSA encryption key conditions

I recently read the RSA cryptosystem but now I confused in key generation phase. According to the Euler's Theorem, we have just one condition: e.d = k.ϕ(N) + 1 where: "e" is encryption ...
2
votes
0answers
501 views

What does it mean for “1^n”(i.e., the security parameter written in unary)? [duplicate]

As it is mentioned above, I am confused about “Gen takes as input $1^n$ and outputs a key“. Does it mean that the input of Gen is 1111....111 with length of n?
2
votes
0answers
140 views

Kleptographic attack of ECDSA key generation?

Kleptographic attacks can be designed for RSA key generation, Diffie–Hellman key exchange, DSA/ECDSA signing, etc. Is it also possible for ECDSA key generation? More detailed: Is it possible for an ...
2
votes
2answers
179 views

How many low-order bits of an RSA modulus can we safely fix to 1?

It's easy to generate an RSA modulus $n=p\,q$ of $k$ bits with $n\equiv-1\pmod{2^\ell}$, for $\ell$ up to about $k/2$: we can choose $p$ as usual, fix the $\ell$ low-order bits of $q$ to $-p^{-1}\...
1
vote
0answers
44 views

Secret key generation in the BGV scheme in HElib

This question is about secret key generation, based on section 4.7 in the design document: https://homenc.github.io/HElib/documentation/Design_Document/HElib-design.pdf It seems that if $m$ is not a ...
0
votes
0answers
30 views

Symmetric and Asymmetric indistinguishabilty experiment

In each of those experiments, we have a function $Gen(x)$ who generates the key or a pair of keys respectively for symmetric or asymmetric algorithms. $x = 1^n$ : I read on other questions that is a $...
6
votes
1answer
139 views

Schnorr groups allowing fast modular reduction, vs GNFS

I'm looking for Schnorr groups allowing fast modular reduction. Say, using the notation in DSA, with 256-bit prime $q$ and 3072-bit prime $p$, and $p\equiv1\pmod q$. Are there standards, RFC, or other ...
1
vote
1answer
140 views

NTRU Euclidean algorithm the inverse of f modulo p

I am very new to the world of cryptography and have just began my research in the post quantum cryptography sector. I have been reading and trying to understand NTRU key generation and am struggling ...
0
votes
2answers
315 views

Diffie-Hellman key generation

We all see X509 certificates with 2048/4096-bit RSA key pairs; however, it is difficult to understand how they work in the DH part of the TLS handshake. At most, they authenticate and sign. DH 4096-...
0
votes
1answer
95 views

How to correctly (good practice) generate gpg keys in batch mode (unattended) WITH a passphrase

I'm writing a web interface in PHP to generate keys. I'm familiar with gpg's command line options, particularly --batch. I'm also familiar with PHP's GnuPG API. I can't find a way to safely pass the ...
0
votes
0answers
51 views

SHA3_512 as dynamic SBOX generator

I'm creating a substitution-permutation cipher (for learning purposes only of course) and I'd like to implement dynamic SBOXs. The cipher will have a block size of 128, and 32 rounds. These SBOXs will ...
-2
votes
1answer
144 views

An attempt at using AES as a stream cipher

You have a 2048 bit private key, which is 2,048 randomly generated bits. It is not an RSA or ECC key. It is the master key that is used for every message. You receive a message to encrypt and ...
3
votes
0answers
150 views

Criteria for public modulus of RSA accumulator

What are criteria for generation of an RSA public modulus used in an RSA accumulator, and their rationale? Are there special requirements in some sub-cases, like for «one-way» accumulators? Josh ...
2
votes
0answers
56 views

Threshold lower than $\dfrac{n}{2}$ in distributed key generation

While I was studying protocols for distributed key generation with malicious adversaries, Gennaro et al.$^{[1]}$ pointed out that the protocols that provide both secrecy and robustness should have a ...
3
votes
2answers
408 views

Formula for bits of entropy per bit, when combining bits with XOR

Assume that bits $A$ and $B$ each have .5 bits of entropy per bit. The two-bit result of the concatenation $A‖B$ has 1 bit of entropy total, and it retains the entropy density of .5 bits of entropy ...
1
vote
1answer
112 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?
4
votes
1answer
134 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
108 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
171 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 ...
1
vote
2answers
459 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 ...
3
votes
1answer
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$) ...