2
votes
1answer
178 views

ID-based key exchange protocol with PFS

The traditional authenticated DH protocol with PFS against active adversaries, ensures that the compromise of both party's long-term private keys after the session is completed will not help the ...
5
votes
0answers
328 views

Bleichenbacher 1998 “Million message attack” on RSA

I have been reading Bleichenbacher's 1998 paper on a forged message attack on RSA. The paper assumes access to an Oracle that takes a ciphertext $c$ and will check the decrypted text for valid PKCS #1 ...
1
vote
1answer
260 views

Serpent block cipher : S0 to S7 functions unclear

I am presently implementing the serpent block cipher in C++ following the specifications. It's important to mention that I'm implementing the cipher in bitslice mode. You'll need the The full ...
4
votes
1answer
142 views

Proof that MACing a hash of the message is also a secure MAC

I found a theorem that says: Let $MAC = (S,V)$ be a MAC for short messages over $(K,M,T)$. Let $H: M^{big} → M$. Define $MAC^{big} = (S^{big},V^{big})$ over $(K,M^{big},T)$ as: $S^{big}(k,m) = ...
2
votes
1answer
86 views

How do these figures represent a boolean function?

In the Wikipedia article "Bent functions", there are some figures representing those Bent functions: How do these figures represent a boolean function ?
1
vote
1answer
155 views

Non-linearity of a boolean function

What's the definition of non-linearity of a boolean function? Roughly saying it is minimum number of times it equals any affine function. But I don't get it mathematically. For example, if $f = ...
4
votes
3answers
190 views

What is the difference between a 'cipher' and a 'mode of operation'?

What is the difference between the term cipher (a name like RIJNDAEL) and mode of operation (like ECB)? Aren't these both terms for the encryption/decryption technique?
4
votes
1answer
154 views

Why does only length prepending improve the security of CBC-MAC

I know that length prepending improves security of CBC-MAC. However, wouldn't inserting the length elsewhere (middle, end or any other part of message) be equally good? After all, even the length is ...
1
vote
1answer
92 views

Verifying a Signature

Alice publishes $(n,e)$ where $n$ is exponential modulus and $e$ is the public key. We have $n=80$ digit number and $e=3$. Bob, in correspondence with Alice, asked Alice to prove she is really Alice, ...
4
votes
2answers
291 views

Increasing number of rounds in AES

AES-128 requires 10 rounds ( AES Description, Wikipedia ) However Bruce Schneier has recommended AES-128 use 16 rounds ( Schneier on Security: New Attack on AES ) Could that be implemented as two ...
0
votes
1answer
177 views

Simple digital signature example with number

I've been looking for a simple which signs a number with some randomly generated key and then verified(decrypts the original number) with the public key, which is generated by the private. All the ...
3
votes
2answers
189 views

Encryption of small messages

Some time ago, I asked how to encrypt small messages like e.g., four decimal digit numbers (banking PINs). I've got my answer, but also a warning like it makes no sense as it's easy to guess: Even ...
2
votes
1answer
89 views

What is the security risk if an encryption key is not random?

Ok, I just jumped into crypto and now struggling with some points… I read lots of resources, most of them mention how important the strength of the encryption key is. However, I could not find much ...
1
vote
0answers
59 views

Partial encryption of a file?

I want to partially encrypt a large block of data using AES. Meaning: given plaintext[0:1100], I would like to encrypt ...
3
votes
2answers
197 views

Does encrypting a hash of the message yield a secure MAC?

Is $mac = enc(hash(x))$ a secure MAC for hash = SHA256 and enc AES in CBC mode or ECB mode. Normally AES-CBC is malleable. But in this case I use a hash function for the one-way property. For ...
2
votes
0answers
50 views

Protocol/algorithms based on a variable-length input PRF

Are the proofs based on a PRF assumption still valid when using a variable-length input PRF ? The answer might be obvious, but I have a doubt.
2
votes
1answer
282 views

Prime number theorem - RSA

