All Questions

Filter by
Sorted by
Tagged with
5 votes
1 answer
3k views

Can we trust digital signatures?

Consider that Alice wants to send a digitally signed message to Bob. Mallory might be able to publish his public key under Alice's name and then impersonate Alice to send a message with an apparently ...
kim's user avatar
  • 51
3 votes
1 answer
226 views

Format of NONCE in Initialization Vector (IV)

When we talk about a Number used ONCE (NONCE) in Initialization Vector (IV), is it required to use numbers only? Is is possible to use letters or special characters?
goldroger's user avatar
  • 1,737
25 votes
3 answers
974 views

What differentiates a password hash from a cryptographic hash besides speed?

I understand that password hashes like bcrypt have the principal property of taking a long time to run, but I'm wondering what if anything about password hashes make them superior to merely running a ...
Steven's user avatar
  • 353
5 votes
2 answers
3k views

Encryption with private key?

we normally always encrypt by public key and decrypt with private key. If i encrypt with private key, then its still secure as normal PKI ? i mean known-plain-text will not take private key on the ...
Edward's user avatar
  • 51
4 votes
1 answer
2k views

RSA algorithm's license free or paid?

I checked RSA's patent application, which was registered in 1983. As patents don't last more than 20 years, it seems to me it should be free. But my friend said to use RSA I have to buy a license from ...
samir's user avatar
  • 41
3 votes
1 answer
493 views

Do Quantum Key Distribution and Physical Unclonable Functions combine, and how?

I see there's a project to combine Quantum Key Distribution, Physical Unclonable Functions, and classical crypto, in order to secure a high speed (100Gb/s) optical link. While there does not seem to ...
fgrieu's user avatar
  • 142k
1 vote
0 answers
326 views

Proper formatting of symmetric algorithm secret key [closed]

Given this description from RFC 4880 sec 5.1: The value "m" in the above formulas is derived from the session key as follows. First, the session key is prefixed with a one-octet algorithm ...
calccrypto's user avatar
9 votes
2 answers
442 views

Is SSL getting faster because it's getting less secure?

There has been some discussion about it being more practical to use SSL due to advances in hardware. From my understanding, stronger public-key encryption means that both encrypting/decrypting and ...
Gelatin's user avatar
  • 193
19 votes
1 answer
8k views

Why do we need Diffie Hellman?

Diffie–Hellman offers secure key exchange only if sides are authenticated. For authentication, sides are using public/private key. So if side A knows the public key of the side B, then A can simply ...
piotrek's user avatar
  • 293
-5 votes
1 answer
404 views

Multi layer encryption with ECB mode [closed]

if i use the 2 of the same key with 2 of the same algoritm when encrypting in ECB like when i have 2 blocks of the same color and i encrypt the 2 blocks with the same color the cipher text should not ...
Andrew Campbell's user avatar
7 votes
1 answer
3k views

Is this design of client side encryption secure?

I want to build a secure file storage web application. Users should be sure that server doesn't know how to decrypt files so encryption should take place at client side (i.e. in Javascript) and TLS ...
Andrei Botalov's user avatar
6 votes
2 answers
2k views

How many bits can be safely extracted from the BBS generator at each step?

The Blum-Blum-Shub generator is a deterministic Pseudo-Random Bit Generator with security reducible to that of integer factorization. Setup: Secretly chose random primes $P$, $Q$, with $P\equiv Q\...
fgrieu's user avatar
  • 142k
60 votes
3 answers
26k views

"SHA-256" vs "any 256 bits of SHA-512", which is more secure?

In terms of security strength, Is there any difference in using the SHA-256 algorithm vs using any random 256 bits of the output of the SHA-512 algorithm? Similarly, what is the security difference ...
Pacerier's user avatar
  • 1,265
-4 votes
1 answer
3k views

128-bit Pseudorandom number Generator

Is there any 128-bit pseudorandom number generator available? I tried the Blum Blum Shub Generator, but I can't produce a 128-bit pseudo-random number. Maybe before I produce a 128-bit pseudorandom ...
goldroger's user avatar
  • 1,737
5 votes
1 answer
2k views

Using a derived key for CMAC

Consider the following authenticate-and-encrypt scheme that uses AES-128 in CBC mode for encryption and AES-128 - based CMAC for authentication: Two keys are derived from the master key k (16 byte): <...
silentser's user avatar
  • 153
3 votes
2 answers
797 views

Is the Blum Blum Shub PRNG suitable to create initialization vectors?

Is it a good idea to use a Blum Blum Shub Generator to create my initialization Vector (IV) in AES-OFB (Output Feedback Mode)?
goldroger's user avatar
  • 1,737
3 votes
2 answers
449 views

Idea for user/pass hashing to prevent rainbow tables, would it work?

I'm very new to cryptography (and security in general, for that matter), but I had an idea that I'm sure is very flawed, but is worth asking. If a computer user, online account, etc, needs to verify a ...
tkbx's user avatar
  • 181
