0
votes
1answer
29 views

Reordering of multiple signed blocks

I would like to refer you to page 430 of the Handbook of Applied Crypto, where the authors said "... reordering of multiple signed blocks presents a security risk..." This statement was made in ...
1
vote
1answer
51 views

Is this discrete log generalization a well known cryptographic assumption?

Assume you have a finite group $\mathbb{G}$ and an integer $n$. Given $g_1,\dots,g_n,t$ chosen uniformly from $\mathbb{G}$, consider the problem of finding a vector $(a_1,\dots,a_n)\in \mathbb{Z}^n$ ...
6
votes
1answer
317 views

what is the current actual budget - as of 2015 - needed to build a DES breaker machine?

EFF - Electronic Frontier Foundation - built a DES cracker for a budget of 250K$ in July 1998. I assume that as of 2015 - the cost of such a DES breaker would be less, are there any estimations about ...
0
votes
1answer
232 views

Repair AES-128 decrypted file

I decrypted a file which was encrypted with OpenSSL and AES-128 with the wrong password. Before I noticed it was the wrong password I removed the original file. Is there a possibility to reproduce the ...
0
votes
1answer
68 views

Workaround to implementing Forward Secrecy

In the case where I am self-signing my digital certificates, if I just change my certificate (generate a new one) every week or month, will this have (sort of similar to) the same effect as ...
9
votes
2answers
891 views

Encrypt-then-MAC: Do I need to authenticate the IV?

In the setting of Encrypt-then-MAC, do I need to include the IV in what I'm HMACing, or is authenticating just the AES-encrypted data sufficient?
2
votes
3answers
464 views

Is the 1st Encrypted Block Less Secure Than Subsequent Ones?

It's my understanding that Electronic Code Book (ECB) produces similar cypher text for similar plaintext inputs which is not a good thing. To get around that, Cypher Block Chaining (CBC) can be used ...
4
votes
1answer
377 views

Composing two one-way functions such that the result is not a one-way function

Is it possible to have two distinct one-way functions (called, say, $h$ and $g$) such that their composition $h \circ g = [\, x \mapsto h(g(x)) \,]$ is not one-way?
5
votes
2answers
286 views

Is $f(x)\oplus x$ a one-way function?

Given that $f$ is a OWF and $|f(x)|=|x|$ for all $x$, is $g(x)=f(x)\oplus x$ necessarily also a OWF?
-1
votes
2answers
329 views

Remove padding (CBC) from decrypted text [closed]

I have a bit problem with padding. Everything goes fine when I encrypt the text BUT when I decrypt I see some extra characters. Sometime's one character sometimes more and I dont know how to remove ...
3
votes
1answer
112 views

Parameters for elliptic curve prime192v3

I'm looking all over the internet for prime192v3's parameters. I think I may have found them here, but it doesn't say what variable each number matches to. Is there some central place where I can find ...
0
votes
1answer
55 views

What is the probability of finding 4 equal bytes? [closed]

Is it $2^{-32}$ or $2^{-24}$ as one byte is assumed to take a given value and the remaining 3 bytes should have the same value?
7
votes
11answers
2k views

Algorithm: How to use x and y mouse movement co-ordinates to generate random data?

Background: I'm making a program for fun as a learning exercise. I want to generate some actual random key material (not pseudorandom) from a JavaScript program. For my program is just for ...
0
votes
1answer
154 views

Fault encryption attack on RSA [duplicate]

How to recover plaintext, if we know public key(RSA), correctly encrypted text and text encrypted with faulty public key, where one bit is changed?
0
votes
0answers
33 views

Possible to determine the encryption key that was used by knowing the input and output of the encryption mechanism? [duplicate]