I am having trouble understanding the prime number theorem. As part of some revision for an exam, I am trying to answer the following questions (but seeing as I don't understand the concept of the ...
6
votes
1answer
440 views

How exactly was the finalist chosen in the NIST AES competition?

I was just reading the Stick Figure Guide to AES and came across an interesting table explaining how the winner was chosen: Unfortunately the NIST site is down so I can't gain further information ...
1
vote
0answers
110 views

Cryptanalysis not based on method used to encrypt? [closed]

When doing cryptanalysis on RSA or something number theory based, there are various attacks that all seem to involve number theory (Wikipedia: RSA_(algorithm) ~ Attacks_against_plain_RSA). Similarly, ...
2
votes
1answer
150 views

Since it gives negative power, how is rcon(0) calculated in AES?

I'm trying to calculate Rijndael key schedule "Rcon" values manually. I know how to calculate each value with the equation ...
5
votes
1answer
145 views

Initialization Vector Properties

This is a multi-layer problem, and I want to take you through the whole thing rather than just asking about IVs. Bear with me. Also, all code below is in Common Lisp because that's what I'm using, but ...
2
votes
1answer
395 views

Two different approaches for Key Expansion using the AES-256 algorithm?

I am implementing AES 256-bit Algorithm from the Theory given in the book, "Cryptography and Network Security" by Behrouz A. Forouzan. The Algorithm described in the Book in relation to ...
2
votes
1answer
119 views

Can we decrypt in this order when the message is encrypted twice?

If we encrypt a message twice with symmetric key $k_1$ first and then $k_2$ like $E_{k2}\{E_{k1}\{m\}\}$ , ideally we should decrypt with $k_2$ first and then $k_1$ but is it possible to decrypt with ...
1
vote
1answer
52 views

RSA Proof - di-mgt - modulo properties

I´m trying to follow one of the very detailed RSA Proofs given by di-mgt: "RSA theory", but unfortunately I stuck at the beginning of solution (chapter 3). I don´t understand where the second part ...
0
votes
1answer
391 views

RSA square and multiply

If an RSA encryption uses a modulus $n$ of 15000 bits and $e = 3$ or $e = 2^{16} + 1$, how many squarings and multiplications will we need for encryption, and for decryption? Could you please explain ...
1
vote
1answer
256 views

garbled circuit vs fully homomorphic encryption

Consider an outsourced database to an untrusted cloud (think CryptDb), the question is how to compute a function $f(.)$ on the data. I think I understand how (fully or partially) homomorphic ...
1
vote
1answer
114 views

Testing if a password for an eCryptfs mount is valid [closed]

I'm using "eCryptfs" on several directories on my dedicated Debian server. I mount them manually via mount -t ecryptfs [dir] [mountpoint] But after some weeks ...
0
votes
1answer
105 views

DSA generate signature and verify

I'm trying to generate a signature for DSA with the following parameters: $p = 23$ , $q = 11$ , $g = 3$ , $H(m) = 8$ , $x = 5$ for the life of me, I cannot choose a random $k$ ($0 > k > q$) ...
1
vote
1answer
138 views

Intuition for random variables in cryptography

I have a simple question about the use of random variables for encryption schemes, to make sure my intuition is correct. We say $P(K = k)$ to represent the probability that a particular key $k$ is ...
2
votes
0answers
85 views

What role plays Quantum Fourier Transformation in Shor's integer factorization algorithm?

I cannot seem to understand the role or goal of Quantum Fourier Transformation in Shor's integer factorization algorithm. Is it used to collapse all quantum states into one, in which it has a factor ...
-5
votes
1answer
1k views

Decrypting encrypted files if i have the original files(Plain Text attack) [closed]

I have the following A Encrypted file and the same file in its original(not encrypted) form Now will it be possible to find the encryption/decryption key by comparing the the above two files are ...
2
votes
1answer
44 views

How can I evaluate the congruency of an AKS primality test?

Despite the fact primality test is a mathematical issue, it plays a part on the security of many cryptosystems such as RSA. I was trying to understand how it works until I came to the following ...
2
votes
1answer
102 views

Is this EAX extension weakening the (provable) security of EAX?

I would like to insert a key deriving function into EAX mode, in order to hamper brute-force attacks for a key-size restricted cipher (56 bits). The modification inserts an identical multi-block ...
4
votes
2answers
349 views

RSA least significant bit oracle attack

I have been reading up on RSA attacks and came across one that could be called a least-significant-bit (LSB) oracle attack. For the sake of clarity lets define RSA primes $(p, q)$, private key $d$ ...
0
votes
1answer
105 views

Is there way to combine secrets first and later split them?

Shamir's Secret Sharing allows a secret to be split into multiple shares so that it can be reconstructed later. Is there a way to do the reverse? Can we combine a few secrets first and later split ...
1
vote
1answer
299 views

Schnorr Identification Scheme under active adversary

According to this paper by Mihir Bellare and Adriana Palacio, Schnorr identification scheme is secure under an active adversary who changes messages. I have been told that Schnorr is actually not ...
1
vote
2answers
245 views

Solid summary of what encryption remains strong after recent events [closed]

Following the recent government hacking (and subsequent news and fallout), I'm wondering what crypto-systems remain strong (and why) and what crypto-systems were exploited too heavily to be reliable. ...
1
vote
1answer
150 views

Hill Cipher - Unknown plaintext attack, known key [duplicate]

I was wondering if I have the key and the encrypted Hill Cipher message(s). I can definitely figure out the charset involved. But the order is missing. Assuming that I use 37 modulo or higher. How ...
4
votes
1answer
204 views

Blockwise Montgomery multiplication

I have to implement a 256*256 bit Montgomery multiplier for pairing computations. The straightforward approach is to use a bit-serial version, but I would like to utilize the built-in 64*64 bits ...
0
votes
0answers
30 views

Using same keypairs for crypt and sign with elliptic curve [duplicate]

I asked my question on a mailing list ( http://www.metzdowd.com/pipermail/cryptography/2013-October/018061.html ) and i received many answers, which are confused me. So i try to ask here, it is ...
1
vote
3answers
157 views

Encoding numbers that can be decoded mentally?

I have a lot of objects, all of which need a particular number tagged on them so I can quickly tell the customer accordingly. But the problem is that the customer should not know what these numbers ...
1
vote
0answers
125 views

PGP encryption options

I recently began using PGP desktop and found several options for my encryption capabilities. Which of these (AES, Cast, Triple DES, TwoFish, IDEA) is the most recent, firstly, secondly may the NSA not ...
2
votes
2answers
146 views

Where does the meaning of reduction to a hard problem lie?

Given you a protocol, if we can reduce breaking the protocol to a hard problem, such as DLP or CDH, then we can say that this protocol is secure. Theoretically speaking, reduction is a good method ...
5
votes
1answer
433 views

Where could I submit my algorithm?

I have come up with an encryption algorithm and I am looking for a place to possibly publish it. Any ideas?
0
votes
1answer
120 views

Is AES a linear hash?

So, having read a variety of documentations on AES encryption, I came to the unknowledgeable conclusion that the key schedule applied to the array of chunks, and not just the 14 cycles on a single ...
2
votes
1answer
204 views

What kind of machine can generate 100-400 digits prime number? RSA

The 64 bit machine's biggest number can be 2^63 (9,223,372,036,854,775,807). So what kind of a monstrous machine can generate 100-400 digits prime number? I probably don't understand something, so ...
2
votes
2answers
156 views

Is scrypt a hashing function, encryption, or PBKDF?

I have installed a python implementation of scrypt and noticed it has several functions, both an encrypt and hash function. Yet Wikipedia lists it as being used for PBKDF instead of PBKDF2. Is scrypt ...
3
votes
2answers
108 views

Random session key + predictable IV

I'm using Blowfish in a toy Diffie-Hellman communications scheme. Random session keys are generated for each connection. In this case I can simply feed a null array to the IV right? The same ...
5
votes
1answer
1k views

PBKDF2WithHmacSHA512 Vs. PBKDF2WithHmacSHA1

I'm working on a Java authentication subsystem that specs the storage of passwords in the DB as PBKDF2-generated hashes, and I'm now trying to decide whether I ...
0
votes
2answers
171 views

Reuse of a DH / ECDH public key

I was wondering whether it is safe to use the same DH or ECDH key pair in more than one key agreement, particularly if these public keys are in a public registry. These public keys could be used by ...

15 30 50 per page