0
votes
0answers
120 views

The Inhomogeneous Short Integer Solution (ISIS) problem with a clue

The Inhomogeneous Short Integer Solution (ISIS) problem is as follows: given an integer $q$, a matrix $A \in \mathbb Z^{n\times m}_q$, a vector $b\in \mathbb Z^n_q$, and a real $\beta$, find an ...
1
vote
0answers
31 views

WPA and WPS: connection method [closed]

Do clients use WPS every time when they connect to a WPS-enabled AP? Or maybe they do it just the first time and then they switch to a normal WPA/WPA2 key exchange? If the latter, it's possible for ...
0
votes
2answers
112 views

Self verifying hash algorithm

For quite some time I've been thinking about the idea to construct a hashing algorithm that contains its own checksum value, and thereby can verify itself. With hashing algorithms like SHA1 and MD5 ...
2
votes
2answers
105 views

Inconsistent terminology for ciphers and algorithms

I've been baffled by all the different kinds of names which are given to cryptographic algorithms. There are block ciphers and stream ciphers (AES and RC4). There is symmetric and asymmetric ...
0
votes
0answers
52 views

Attack on key exchange with authentication

Suppose the honest parties - Alice and Bob - exchange public key in person/via telephone so that attacker can only eavedrop on the line. Alice has hashed the public key using a collision resistance ...
1
vote
1answer
71 views

Security of integrity protection with HMAC vs AEAD

I'd like to know how the security of the integrity protection compares between: HMAC-SHA-256 with an 32 byte tag or a truncated 16 byte tag AES-GCM with a 16 byte tag AES-CCM with a 16 byte tag or ...
1
vote
1answer
70 views

RSA padding confusion attacks

Server A produces signed messages on request. You can tell server A what type of RSA padding to use in the signature (either RSASSA-PKCS1v1_5 or RSASSA-PSS). Either way, the message will be signed ...
9
votes
3answers
871 views

What is the difference between uniformly and at random in crypto definitions?

Very often in the description and analysis of a cryptographic protocol there is a need for a an element $k$ that is sampled uniformly AND at random. Is there a redundancy in the definition with ...
1
vote
0answers
158 views

FileVault AES-XTS decryption with cipher text that's missing a part

My mac was recently upgraded to OS X Yosemite and FileVault2 full disk encryption was turned on. Encryption finished, but things went horribly wrong and key parts of the disk are filled with all 0s ...
0
votes
3answers
238 views

When is a cipher considered broken?

We've all read how some people claim AES is broken because there was supposedly a way to get the plain text from a cipher text faster than brute-force. But is this the definition? Is a cipher broken ...
1
vote
0answers
31 views

What is the difference between any secret sharing scheme and arithmetic secret sharing scheme

It looks like that only difference between two of them the variables. But it does not make sense for me and I could not find exact definition of arithmetic secret sharing scheme. I mean what exactly ...
6
votes
5answers
1k views

What is the difference between a hash and a permutation?

As defined by Wikipedia a hash function is [...] any algorithm or subroutine that maps large data sets of variable length to smaller data sets of a fixed length. For example, a person's name, ...
1
vote
1answer
65 views

Why are modes of operation used, what attacks do they prevent?

I know you always need to use a mode of operation when using a block cipher, AES for example, and Wikipedia has a good explanation for what modes of operation are Now I know if i do not use a mode of ...
1
vote
1answer
133 views

Is creating a own protocol safe or should TLS always be used?

The more I start to learn about cryptography the more I hear it is unsafe to 'create' your own cryptographic protocol. With this I mean combining cryptographic primitives like HMAC, AES and RSA ...
4
votes
1answer
148 views

Can the same random number be used in encryption and signing?

In several public key algorithms, the person running the algorithm must generate a random number (that's separate from the key). Can this random number be the same for an encryption and a signature? ...
0
votes
1answer
25 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
43 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
199 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
148 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
57 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
702 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?
1
vote
3answers
442 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 ...
3
votes
1answer
264 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?
4
votes
2answers
200 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
164 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 ...
2
votes
1answer
96 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
54 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
86 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
30 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
268 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'$ ...
0
votes
0answers
59 views

Key length requirement in a simple XOR implementation

I don't have much previous experience at all with cryptography, this is pretty much the first time I've tried anything similar. I'm trying to implement an extremely simple XOR encryption system in ...
1
vote
1answer
134 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
368 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 ...
0
votes
1answer
311 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
49 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
116 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
197 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 ...
1
vote
0answers
61 views

Security implications of public nonce

I'm planning to use the crypto_box() functions of Nacl (or, alternatively, the crypto_box_easy() functions of libsodium) to ...
2
votes
1answer
70 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?
3
votes
1answer
421 views

Safe elliptic curve point addition using projective coordinates: How do I tell if the points are the same?

I am trying to implement elliptic curve point addition in hardware for NIST p256 and p384 curves. I have noticed the following issue with the suggested NIST routines: Consider routine 2.2.7 of ...
0
votes
0answers
36 views

Transport SA bundled inside a tunnel with encryption applied before authentication?

For IPsec I am considering different formats of ESP encryption and authentication. I am not sure what happens with "Transport SA bundled inside a tunnel with encryption applied before ...
1
vote
1answer
105 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
51 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
5k 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
46 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 ...
1
vote
3answers
116 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
97 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
612 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? ...

15 30 50 per page