usually secret information used as input to various kinds of cryptographic algorithms, like encryption, signature, MAC, to select the concrete transformation done by the algorithm.

learn more… | top users | synonyms

-1
votes
0answers
18 views

How to write automaticaly server generated keys into a file? [on hold]

There have a server program, which generate keys for client. I want to store these keys into a file. I implemented the server and client program in python.. When server run each time for a user, the ...
5
votes
1answer
378 views

Dan Boneh's Cryptography lecture - problem with 802.11b

I am going through Dan Boneh's Cyprography lectures on Coursera. In Lecture 6 https://class.coursera.org/crypto-010/lecture/6 At 7:30 minutes, he discusses the problems with 802.11b design. I ...
4
votes
3answers
526 views

Why does an algorithm need a keyspace?

Why does an algorithm need a keyspace? I thought the person encrypting would define his/her own key.
1
vote
1answer
129 views

Discrete Logarithm (512 bits numbers) - Find exponent parameter

I'm trying to resolve a discrete logarithm equation: $$y = g^x \bmod p$$ Every parameter is a 512-bit number. I know the values for $g$, $y$ and $p$ and I need to find the $x$ value. Finally, I know ...
0
votes
1answer
33 views

How are subkeys, in Feistel block ciphers, derived for each round?

I'm bit confused about the subkeys that are used in Feistel ciphers. I know that all the subkeys ki are derived from the main key K, but how? Say I have a simplified Feistel block cipher of i rounds, ...
-1
votes
1answer
26 views

Cardinality of the key space $\{0,1\}^\ell$

Imagine we have a scheme whose key is chosen from the set $\{0,1\}^\ell$. My question is: What is the size of key space for this scheme?
0
votes
2answers
66 views

Brute Force on Key

If you are brute forcing a key and trying trillions of combos, how will you know when you accidentally hit the right answer? Clearly you can't look at each decoded answer to see which "looks right".
1
vote
1answer
57 views

Encryption through multiplication of encoded key [closed]

Yesterday I finished programming my own encryption program. It is using an input and a key. Here are all the steps it is going through. For an example, let say the ...
0
votes
4answers
186 views

Why don’t all AES encryption tools produce the same key from the same password?

Alice and Bob meet regularly. They have agreed face-to-face a 128 bit password which they want use to encrypt/decrypt emails written between them. They decide to use 256-bit AES. Alice wrote her ...
0
votes
1answer
43 views

How to calculate RSA CRT parameters from public key and private exponent

Given the public key (n, e) and private exponent (d), how to calculate CRT parameters (p, q, dP, dQ, and qInv) of this RSA key pair?
2
votes
1answer
42 views

Compacting a substitution cipher key

In a substitution cipher, I recieve 3 bits and than I return another 3 bits. The key of this cipher could be a matrix represented as: ...
-3
votes
1answer
65 views

XOR = Best encryption? [duplicate]

If you have a TRULY random key (in binary) and you have a text (in binary) that you want to encrypt. Can you simple XOR the key and the text? Is that secure? How secure?
2
votes
1answer
59 views

Key Check Value standard pratice for asymetric cryptography?

I'm looking for a standard, or sound industry practice, for the equivalent of a Key Check Value, applied to the private key of a public key algorithm, like ECDSA. For DES or 3DES keys, practice (as ...
1
vote
0answers
39 views

Proper way to generate symmetric keys

