0
votes
0answers
20 views

Are there any reasons for using SSL over IPSec? [migrated]

is it recommended to use both protocols together? In which situation?
1
vote
0answers
58 views

Generalized Merkle Signatures, SHA-3 and Sakura

Sakura specifies a tree hash mode for e.g. Keccak (SHA-3). Are there any reasons to use the Sakura tree hash mode in a Generalized Merkle Signature Scheme? It seems to me Sakura primarily solves a ...
3
votes
2answers
582 views

How long does it take to crack PBKDF2?

How much time will it take to crack PBKDF2 while using a 9 character password? I'm not specifying any specific system or platform. If a brute force attack is made using the best ever super computer ...
1
vote
1answer
43 views

How to find which padding method is used in Block cipher(AES) encyption?

I have a cipher text which is encrypted using AES128 Algorithm. I want to know the following things to decrypt the cipher. IV (Initialization Vector) Padding Method Encryption Key How do I find ...
0
votes
0answers
33 views

Does bad IV generation weaken CBC? [duplicate]

Let's say that I generate an IV like so: dd if=/dev/urandom of=iv.bin bs=16 count=1 Let's also say that /dev/urandom has been ...
1
vote
1answer
211 views

Can I crack an AES string if I have all these parameters?

This is for a challenge at followthewhiterabbit.trustpilot.com: We have a message for you. It’s 3ncryp73d and we want you to crack it. The decrypted message will contain further instructions. ...
3
votes
1answer
77 views

Using GMAC for Authentication without encrypting the message

I am pretty new to cryptography and have a sample of GCM mode of operation for AES. PFB the code ...
-1
votes
0answers
35 views

Security Model of Group Key Transfer Protocols [closed]

I have read many papers about Group Key Transfer (GKT) Protocol. However, no security models are given in this papers. I want to know whether there is a security model for GKT, and how to prove the ...
6
votes
2answers
759 views

Does having a known plaintext prefix weaken AES256? [duplicate]

I plan on storing data, encrypted with AES256, where the first dozen bytes are known plaintext. ('Hello World!' for example.) Does having this known plaintext prefix weaken AES256? I do not care ...
2
votes
2answers
74 views

Collecting entropy: can I use timing of reading as a separate source from the reading itself?

I'm implementing an entropy gathering program. For that I collect 2 bits from two gpio-pins connected to a random source. I whiten this stream of bits using the von Neumann decorrelation algorithm. ...
2
votes
1answer
98 views

How to calculate complexity of ElGamal cryptosystem?

How to calculate time and space complexity of ElGamal encryption and decryption as there are two exponentiation operation during encryption and one during decryption? Here is my code for encryption: ...
3
votes
1answer
59 views

Decrypting an encrypted text out of order

Does there exist a cipher that can be encrypted twice with two different keys and then decrypted twice using either key first? For example: ...
1
vote
1answer
126 views

Ciphertext indistinguishability (IND-CPA) for symmetric cryptography

My understanding are these steps are necessary for symmetric cryptography to be IND-CPA: The adversary submits two distinct $M_0$, $M_1$ plain-texts to the challenger. The challenger selects one of ...
3
votes
1answer
123 views

Attack on DSA modification with bad hash function

Given a (bad) modification of DSA where the hash function is the identity ($H(m)=m$), I am now supposed to design an attack. So $(m, (r,s))$ are given and I should be able to create a legit signature ...
1
vote
0answers
64 views

A question about elliptic curves and finite fields in bilinear pairings

Based on what mentioned in the paper "Pairings For Cryptographers" http://www.sciencedirect.com/science/article/pii/S0166218X08000449 the two inputs of a pairing map are two members of two additive ...
2
votes
0answers
75 views

Protocol: Coin Flipping over phone

Protocol: Coin Flipping over telephone Hypothesis: Alice and Bob have agreed: a one to one function $f$ which is easy to compute $f(x)$ from $x$ and while given any value $f(x)$ it is nearly ...
1
vote
0answers
53 views

How does AES-CCM work in BitLocker?

