1
vote
1answer
99 views

Deterministically generate a RSA public/private key pair from a passphrase (with sufficient entropy)?

Is it possible to deterministically generate public/private RSA key pairs from passphrases? Would giving the (key generating) algorithm data made from key-stretching the passphrase (instead of a ...
0
votes
1answer
132 views

What prime lengths are used for RSA?

Let's assume we have an RSA 2048 that was produced by two primes multiplication. What is the digit's difference in those 2 factors? For example one prime is 1024 digits and second one 1024 or, one is ...
-1
votes
2answers
44 views

Improving on a clocked PRNG

I recently developed a PRNG from scratch with a little inspiration from the initialization function used in the HC stream cipher. The state ($S$) of the basic version is an array of 5 bytes and uses ...
5
votes
3answers
298 views

Secret sharing scheme with possibility to change the secret

Here's a scenario I want to handle with a secret sharing scheme: Alice wants to share the secret $S$ with Bob, Charlie and Dave. Alice generates private shares based on $S$ for Bob, Charlie and ...
2
votes
4answers
123 views

Can we reverse a hash when we know part of the input?

While I read that hashes are not meant to be reversible, but assuming we have part/half of the message/input of a hash? Is there any method that we can use to recover the remaining message via this ...
7
votes
4answers
930 views

Why are RSA key sizes almost always a power of two?

I know that other bit sizes are possible, e.g. this HTTPS server seems to have a 9000 bit key https://www.ssllabs.com/ssltest/analyze.html?d=qqq.gg, but it's very rare that one sees a key not of size ...
1
vote
2answers
63 views

How does SafeNet MobilePASS generate passwords? (TOTP Variant)

This question is similar to How does SafeNet MobilePASS generate passwords? The question and answer there is related to the HMAC Variant of SafeNet Mobilepass. I'm looking for details on the TOTP ...
1
vote
1answer
118 views

Concatenation of two strong hashes may have striking weakness

For any hash functions $H_0$ and $H_1$, it is easily proved that their concatenation $H_0\|H_1$, defined by $(H_0\|H_1)(X)=H_0(X)\|H_1(X)$, is at least as resistant as the strongest of $H_0$ and $H_1$ ...
0
votes
0answers
31 views

how to calculate nonlinearity?

I am struggling to understand how to calculate non-linearty of an s-box, could someone show me a detailed example? I found this question which helped a little, but I still didn't get it, if someone ...
4
votes
1answer
426 views

Any use for now-defunct Mt Gox Yubikey?

As everyone is now aware, Mt Gox has declared bankruptcy. As what appears to be the very last thing they did, Mt Gox accepted my $35 and fulfilled my special Mt Gox Yubikey. Having just arrived in the ...
0
votes
0answers
42 views

Composition of non-perfect encryption keys

Definition 1: A key $k$ is called perfect if it is uniformly distributed from the adversary's point of view; a key $k$ is called $ε$-perfect, if its distribution has an $ε$ trace (statistical) ...
8
votes
4answers
659 views

Creating a small number from a random octet string

I'm trying to figure out the best way to generate a cryptographically secure random number between 0 and 200 (inclusive) from a cryptographically secure random string of bytes (ie. read from ...
0
votes
0answers
44 views

DES ECB/CBC encryption always results in same ciphertext [closed]

I've recently wrote a simple java application experimenting with ECB CBC modes of encryption and I've noticed something strange with how my code works. For some reason my resulting ciphertext will ...
0
votes
0answers
22 views

CAPTCHA related project [closed]

I'm in my final year of engineering and I'm required to do a mini-project on some topic related to Network Security. I was thinking of doing the project on the lines of CAPTCHA. If someone could ...
9
votes
1answer
615 views

How would one crack a weak but unknown encryption protocol?

I asked a question on security.stackexchange, but was told it would be a better fit here: http://security.stackexchange.com/questions/32779/how-would-one-crack-a-weak-but-unknown-encryption-protocol ...
1
vote
2answers
66 views

Applying Trapdoor Function directly to plaintext

Suppose we have a secure trapdoor function defined on (G, F, F^-1) where G is a randomized algorithm outputs a key pair (pk, sk). Why would this trapdoor function become insecure if we apply F ...
0
votes
0answers
45 views

Making PRFs out of PRGs

Is it possible that we take a $PRG$ $G(k)$ of stretch $n\cdot2^n$, and read its output as the table of a $PRF$ $F(K)$ with input and output size of $n$? Intuitively it sounds possible however I read ...
0
votes
1answer
64 views

What practical uses can random hash collisions be put to?

Using magic, I've built a machine that instantly generates hash collisions. To try it out, I set the dial to SHA256 and typed in "e7cf3ef4f17c3999a94f2c6f612e8a888e5b1026878e4e19398b23bd38ec221a". I ...
2
votes
1answer
73 views

Build set with PKI from reliable broadcast / random beacon

I am trying to build a protocol (or find an existing one) for creating a set $S_2$ with PKI from a set of parties $S_1$ that initially does not know anything about the other parties. We assume ...
0
votes
2answers
111 views

Reusing a one-time pad?

I have an embedded device. It produces larges files (200 MB). I want the device to encrypt the file before writing to disk, so I gave them all a 16-byte random key. How can I transform the large ...
0
votes
0answers
31 views

Practical strength of non-2^n RSA key lengths [duplicate]

It has for many years been popular to use RSA keys that have lengths that are powers of two. E.g. 1024-bit, 2048-bit and 4096-bit key lengths are all popular for use with OpenPGP implementations such ...
0
votes
0answers
30 views

Weaknesses of truncated hash value [duplicate]

I want to apply one of SHA-2 functions to a plain text and then truncate the hash value into parts and store them into different areas so are there any security implications for truncating the hash ...
0
votes
0answers
35 views

I was wondering if RSA is an homomorphic crypto system? [duplicate]

I was wondering if RSA is homomorphic and how secure is it. I have read there is a variable of this but i don't fully understand the mathematics.
1
vote
0answers
28 views

Is RSA-OAEP secure when e=3? [duplicate]

Is RSA-OAEP secure when the exponent is equal to 3?
0
votes
0answers
30 views

Resynchronizing brute-force attack against stream ciphers

There is a stream cipher without any known cryptographic weaknesses. The attacker knows parts of the key so she can reduce the key-space to a size that can be practically brute-forced. However the ...
0
votes
1answer
83 views

Why not send the identity in the encrypted message?

I've recently started reading the book "Applied Cryptography" written by Bruce Schneier. Quite a few times I stumbled across protocols who send the identity outside of the encrypted message (see step ...
2
votes
1answer
112 views

Differential Fault Analysis of AES

Let's say: an error is induced into an implementation of the AES-128 to produce a faulty ciphertext. The error is a one-byte eror and is always induced on the last state byte, during round9, before ...
2
votes
0answers
51 views

Implementing modular reductions (n*n) [closed]

I'm implementing a public key cryptosystem in a proprietary System On Chip that only allows modular reductions by $n$. However, that cryptosystem requires ($n^2$) modular reductions. Perhaps someone ...
1
vote
0answers
47 views

Can CKM_RSA_PKCS signature be made secure by lowering its maximum input size?

The CKM_RSA_PKCS Mechanism in PKCS#11 v2.20 section 12.1.6 PKCS #1 v1.5 RSA is a signature scheme commonly used to implement RSASSA-PKCS1-v1_5 of PKCS#1 signature of data hashed externally to a ...
0
votes
0answers
27 views

Signature constructor using Self-signed certificate

I've the following scenario: One application signs JWT access/id tokens using the private key contained in a self-signed certificate, and then passes its public key to other parties to validate that ...
1
vote
0answers
47 views

Given only RSA public key parameters, what security issues might I be able to detect?

I'm attempting to automate some checks against a large list of .NET assemblies, and want to include a test to see if the RSA parameters used to sign the assemblies are sensible. However, since I don't ...
0
votes
1answer
50 views

CCA-attack is possible in RSA, but how the decryption key $d$ is known to anyone

CCA-attack is possible in text-book RSA, but how the decryption key $d$ is known to anyone, as it is kept secret with receiver.
2
votes
0answers
46 views

Statistical saturation attack on block ciphers

I was wondering if anyone around here could give me some explanation on this type of attacks. Pretty much the only thing that I could find is this What I really need is basic explanation of the ...
0
votes
1answer
59 views

Steganography Decryption From Completely Black Image

I am trying to decrypt a completely black gif that I know has been encrypted by some sort of steganography. I've tried subtracting the bytes of the images with each other, and so far I have gotten a ...
0
votes
0answers
24 views

Where I can find a list of certified software / hardware RNGs compliant to NIST SP 800-22?

I need to use NIST SP 800-22 approved software / hardware to generate RSA key pair. Where I can find a list of certified software / hardware RNGs compliant to NIST SP 800-22? And how is the SP ...
1
vote
1answer
110 views

Factoring two RSA modulus with known $|p_1 - p_2| < \ell $

I have two 1024bit RSA modulus $N_1 = p_1q_1$ and $N_2 = p_2q_2$ such that $0 <|p_1 - p_2| < \ell$, and $\ell$ is at most 64bit integer. Can I factorise $N_1$ and $N_2$? What's the answer when ...
0
votes
1answer
71 views

why do files downloaded with http and https have the same size?

while working with Encryption mostly cipher text is always larger the plain text, why isn't that the case when downloading a file using https ? even that compression isn't much used anymore because if ...
0
votes
0answers
17 views

Block size of 128 bit in (quantum) future [duplicate]

Is a block size of 128 bit enough to ward off expected attacks in the future (something like 30 years ahead) with the possible risk of quantum computers? Other formulation: If we were to create a ...
0
votes
0answers
33 views

Requested to encrypt data with AES256, digital certification, timestamped

at my job we have been tasked by gov to encrypt some data we send to them. The "law" says we have to do the title above, but they only need us to do the AES256 thing because the data is not really ...
0
votes
0answers
26 views

How to check if a sequence is generated by a linear congruential generator? [duplicate]

Assume a linear congruential generator is defined by $x_i=(x_{i-1}\cdot a+c)\bmod m$ and I am given the values $a$, $c$, $m$ and a sequence of numbers starting at the $n$th bit. Can I tell whether ...
0
votes
1answer
46 views

decrypt a saml 2.0 response having aes 128 and rsa [closed]

I need to decrypt a saml 2.0 response. But, the response object has reference to aes 128 and rsa algorithms, and I am having hard time in finding a way to decrypt. Below is the structure of the ...
0
votes
1answer
40 views

RSA Decryption from samples

I am working on a project for a client which involves decryption of data which was encrypted using RSA. The system in question retains three independent copies of each data-set, but each copy is ...
3
votes
2answers
104 views

Why does consecutive permutations or consecutive substitutions not enhance security?

My professor stated that permutations which are done repeatedly does not further enhance security than just one permutation. He also stated that fact this applies to consecutive substitutions as well. ...
3
votes
1answer
120 views

RSA key pair generation and FIPS 140-2, 186-4

I need to securely generate RSA key pair and I need to have access to private exponent in order to process it further. What's the difference in FIPS 140-2 and FIPS 186-4 in connection with RSA key ...
-1
votes
0answers
30 views

Does “cryptography rather [try] to minimize the expansion of ciphertext”?

In a question's comment on crypto.SE (Is there an efficient way to hide the encrypted plaintext length with a block cipher?) it was stated cryptography rather tries to minimize the expansion of ...
1
vote
0answers
47 views

Statistical saturation attack on block ciphers

I was wondering if anyone around here could give me some explanation on this type of attacks. Pretty much the only thing that I could find is this What I really need is basic explanation of the ...
0
votes
2answers
83 views

General questions about cryptography for password security

I'm pretty new to this and find it quite interesting, but my brain won't process how it works so I have to ask some questions :) Why is cryptography used? Is it for extra security once the password ...
0
votes
1answer
25 views

What is the benefit of applying the tweak a second time using XTS?

I tried to understand the inner working of XTS. What I understood is that it is applying the tweak two times: once on the plaintext and once on the output. What is the benefit of applying the tweak ...
0
votes
0answers
35 views

Unable to open old encrypted PKZIP 2.0 files despite having the password [closed]

My company has many many thousands of old compressed files that are maintained by a small C++ program written many years ago. The program successfully decrypts and uncompresses individual files using ...
0
votes
0answers
38 views

Is there any task better and less complex than oblivious transfer? [closed]

I wanna know whether there can be any algorithm less complex than oblivious transfer because OT consumes O(n) time complexity where n is the number of messages involved. So can you please help me out ...

15 30 50 per page