I'm trying to educate my self in key management, how to store them, how to generate them, how to use them properly. I've been trying to find how you would generate a key for symmetric encryption (say ...
2
votes
4answers
70 views

Definition of the term “key”

I've looked in many places (NIST, text books, online resources) and I cannot find an answer to the definition of the term "key" from a semantic point of view. Is it the "key" to cipher-texts (i.e. ...
0
votes
0answers
34 views

Generating interactive, secure multiple ECC key pairs deterministically

In Elliptic Curve Cryptography (ECC) assuming user A has a private public key pair of $S$, $P$ accordingly with generator point $G$ which as we know is: $$P=S*G$$ Assuming that user A wants to ...
1
vote
2answers
45 views

correct usage of keys and nonce

I've being studying up on AES, GCM, CBC, HMAC and a lot of other primitives and am somewhat ( a little bit, perhaps) familiar with them however I am still a bit weary on the use of the keys and nonce. ...
3
votes
2answers
188 views

Key space vs Cardinality of 1024-bit RSA

I have been trying to figure out the encryption key space, and cardinality of 1024-bit RSA. From my understanding, the key generated from 1024-bit will be primes greater than $2^{1023}$ but less than ...
0
votes
1answer
57 views

Are keys generated by the user or block cipher algorithms themselves? [closed]

We know block cipher algorithms. In the block cipher algorithms, Key Scheduling is the one crucial part. I see that in some simulation programs of the AES,DES,TripleDES encryption algorithms. In ...
0
votes
1answer
71 views

RSA modulus (N) from public key and calculating N from p, q not equal [closed]

I have a RSA public key in the form of public exponent and modulus as follows: ...
-3
votes
1answer
79 views

OTP - Reuse key BUT add IV, is it secure enough?

EDIT: REUSING KEY IS SECURE! OTP - Reusing key IS SECURE! PROVED! I have already asked a similar question and now I can continue to this question about adding a "extra key" = IV. My last question ...
-3
votes
1answer
96 views

OTP - Why not reuse key? EDITED! [duplicate]

EDIT: REUSING KEY IS SECURE! OTP - Reusing key IS SECURE! PROVED! This might sound really dumb but why is it bad/insecure too use the same key twice on One-time-pad? Question: Why and how does using ...
0
votes
1answer
75 views

What is the proper way to generate a fixed length key from a variable length password?

The password is entered by the user and the key is processed locally. Neither the password nor the key will be stored, only used and forgotten (but hopefully not by the user). Is SHA256 by itself ...
1
vote
2answers
132 views

Prove that if we redefine the key space, we can assume Gen chooses a key uniformly

I am working on problem 2.1 in Introduction to Modern Cryptography 2nd edition by Katz and Lindell. 2.1) Prove that by redefining the key space, we may assume that the key generation algorithm ...
0
votes
0answers
14 views

Keystore and configuration file

It appears that Java Keystore is often used by web server using a configuration file, with the password opening the JKS written in it and also the password protecting the specific entry. How could ...
1
vote
1answer
153 views

Key sizes supported by 3DES

I read about 3DES encryption but I don't understand exactly what the specific meaning of key size is. For example I found that 3DES supports 64, 128, 192, and 256 bits key size. What are all the ...
0
votes
1answer
55 views

HMAC tag to verify the key (verification in the reverse direction)

A quick question. Are there any problems with the following HMAC use-case: We have two entities ($A$ and $B$), both of them have a secret ($A$ has $S_0$ and $B$ has $S_1$) $A$ generates a random ...
1
vote
0answers
49 views

AES-128/192 safer than AES-256 in practice? [duplicate]

Related-key attacks can break AES-192 and AES-256 with complexities 2^176 and 2^99.5, respectively. Quote from: http://en.wikipedia.org/wiki/Advanced_Encryption_Standard It seems that more ...
0
votes
1answer
59 views

Linear Recurrence, keystreams, and periods

I am trying to understand the following problem: Consider the following linear recurrence over $Z_2$ of degree four: $z_{i+4} = (z_{i+3} + z_{i+2} + z_{i+1} + z_{i}) \bmod 2$ i >= 0. ...
4
votes
0answers
90 views

Anonymisation resilient to key leak

Problem statement Elbonian citizens have been issued a card holding a random $B_j\in\{0,1\}^b$, $0\le j<2^n$, $b\ge n+20$ (representative example $b=64$, $n=28$). The habit has grown to use this ...
1
vote
1answer
54 views

LUKS multiple key slots - what's the intuition?