I'm studying this white-paper: http://jessekornblum.com/publications/di09.pdf The author says that using AES-CCM with the external key (highlighted in green at page 9, figure 4) and with the nonce at ...
1
vote
2answers
126 views

Decryption issue with self-coded AES-128

I have written my own AES-128bit implementation in Java, till yesterday I thought it would be alright. (I was working on the encryption) Now I’m trying to decrypt my encrypted cleartext, but this ...
-1
votes
0answers
38 views

Thought process to select right process/protocol? [closed]

Say I have 1 GB of data that I need to both store and send securely. This could be my intellectual property that I am trying to protect. In this kind of scenario and considering there are wide ...
3
votes
1answer
68 views

Galois field step in XEX mode

I'm reading through the XEX mode spec, and I want to make sure I've understood the $\alpha^j$ step correctly: $X = E_K(I) \oplus \alpha^j$ $C = E_K(M \oplus X) \oplus X$ where: $M$ is the ...
-1
votes
3answers
75 views

Could I use an hashing function for Symmetric encryption? [duplicate]

I know there are way better and more tested encryption methods, but I was wondering if the following code could be use for symmetric encryption? ...
2
votes
1answer
49 views

mixing two asymmetrical random number generator streams

Knuth describes in "the art of computer programming part 2" an algorithm called "M" for mixing two streams of random numbers. This can be used to mix random number streams giving the assurance that ...
2
votes
1answer
80 views

What is the motivation behind Key-policy Attribute-based Encryption?

What is Attribute Based Encryption? has a nice explanation what both forms (Ciphertext-policy Attribute-based Encryption and Key-policy Attribute-based Encryption) are. My question is: what is the ...
0
votes
0answers
87 views

Can astronomical radio sources be used as a verifiable randomness beacon? [closed]

A randomness beacon is a source of random data that is broadcast to multiple parties. Users listening to the beacon receive the same sequence of random strings and no one can predict the values in ...
2
votes
2answers
105 views

What is the entropy per Diceware word if a random symbol is inserted into a random position in the word?

On the Diceware page is this little gem: For extra security without adding another word, insert one special character or digit chosen at random into your passphrase... Inserting a letter at ...
-2
votes
0answers
69 views

Is there any reason for encryption to be as fast as possible? [closed]

Is there any reason for encryption to be as fast as possible? Maybe in military communications or cryptocurrencies ? Thank you.
-2
votes
0answers
51 views

Decrypting a message with the wanted result and the key [closed]

So first of all, excuse me if this is a dumb/trivial question, I'm not very experienced in the field of cryptography (and by not very I mean not at all). Also, it could be very possible that this ...
5
votes
1answer
73 views

How to construct a next bit predictor from a distinguisher

I read the claim, without proof, that it is possible to construct a next bit predictor for any PRNG given an oracle distinguisher for that PRNG and vice versa. How do I prove that? A distinguisher ...
-2
votes
2answers
119 views

pairing-based schemes

some authors claimed that computational performance of a pairing-fee scheme (based on scalar multiplication over an elliptic curve group) is about 1000% more efficient than a pairing based one I would ...
4
votes
1answer
84 views

Clarification of the terms “brute force” and “guess”

In the answer to the question “What exactly is a negligible (and non-negligible) function?” There is a part in the explanation that – as far as my knowledge goes – is conflicting: But instead of ...
2
votes
2answers
139 views

Does CCA security imply authenticated encryption?

Does CCA security imply authenticated encryption?
3
votes
2answers
101 views

How does recovering the public key from an ECDSA signature work?

It is possible to recover the public key from an ECDSA signature (R,S). Please explain me how this works.
3
votes
3answers
140 views

Effective security of block cipher – equal the key size, or half the key size?

The Wikipedia “Key Size” article states: The security of an algorithm cannot exceed its key length (since any algorithm can be cracked by brute force), but it can be smaller. … … … Most ...
2
votes
1answer
45 views

Is jacobian to projective conversion unique?

I am doing a small project in ECC. I have used the following equation for converting Projective to Jacobian coordinates: $$D = AC\\ E = BC^{2}\\ F = C$$ and also the following equation to convert ...
0
votes
0answers
66 views