Assume that a malicious user knows what string is being encrypted (a user_id, for example, which the user can know) and can also see the result of the encryption (the encrypted user_id that is used to ...
1
vote
0answers
32 views

Encryption scheme that allows compare ciphertexts based on the clear text [duplicate]

I would like to compare ciphertext based on the order assumed on the message space. So, do you know if there exists some encryption scheme with the follow property: Let $c_0 = E(m_0)$ and $c_1 = ...
4
votes
1answer
393 views

Reusing the random exponent for ElGamal encryption with different plaintexts

In the basic ElGamal encryption scheme, we encrypt a message $m$ as $(g^r, h^r m)$, where $g$ is the group generator and $h$ is the public key of the recipient. If the sender has another message $m'$ ...
1
vote
1answer
214 views

How do SignRecover and VerifyRecover work?

In PKCS#11, there are the SignRecover and VerifyRecover methods, where the data can be recovered from the signature. How do these methods work? Can I implement signrecover and verifyrecover with ...
6
votes
1answer
421 views

RFC 6979 - Why not simply hash the message & the private key for deterministic ECDSA?

Why go through the trouble of using the HMAC_DRBG process, instead of simply hashing [message | private key] to calculate $k$ for deterministic ECDSA? If the ...
1
vote
1answer
569 views

Why is AES unbreakable?

Why is it said that AES is unbreakable? Brute force attacks would take years to crack it, so is it possible to crack it if the computational speed of machines increase in the following decade?
1
vote
0answers
52 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
174 views

Keeping the key and IV safe when AES256 encrypting publicly known data

I am encrypting some publicly known data, and some private data using the same key, using AES256 with CBC. An attacker does not have the ability to choose what the public data is. Is this safe? (It ...
2
votes
3answers
295 views

If a cipher has key length shorter than plaintext, then it is not perfectly secure

I am trying to verify the statement above. So far I only know that a One-Time-Pad is the only “perfectly secure” cipher. It has a key length which is exactly the same as the plaintext. I think the ...
2
votes
1answer
121 views

Can IGE mode be parallelized?

As far as I know, in IGE mode (infinite garble extension) each block depends on the previous one. In that case, can the encryption be parallelized? Is there some way to do it?
1
vote
1answer
150 views

Performing differential cryptanalysis for randomly generated S-boxes

As far as I know, performing differential or linear cryptanalysis always requires a knowledge of the S-boxes' content and order. Yet in Bruce Schneier's Applied Cryptography, it is stated that random ...
-4
votes
1answer
105 views

how to integrate 2-3 algorithms to encrypt large data fastly and securely insted using AES? [closed]

I am thinking to build an encryption algorithm which take less time when encrypt large data such as video,mp3 and which has security credential.
1
vote
1answer
6k views

Simple example for CP-ABE (Ciphertext policy attribute-based encryption)

I'm currently working on Ciphertext Policy Attribute-Based Encryption (CP-ABE). So far I'm only using it with a basic understanding how it actually works. Now I want to understand it a bit better, but ...
0
votes
0answers
48 views

What work goes into creating new asymmetric cryptosystems?

It's seems to me that it is rather easy to create a symmetric encryption algorithm (though not necessarily a secure one). They're a dime a dozen. The number of asymmetric encryption algorithms ...
2
votes
3answers
156 views

How does $g$ being a generator imply Diffie-Hellman's correctness?

In the Diffie-Hellman protocol for key exchange over an unsecured channel, we choose $p$ and $g$, where $g$ is a generator of $\mathbf{Z}_p^*$. However I want to know why this assumption makes the ...
0
votes
1answer
169 views

Encryption of numeric value using playfair

I am studying in CSE and in my recent exam paper, A question was asked as: Construct a playfair cipher for Plaintext: semester5 and key:technology. Generally as we are taught yet, there is no ...
-1
votes
4answers
1k views

Secure way to encrypt and decrypt a folder on Mac or Linux? [closed]

I am looking for a way to securely encrypt files on Mac and Debian. OpenSSL comes pre-installed on Mac OSX and Debian/Ubuntu. Therefore, is this a safe/recommended way of encrypting individual files? ...
-2
votes
1answer
113 views

FEAL-4 Fk Function 4 Rounds

As I understood in FEAL-4 it needs 4 pair of round keys. Which means that we need to launch Fk function 4 times. My problem occurs starting the 2nd round. At the first round we have the original 64 ...
0
votes
0answers
50 views

Separate keys for encryption and MAC? [duplicate]

I use HMAC(ciphertext)+ciphertext for authenticated encryption. The same key is used for both MAC and encryption. Is that right? Is using separate keys for MAC and encryption necessary or any good? ...
4
votes
2answers
363 views

Signing Files vs. Signing File Hashes

What are the security pitfalls that may occur by signing a list of file hashes, versus signing individual files? In short, the security trade-offs between: ...
1
vote
0answers
29 views

Looking for an adjustable compute bound decryption function

I'm looking for a way to decrypt data, but make it require varying amounts of CPU power to do so. Maybe this could be illustrated as e(m) = m' and ...
4
votes
1answer
294 views

Is there a format preserving cryptographically secure hash?

I want a way to 'scramble' strings (like words, names) in a predictable way but I don't ever want to (myself or anyone else) be able to 'unscramble' the strings. I found that perhaps what I am ...
0
votes
1answer
114 views

Is adaptive security the same as full security?

This question contains a great answer about adaptive security, but I haven't yet found a proper definition what full security is. Does a stronger security than adaptive security exist or are the two ...
2
votes
1answer
384 views

Does the size of a ECDSA key determine the hash algorithm?

I am a bit lost in understanding what I read on authentication, signature, etc. For instance, is the size of the ECDSA keys produced by ssh-keygen -t ecdsa -b 256 ...
0
votes
2answers
223 views

Will SHA1 or Other Hash Functions Ever Contain Quotes [closed]

I feel foolish asking this, but will the hash generated by SHA-1 or other encryption methods ever have the possibility of containing a quote? Or any other characters that may be escaped such as ", ', ...
1
vote
0answers
74 views

Is the half-homomorphic property of RSA a problem for blind RSA signatures?

For blind RSA signatures, is it problematic that RSA is half-homomorph? Take a scenario where blind RSA signatures are used for something like a voting procedure or this proposal: Lots of people, ...
1
vote
1answer
166 views

Defence against timing attacks

I know this is a difficult subject but would a good defense against timing attacks be not sending a message if the decryption or authentication fails? So if the attacker provides a wrong HMAC for ...
1
vote
1answer
138 views

How difficult is it to get a key using simple XOR

Recently someone gave me an algorithm as follows: XOR = Key XOR Random1 XOR Random2. They think that in order for someone to extract "Key" from XOR they would need Random1 and Random2.. but looking ...
0
votes
2answers
86 views

Find the prime factorization in the DLP

Suppose we have $g^x \equiv h \pmod N$ Where $N = pq$ and $p$, $q$ are distinct primes. Also $(p-1)/2$ and $(q-1)/2$ are primes. If we know what $x$, $g$ and $h$ are, is it possible for us to know ...
0
votes
1answer
207 views

How to compare between two cryptographic algorithms in terms of security? [closed]

How to compare between two cryptographic algorithms (e.g. SHA-1 and SipHash) in terms of security? That is, how could one prove that algorithm X is more secure than algorithm Y?
0
votes
2answers
130 views

Multiple encryption of part of block

Is there any security risk in encrypting parts of blocks twice? I'd like to get around block sizes and make encrypted messages just as long as the unencrypted ones: Block 1: Byte 0 - 7 Block 2: Byte ...
0
votes
0answers
39 views

AES mode scheme feedback [duplicate]

I've been studying encryption on a hobby basis, and wanted to know if I got this basic cypher construction right (this is another experiment, see the AES ECB experiment thread earlier). Encryption: ...
0
votes
2answers
137 views

AES key from encrypted text and VI

So I'm trying to figure out if it's possible to extract the private key if you have the ciphertext and the IV corresponding to that ciphertext. It's for some kind of a challenge, and can't really ...
0
votes
1answer
111 views

AES different modulo operations

I don't get the modulo 10001 operation in mixColumns so much. If I have to take the byte computations mod 100011011 anyway what leads me to a result of 4byte length, why do I need the mod 10001 ...
-1
votes
1answer
160 views

Vigenere ciphers : Need help for math analysis

I've been learning about Vigenere ciphers and then thought of another method to Encrypt and decrypt that. This's my method to encrypt : ...
4
votes
2answers
548 views

How do we compute IV+1 in CTR mode?

This may be a very simple question, but I have not found info about this in any place. My question is about CTR mode: When it says $IV+1$… How do we make this operation? For example, if I have the IV ...

15 30 50 per page