LUKS volumes have the ability to allow multiple independently usable passwords, as explained here: [https://code.google.com/p/cryptsetup/wiki/FrequentlyAskedQuestions] The intuition behind basic ...
2
votes
2answers
211 views

Key Length vs KeySpace

I am a newbie here, this is my first post. I have searched the forum but I haven't found a clear answer to this. In general. What is the relationship between key length and the keyspace? (if there ...
1
vote
2answers
172 views

Given infinite unencrypted and encrypted texts, can I find the algorithm?

Given an infinite amount of both unencrypted and the corresponding encrypted text, would I be able to calculate the algorithm? I am relative new to cryptography and don't know if I would be able to ...
1
vote
1answer
76 views

Questions about updating the secret key of RSA?

I want to update the secret key of RSA. I understand there exists a common modular attack on RSA. Precisely, if adversary knows $(e_1, m^{e_1})$ and $(e_2, m^{e_2})$, where $e_1$ and $e_2$ are the ...
4
votes
2answers
332 views

1 Billion Bit Encryption?

So, browsing through YouTube, I stumbled on this video interview of John Draper (Captain Crunch), one of the first "hackers". He talks for about 3 minutes (until 27:48) about his home rolled ...
0
votes
0answers
46 views

Problem in understanding Blakley's Secret Sharing Scheme

I need to implement Blakley's Secret Sharing Scheme. I have read below mentioned two research papers but still unable to understand how to implement it. Safeguarding cryptographic keys Two Matrices ...
0
votes
3answers
75 views

private keys for multiple devices [closed]

I have an architecture where: a user can have multiple devices (phones) the server needs to broadcast the payload to all devices through the same channel (basically, all devices listen and receive ...
1
vote
1answer
33 views

Question about key verification

I am studying for network security exam. And in the slide about Key Management, under a heading Key Verification I see this: Key Verification Almost all cryptographic algorithms have some weak keys ...
1
vote
1answer
110 views

Transforming a key into a seed with the most entropy

I'm making a very simple encrypter in C# which is basically a Stream cipher. The user enters a key(password), converted to a seed for a pseudo-random generator, and the pseudo-random generator ...
0
votes
0answers
40 views

Modifying algebraic secrecy message to use digital certificates

I have the following message: sign((M’, T$_A$, sign((encrypt((encrypt(M, $K_{pbB}$), M’), K), T$_B$), $K_{sB}$)), $K_{sA}$) Sign is used for signature generation. Encrypt is used for ...
1
vote
1answer
103 views

Attacker in a key exchange

I'm having trouble with the following question: $X(A) \rightarrow B:(A,N_X)$ $B \rightarrow X(S):(B,((A,N_X,T_B),K_{BS}),N_B)$ $X(A) \rightarrow B:(((A,N_X,T_B),K_{BS}),(N_B,N_X))$ ...
3
votes
2answers
132 views

Block size vs key size confusion

I understand that if a block cipher has $k$-bit keys and $n$-bit input/output blocks, then if $k>n$, we can expect one message-ciphertext pair to narrow us down (I think?) to $2^{k-n}$ possible ...
0
votes
0answers
40 views

DES key complementation property [duplicate]

It is known that DES has the key-complementation property. That is, given any key $k$ and any message $m\in\{0,1\}^{64}$ $$\operatorname{DES}_k(m)=\overline{\operatorname{DES}_\overline k(\overline ...
1
vote
1answer
50 views

What is the functional role of CKY-I and CKY-R in ISAKMP (IKEv1)?

According to RFC 2409: CKY-I and CKY-R are the Initiator's cookie and the Responder's cookie, respectively, from the ISAKMP header. Each CKY is a 64 bit value that is included in each ISAKMP ...
1
vote
1answer
82 views

Many single-time use keys encryption scheme (not Shamir's Shared Secret)

I'm looking for encryption scheme with the following properties: There's a sequence of keys that can be used to decrypt the message Strictly only one key from the sequence is required to decrypt the ...
-1
votes
1answer
66 views

How to use the key from a Diffie Hellman exchange? [closed]

I watched a YouTube video about Diffie-Hellman called "Diffie-Hellman Key Exchange", and it said after doing some modulo operations with the public modulus and generator and the random private ...
1
vote
1answer
63 views

Key escrow on indistinguishability games

Does it mean that when PPT attacker is breaking an indistinguishable based (equivalent with semantic security) game with non negligible probability that he is able to infer the secret keys either on ...
0
votes
0answers
57 views

How are key length and size of group elements related?

I am reading a paper on ring signature where the author has mentioned a correlation between key length requirement and size of group elements. Can anyone hint me how he arrived at this conclusion out ...
2
votes
1answer
229 views

Generation of N bit prime numbers -> what is the actual range?

Short version: When generating a prime number of N bits, should I draw random numbers from the range $[0 , 2^n]$, or $[2^{(n-1)} , 2^n]$? Context: I'm trying to implement a toy-version of RSA as a ...
1
vote
2answers
409 views

Key management for military GPS receivers

I wonder what encryption scheme is used in high-precision encrypted GPS streams (the so-called “P(Y) code”). If there's a master key needed, then it has to be in every device. Yet the master key ...