2 votes
1 answer
966 views

Poor man's SSL - is this method as safe as SSL/TLS?

I need to send data between two applications. I've got requirement that says that data should be transmitted using secure protocol such as SSL/TLS. Data is sent using TCP sockets and I don't have ...
empi's user avatar
  • 139
5 votes
3 answers
14k views

RC4 Keylength Limits

While reading the Wiki page on RC4 I noticed that the key size must be in the range of 40–2,048 bits. Why is that? Is there a reason it can't have a lower or higher length?
Andrew Jones's user avatar
4 votes
1 answer
314 views

Stream ciphers based on discrete logs

Blum Blum Shub is a stream cipher that is provably reducible to the difficulty of factoring integers. I'm wondering whether there is a similar construction for discrete logs? For example, I could ...
Simon Johnson's user avatar
3 votes
1 answer
441 views

Vulnerabilities of encrypting data with known regularities

I need to encrypt data that has a pre-defined header and footer structure, and furthermore the data follows pre-defined patterns. The header and footer structure follow a defined structure but cannot ...
Ruud's user avatar
  • 133
4 votes
2 answers
333 views

Does a high exponent compensate for a low degree of certainty?

If a RSA certificate is created with a low degree of certainty, does the value of the exponent compensate for this? I'm asking because certain implementations of key generation software hide the ...
makerofthings7's user avatar
1 vote
1 answer
576 views

Probability of Repeated Encrypted Block In Output Feedback (OFB) Mode

Is there any probability/chances of repeated encrypted block in Output Feedback (OFB) mode? Is there any existing documentation/studies about that? If it is existing, can you please provide me a link ...
goldroger's user avatar
  • 1,737
6 votes
2 answers
8k views

Replay attack in ECB mode

How do replay attacks work in ECB mode? I found this in Wikipedia: "ECB mode can also make protocols without integrity protection even more susceptible to replay attacks, since each block gets ...
goldroger's user avatar
  • 1,737
3 votes
2 answers
2k views

How to decrypt this RSA-like cipher

