Stack Exchange Network

Stack Exchange network consists of 175 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.

Visit Stack Exchange

Questions tagged [keys]

Private and secret keys consists of secret information used as input to various kinds of cryptographic algorithms such as encryption, signature and MAC to select the concrete transformation done by the algorithm.

0
votes
0answers
33 views

how to conver a raw public key to DER or PEM? [on hold]

Looking for a way to convert a raw key to DER or PEM format. below is the ECDSA(p256) public key which needs to be converted to PEM format or dER. ...
2
votes
1answer
27 views

LoRaWAN 1.0.2 Session Key Security

I am reading about LoRaWAN 1.0.2 specification. For the confidentiality and integrity of the comunication the protocol generate two session keys, the NwkSKey and the AppSKey (part 6.2.5 of the ...
0
votes
1answer
63 views

Do Carmichael's and Euler's totient functions in RSA generate the same keys?

Starting with the same primes $p$ and $q$ to generate $n=pq$, will Carmichael's totient function and Euler's totient function give the same public key ($e,n$) and private key ($d,n$) in RSA encryption?...
1
vote
1answer
61 views

Picking 'e' for RSA encryption

What is the reason behind picking either $3$ or $2^{16}+1$ for generating the public key in RSA?
0
votes
1answer
56 views

Encrypt multiple RSA keys with same passphrase

I have to create and store a bunch of RSA key pairs with openssl. The private keys will be encrypted with the aes256 option and a very long, random password. Would it be safe to use the same password ...
4
votes
0answers
70 views
+50

AES reverse Rijndael key schedule with decryption round keys

I want to get the original encryption key (32 byte) of AES 256 (CBC) implementation. The implementation has the values of the inversed round keys values hard coded into the decryption function. I ...
1
vote
1answer
61 views

What are the separate single DES keys from a triple DES key?

Suppose my 192 bit triple DES key (in hex) is 0123456789ABCDEFFEDCBA987654321089ABCDEF01234567 What are the keys for the separate single DES operations? In this ...
4
votes
3answers
538 views

Why does OpenSSL differentiate between PSS and non-PSS for private key generation?

RSA-PSS private keys The following command will generate an RSA-PSS private key: ...
0
votes
1answer
36 views

How to prevent Public Key from being replaced entirely?

I am using RSA to sign my license file using Microsoft CNG API. I am signing the license file and sending the file with the <...
1
vote
0answers
37 views

Acceptable points of failure when applying encryption in an application [on hold]

I am working an a Windows application that will encrypt and decrypt files using AES Encryption. The 32 byte key which is diversified and derived using a ATSHA204 unique serial number and some addition ...
0
votes
2answers
61 views

Purpose of key evolution?

When generating and exchanging keys, what is the purpose of performing key evolution after public key exchange + authenticated encryption?
0
votes
1answer
34 views

IVs in WEP encryption

I'll start of by saying I am pretty new to the world of encryption,from my understanding the plain text along with a crc is exclusively or'd with the IV and the key( or more accurately the key/stream ...
-1
votes
2answers
63 views

How to find at least one private key from a large list of compressed public keys secp256k1

Not long ago I saw a discussion on the Bitcoin Talk forum: https://bitcointalk.org/index.php?topic=5060735.msg50736695#msg50736695 Please give advice and working methods? Is it possible to find at ...
1
vote
0answers
50 views

Are there a way to progress or age key pairs

I am searching for a way to make the noise X pattern fully forward secret. The X pattern is a way to encrypted and authenticated messages. As a building block to achieve this I started pondering if ...
0
votes
0answers
22 views

Minimal secure index of quasi-cyclic codes for code-based cryptography

It is well-known that keys (generator matrices) of code-based cryptography are very large for its practical usage. To reduce them scientists propose to use families of quasi-cyclic codes. I remind ...
0
votes
0answers
68 views

Is it possible to recover the key to a decrypted file? [duplicate]

Is it possible to recover the key to a decrypted file if you have the initialization vector and it uses RijndaelManaged in CBC mode? If so how? The file I want to recover the key from is a xml that ...
0
votes
2answers
67 views

How to understand Authenticated Key Exchange?

I am reading some articles about Key Exchange. I know classic key exchange,such as Diffie-Hellman key Exchange. This type algorithm is vulnerable to man-in-the-middle attack. However, When using ...
0
votes
1answer
72 views

Euler's totient function and Carmichael's totient function in RSA [duplicate]

I'm a high school student taking IB and I'm doing my EE on Maths, more specifically on the effectiveness of Euler's totient function and Carmichael's totient function in RSA. Am I right in thinking ...
0
votes
2answers
48 views

cryptographically signed streaming data

On a high level the question is: how does one cryptographically sign streaming data? Here is the context: a number of people are continuously streaming data to me the data is public and does not ...
1
vote
0answers
61 views

If 1 can be a random number in Diffie-Hellman Algorithm

I've done some calculations and Diffie-Hellman Algorithm worked for all chosen random numbers except $1$. In the description of the algorithm, I can't find information that the random number has to be ...
0
votes
1answer
249 views

Can not use big prime number for pair of key of RSA Algorithm [closed]

I'm new to cryptography. I have a binary image with 64x64 pixel in size. I perform an encryption to the image using RSA Algorithm. I wanna ask something bothering me, why can I not use big prime ...
1
vote
1answer
115 views

What is the Risk of Rotating Keys

This may be a difficult question So, $C_1$ = AES-GCM($k_1$, nonce, message) where nonce = HMAC(key,message). $C_2$ = AES-CBC($k_2$, iv, $C_1$). Now, a security breach occurs. The adversary obtains ...
1
vote
1answer
38 views

Private key not used in a signature scheme

I'm trying to understand the following signature scheme (Camenisch-Lysanskaya): Key generation: $n = pq$ special RSA modulus, $a, b, c \in QR_n$. $PK = (n, a, b, c), SK = p$. Signing algorithm: $m$ ...
0
votes
1answer
39 views

How to multiply two Public Keys in Elliptic Curve in Go

I am working on a messaging client similar to Signal. I am stuck on implementing Tripartite Diffie-Hellman handshake in which three DH exchanges are combined to authenticate both parties and produce ...
0
votes
2answers
179 views

How is EC key encoded in PKCS#8?

I just started working with certificates and signatures. For an application I write I need a key pair for ECDSA signatures, using the elliptic curve secp384r1 (aka NIST P-384). I produced such a key ...
3
votes
2answers
140 views

How to generate a good symmetric secret key

I would like to generate a good secret key, that later will be used to encrypt data symmetrically. I am not sure how to generate a good secret key. I use Linux, I am not sure which sources of ...
0
votes
0answers
40 views

Problem in generation of keys in KP-ABE

In KP-ABE the owner encrypts the message using attributes say a'. The Attribute authority(AA) designs an access structure and implants that access structure in keys generated by AA for the user. So, ...
0
votes
0answers
36 views

Aes brute force when part of data known [duplicate]

I have buffer of 16 bytes that encrypt with AES 128 cbc with IV =000000......(all IV is 0) I have the encrypted buffer, and I know 7 bytes from 16 bytes before the encryption , I dont know the key . ...
4
votes
1answer
123 views

Why derive keys from a master key instead of generating random keys?

I noticed AWS KMS generates encryption keys based off of a master key, using a key derivation function (HKDF). What's the practical advantage of deriving keys based on a master key? Isn't it simpler ...
0
votes
1answer
77 views

How 'safe' is a 12-digit alphanumeric key?

To Access my data over a Portal i got a 12-digit alphanumeric key like: VGW8-U98T-TXLV How safe is this key? I don't want to know the chance to win with brute force. I want to know there are several ...
0
votes
1answer
64 views

How to find a triple of keys that maps plaintext to given cipherext using EDE

What is a practical method for for finding a triple of keys that maps a given plaintext to a given ciphertext using EDE? I think this requires something similar to a man-in-the-middle attack...
0
votes
1answer
122 views

Encryption: am I doing it right?

I'm trying to get a per-user encryption key scheme off the ground and need some validation from wiser crypto pros. Consider the following procedure: User provides registration information to include ...
3
votes
2answers
137 views

Which hash is used when providing signature algorithm ED25519 or ED448?

From TLS 1.3 there are two signature algorithms using edDSA: /* EdDSA algorithms */ ed25519(0x0807), ed448(0x0808), All the other signature-...
2
votes
3answers
159 views

Low entropy - how does it compromise the crypto

One of the often pointed out mistake in dealing with crypto is not having enough entropy in the system. Without enough entropy the random numbers generated are not random enough. But what I am not ...
3
votes
1answer
75 views

Definition of symmetric cipher and definition of asymmetric cipher

So I'm currently taking a cryptography class right now and my professor has told the class that she can't even define symmetric cipher for us without getting into asymmetric ciphers and the textbook ...
4
votes
1answer
122 views

$\boxplus$- key addition vs $\oplus$- key addition

GOST cipher , Hight cipher and SEA cipher use key addition based on modular arithmetic addition (module key size $\boxplus$) compared to many ciphers which use arithmetic addition modulo 2 ( $\oplus$)....
0
votes
0answers
47 views

Chameleon hashes as encryption keys

I'm a newbie to cryptography and I have been wondering about the possibility of using Chameleon hashes as symmetric encryption keys. Here is my scenario and my thought process: Let us consider a ...
0
votes
0answers
74 views

Yukel's Sieve - Factorization of Numbers into a Square Sieve

https://www.youtube.com/watch?v=liTTGeitpGQ https://www.youtube.com/watch?v=2nOwgiweyqc https://www.youtube.com/watch?v=rGwFsOG27DQ I came across these videos explaining a pattern that is found in ...
3
votes
1answer
84 views

In NIST modulus and key size recommendations is `group` equivalent to modulus and `key` equivalent to exponent?

Looking at the following NIST recommendations for a discrete logarithm, for 2016-2030 and beyond they list 3072-bit number for the group and 256-bit for the ...
6
votes
0answers
69 views

Offline Group Key Agreement - Cross Device Syncing

I have a specific use case I am interested in. I have spent the better part of the night reading research papers. I am beginning to believe what I want is not possible so I wanted to confirm here. ...
0
votes
1answer
101 views

What is the difference between static and dynamic tokens?

First, what is the difference between hardware and software tokens? Tokens are "what you have" for example a car key or a chipcard. This would be (I think) hardware tokens? But what are software ...
2
votes
1answer
54 views

Emphemeral key creation from a long term shared secret (without DH)

Assuming I cannot use DH scheme, and the long term key is known to both sides, is there a known algorithm / standard that defines how to derive a short term key from a long term key?
2
votes
1answer
69 views

The key size of an ideal block cipher

My understanding of an ideal block cipher is as follows: For a block cipher with block size $n$, there are $2^n$ possible plaintexts. The number of possible keys (mappings) would then be $2^n!$. ...
7
votes
1answer
100 views

How complex must round constants be to resist slide attacks?

A key schedule that generates round keys by XORing a round constant with the key is linear and can be vulnerable to related key attacks, but let's ignore that for now. Constants are necessary to avoid ...
5
votes
1answer
772 views

What is a related key?

We talk of related keys and related key attacks, but what is a 'related key'? So in three related parts:- How can one key be related to another key? Is there a metric describing the degree of ...
1
vote
1answer
62 views

While using onetime encryption is it possible that one can deduce the key of a message if the contents of the message are already known?

Let's say we have a randomly encrypted message and I pasted the contents of that message on a blog for some reason I do not share the key. Would you be able to figure out the key? This is the ...
2
votes
2answers
106 views

Does libsodium sealed box leak key ids?

I am using python and libnacl, which is a libsodium wrapper, to develop an application where users can deposit encrypted data. Alice uses ...
1
vote
2answers
79 views

Why is a smaller value preferred for the public key in RSA?

For my practice implementation of the RSA cryptosystem I use a random value generation function such the value of public key e holds: The public exponent $e$ and the modulus $n$ should be $e<\phi(...
6
votes
1answer
156 views

How does Twofish avoid weak keys if it uses key-dependent S-boxes?

From section 7.2.2 of the Twofish paper, the four S-boxes for the 128-bit cipher are generated with: $$\begin{align} s_0(x) &= q_1[q_0[q_0[x] \oplus s_{0,0}] \oplus s_{1,0}]\\ s_1(x) &= q_0[...
1
vote
1answer
60 views

Key, plaintext block and ciphertext block permutations question

Question: If a cipher’s key size is $k$ bits and its block size is $b$ bits, how many possible keys are there, how many possible plaintext blocks are there, and how many possible ciphertext blocks are ...