Is there any _true_ anonymous cryptocurrencies? [migrated]

I've been looking into Bitcoin recently and stumbled upon numerous notes how Bitcoin is not anonymous at all, or how it's only partially anonymous and you can easily trace your funds. So, this ...
-1
votes
0answers
69 views

If I add a stream of true and pseudo random numbers, do I get another stream of true random numbers? [duplicate]

I am thinking of buying a USB hardware advertised as producing a stream of 'high quality' random numbers which I take to mean they are indistinguishable from a stream of 'true' random numbers. If I ...
-1
votes
0answers
55 views

Determining if a stream of bits is statistically random [duplicate]

Suppose I would like to build a hardware RNG. The details aren't important but let's say I've found a way to generate theoretically random bits, and I want to test to see if they are in fact "random ...
2
votes
2answers
159 views

In RSA, why does $p$ have to be bigger than $q$ where $n=p \times q$?

In openSSL – during RSA key generation – if $q$ is bigger than $p$, they exchange them. Why is that?
0
votes
0answers
57 views

What is a proof of data possession that accounts for fake mirrors?

Alice pays Bob $5/month to host a gigantic file for her. She wants to occasionally verify that Bob is actually hosting the file. To do this, she selects random blocks from the file, and ...
2
votes
1answer
29 views

Calculating IHVs from known message and hash output

Here is a somewhat silly and atypical problem I am currently facing. Usually, when it comes to hashes, one is bothered with finding collisions and preimages. My problem is, I need to find the IHV used ...
-2
votes
0answers
11 views

Could remailers achieve their goals under conditions of ubiquitous (total) surveillance? [migrated]

I am not certain but I am afraid that the answer to the question would be negative, if the following arguments couldn't be clearly refuted: A sender of a message has to choose a (first) node of the ...
2
votes
3answers
157 views

How can a Vigenère cipher be broken if the message is short?

I was watching a Stanford lecture on Vigenère cipher and in it the professor said that – to break the cipher – we assume the length of the key is known. We then break the cipher into groups of this ...
3
votes
1answer
81 views

Is there a practical upper limit for password rehashing?

When using PBKDF2, is there a practical upper limit to the iteration count above which we lose security? Note: If you answer “No”, that's fine. But if you answer: “There can't be an upper limit“, ...
-4
votes
0answers
58 views

RSA Key and RSA Security

Is there any relationship between the RSA keypair standard and RSA security? Keypair: http://en.wikipedia.org/wiki/RSA_(cryptosystem) Security: http://en.wikipedia.org/wiki/RSA_Security If not, ...
0
votes
1answer
249 views

Random Number Generator based on AES CTR

I've just about done tinkering with an open source DRBG, and I sure would appreciate a bit of advice from this community. Here's the link to the project, hosted at codeproject.com. It is written in ...
1
vote
0answers
39 views

Trapdoor permutation / hardcore predicate [closed]

I'm trying to understand the basic scheme of deniable encryption based on the “Deniable Encryption” paper by Ran Canetti, Cynthia Dwork, Moni Naor and Rafail Ostrovsky (1997). Is there any source ...
2
votes
1answer
89 views

How can I calculate the Rijndael SBox?

I would like to implement the Rijndael subBytes() operation using calculation instead of tables, because I like to play with this on different wordsizes, as an ...
4
votes
1answer
75 views

McEliece and cryptanalysis

What is the computational time to break McEliece on a quantum computer? I've seen that polynomial time algorithms exist, but for special conditions. What about the general case?
1
vote
1answer
42 views

Choosing primes in the Paillier cryptosystem

In the first step of key generation phase in Paillier cryptosystem given here. It's given that ( length($p$) == length($q$) )$\implies$ gcd$(pq,(p-1(q-1)))$=1 where length($k$) = # bits in ...
3
votes
1answer
100 views

Does adding a salt to the message before HMAC processing add any security?

An HMAC function is designed to verify message integrity, i.e., that the message has not been tampered with. It is generally (always?) implemented by using a hashing function ...

15 30 50 per page