Suppose we have a RSA-type Modulus $n = pq$ with $p,q$ prime. We also pick a random public exponent $e$ with $\gcd(e,\varphi(n)) = 1$ and compute the private exponent $d$ with $de \equiv 1 \pmod{\...
Patrick Oscity's user avatar
2 votes
1 answer
3k views

What is the correct value for "certainty" in RSA key pair generation?

I'm creating an RSA key pair in Bouncy Castle and need to specify an int value for certainty. This Stack Overflow answer says it is a relative test for how prime the values are. There is another ...
makerofthings7's user avatar
80 votes
3 answers
59k views

Impacts of not using RSA exponent of 65537

This RFC says the RSA Exponent should be 65537. Why is that number recommended and what are the theoretical and practical impacts & risks of making that number higher or lower? What are the ...
makerofthings7's user avatar
1 vote
1 answer
4k views

Deciphering a key from XOR encrypted cypher using boolean logic

Assume there's an unencrypted message A, and an encrypted message B. You know that message B was encrypted using a simple XOR method of A with a private key K, resulting in message B. Thus, B = A ⊕ K ...
user148298's user avatar
8 votes
2 answers
407 views

Proof of work for standard computers

I'm interested in a proof-of-work system that works well on standard computers without using the GPU. Properties the system should have: Seed based proof-of-work. There is no distinguished ...
CodesInChaos's user avatar
  • 24.9k
3 votes
1 answer
447 views

Setting protocol parameters to achieve concrete security

Background One issue with modern security proofs is that they are usually asymptotic. In other words, such proofs are usually formulated as follows: For any polynomial-time adversary $\mathcal A$, we ...
Sadeq Dousti's user avatar
  • 1,073
5 votes
1 answer
191 views

How are state wiretaps obtaining plaintext from encrypted transmissions?

According to the US 2011 Wiretap Report, encryption — on the off chance that it is encountered — has been no hurdle to retrieving the content of a conversation. Public Law 106-197 amended 18 U.S.C. ...
Bryson's user avatar
  • 153
3 votes
3 answers
1k views

Multiple Hash Functions that work in either nesting

Are there any hashing functions that, if two are used in conjunction (with the same salts) will return the same response regardless of ordering? I.e. are there hash-functions $H_1$, $H_2$ such that ...
topherg's user avatar
  • 271
6 votes
2 answers
3k views

Using bad generator in ElGamal Encryption

Suppose Alice chooses a random Prime $p$ and a random private Key $a \in \mathbb{Z}^*_p$. By accident, she also chooses a random number $g \in \mathbb{Z}^*_p$, which is not a generator of $\mathbb{Z}^*...
Patrick Oscity's user avatar
2 votes
1 answer
4k views

Generating a strong unique Initialization Vector

How can I determine if I am generating a unique and strong Initialization Vector? If my mode is generating Keystream? Is there any scientific explanation in generating a unique and strong ...
goldroger's user avatar
  • 1,737
7 votes
1 answer
190 views

Why does it matter for a signature scheme to be without random oracles?

There is a profusion of articles proposing signature schemes without random oracles (see for yourself). What does that mean, and why does it matter?
fgrieu's user avatar
  • 142k
4 votes
1 answer
284 views

Length of data to hash for PGP

I have finally managed to verify some simple PGP signed message blocks. However, I discovered that for some reason, my implementation limits me to verifying data that is 9-16 bytes long. no less. no ...
calccrypto's user avatar
8 votes
5 answers
12k views

How can I validate a hashed password if all I have is another hash?

The Scenario I have a client-side web application that bounces requests against a server-side API. For the sake of simplicity, every request must pass a username and password. This is similar to old ...
EAMann's user avatar
  • 205
0 votes
2 answers
375 views

What is the advantage of an attacker over breaking a 4 digits PIN?

When a hardware system is protected by a 4 digits password, what is the advantage of the attacker into breaking that system? Isn't it $10*10*10*10=10^{4}$? If $\frac{1}{10^{4}}$ is the cost of such ...
curious's user avatar
  • 6,190
20 votes
12 answers
19k views

Is it possible to make time-locked encrytion algorithm?

I'm not sure if what I'm asking is even a valid question but here goes. Would it be possible to add a mechanism to an encryption algorithm that would mean it had to be a certain time of the day or a ...
bowy tehcTo's user avatar
7 votes
2 answers
238 views

Abstracting primitives and modes of operation

I am developing a symmetric crypto library and have reached a roadblock. Looking at block ciphers, it is quite obvious that all block ciphers are trivially abstractable as a simple primitive ...
Thomas's user avatar
  • 7,518
7 votes
4 answers
1k views

Asymmetric algorithm to generate compact unique messages that can be validated

I have a cryptographic problem with the following characteristics: I need to generate a set of relatively short messages; say 20 bytes in length The contents of the messages themselves is not ...
Kieran Benton's user avatar
3 votes
2 answers
1k views

Capacity of Advanced Encryption Standard in terms of File Encryption

what is the capacity of AES in terms of File Encryption? is it really good to encrypt a large files in AES? ex. I am encrypting a 8GB of File... is it still good to used AES? is it still good to used ...
goldroger's user avatar
  • 1,737
3 votes
2 answers
3k views

How does the cyclic attack on RSA work?

I am trying to get the idea of cyclic attacks againts assymetric RSA encryption. Taken from Handbook of applied cryptography . Let $k$ be a positive integer such that $$c^{(e^{k})} = c\mod n \tag{1}....
curious's user avatar
  • 6,190
10 votes
2 answers
3k views

Are Stream Ciphers Less Secure?

This is by no means a scientific observation, but it seems to me that stream ciphers receive a lot less attention than block ciphers. Is there any reason for this? (Is it because block ciphers are ...
Dexter's user avatar
  • 647
42 votes
2 answers
34k views

Are there any known collisions for the SHA (1 & 2) family of hash functions?

Are there any known collisions for the hash functions SHA-1, SHA-224, SHA-256, SHA-384, and SHA-512? By that, I mean are there known values of $a$ and $b$ where $F(a) = F(b)$ and $a ≠ b$?
Pacerier's user avatar
  • 1,265
32 votes
2 answers
53k views

How much computing resource is required to brute-force RSA?

It's been over 30 years since Rivest, Shamir and Adleman first publicly described their algorithm for public-key cryptography; and the intelligence community is thought to have known about it for ...
eggyal's user avatar
  • 507
1 vote
1 answer
2k views

Expectation Value of the Index of Coincidence

Can Anybody tell me why the expectation value of the Index of Coincidence is the following? For a cipher text string of length $L$, where $n$ is the number of alphabet characters, $k_r = 1/n$, and $...
Matteo's user avatar
  • 1,141
3 votes
1 answer
237 views

Does it make sense to use slow hashes in digital signatures?

For storing passwords, it seems that the use of intentionally slow hash functions (like PBKDF2 and bcrypt) is now recommended. This is because most hashes are designed to be fast, which also makes ...
Rhymoid's user avatar
  • 215
6 votes
3 answers
2k views

Getting started [closed]

I'm looking for a good place to start in cryptography and places to go to get free books etc on the topic. I have been looking online but I always get stuck at some point or another. I need something ...
Joe's user avatar
  • 181
2 votes
2 answers
584 views

Byte location of plaintext vs ciphertext when using a block cipher or stream cipher

I know that when you use a stream cipher you are just XOR'ing the plain text with the PRNG stream, such that you know if a specific byte is in position 3 of the plain text it will still be in ...
Rook's user avatar
  • 1,506

15 30 50 per page
1
594 595
596
597 598
613