1
vote
0answers
50 views

Infer encoding mechanism from $n$-grams distance?

I have a series of obfuscated strings which across the set of strings have regions of high variance and regions of low variance – implying some encoding mechanism as opposed to an encryption procedure ...
0
votes
1answer
96 views

A one way Function provably reversible at N applications with the same seed?

I'm looking for a function that is generally one way from some secret $F(s, A) \rightarrow Y$, where $A$ is known, $Y$ is produced (also known), and $s$ is kept secret. But whose repeated application ...
2
votes
2answers
122 views

Is it safe to salt a MAC?

Say that I define a scheme where the salt is public and is MAC-ed with the message: $k = KDF(password, salt)$ $tag = MAC_k(salt || message)$ Is it safe to salt the MAC this way? Assume that the salt ...
1
vote
2answers
364 views

Use case of RSA CRT

I discovered the CRT version of RSA cryptosystem which is used in many crypto libraries (openSSL, Java...). The use of the Chinese Remainder Theorem improves the speed of decryption so why it's not ...
0
votes
1answer
65 views

Efficiently show/prove knowledge of third party secret without leaking information

Say Alice publishes (i.e. all parties in the universe) a key or certificate $x$ and sends a secret $s$ to Bob. Bob then publishes some data $d$ (his identity or a message or smt.) and an ...
2
votes
1answer
206 views

How secure is a lagged fibonacci sequence for encrypting brief messages?

Say I start with a 26-letter keyword and convert the letters into 26 integers (A=0, B=1...Z=25) nr[0] to nr[25]. Then I create a stream, nr[26] onwards, with a lagged fibonacci sequence where nr[n]= ...
6
votes
1answer
500 views

What do you call one time pad where pseudo-random numbers are used?

What is the encryption method called when pseudo-random numbers are used instead of true random numbers?
0
votes
1answer
120 views

Is there any probabilistic version of RSA?

I have now studying the RSA, but I think that is it possible to have some probabilistic version like a random bit string "r" XORed with the key? Is there any probabilistic version of RSA? Thak you ...
2
votes
2answers
170 views

Large file validation on an embedded system through hash and encryption

As a preface, I have to say that I am a noob in this area. Having said that, I will ask the question. I have a situation where I need to validate and protect against tampering a handful of large ...
1
vote
1answer
100 views

DES-X , computation load and storage

The passage said that the computational load to attack DES-X can be reduced to approximately $2^{(56+64)}=2^{120}$ steps,and the storage of data sets should be $2^{64}$. But I can't figure why ...
1
vote
1answer
130 views

What can be learned from the ciphertext of LibSodium's crypto_box_detached()?

LibSodium, (https://github.com/jedisct1/libsodium), has a function crypto_box_detached() which does authenticated encryption using the public key of the recipient ...
2
votes
1answer
199 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
1answer
103 views

Is AES's parity key-dependent?

Is the parity of the permutation of the set $\{0,1\}^{128}$, defined by AES encryption for a certain fixed key, dependent on this key? DES, and any pure Feistel cipher, has even parity for any key. ...
2
votes
1answer
99 views

Recover plaintext in passive attack of RSA of coprime public key

I have a situation in RSA like this. Charles sends same message $m$ to Alice and Bob encrypted with $e_A$ and $e_B$ respectively. It happens that he they are under same modulus $n$ and $gcd(e_A, ...
0
votes
1answer
47 views

How are salt values more secure? [duplicate]

If a database stores password encrypted by using salt values, how are they stored? I read somewhere, it uses timestamps. So is the timestamp also stored? How about when a user tries to login next ...
1
vote
2answers
143 views

Operation which needs much computing power to be created, but just a little to be solved?

Does somebody know a cryptographic/mathematic operation, that needs much computing power to be "encrypted"/"created" but doesn't need much power to be "decrypted"/"solved"?
-1
votes
1answer
211 views

What are the advantages of Certificate Authority and Key Distribution Center over each other?

I want know difference among them. What are advantages/disadvantage of one on other?
5
votes
1answer
322 views

Interpretation of the results of NIST (p)NRG suite

I have problems interpreting the NIST (sts-2.1.2) suite results. After running the statistics with 100 samples (each sample of 1000000 byte length) a new prng i got this result: ...
5
votes
2answers
260 views

Secure way to derive separate encryption and MAC keys from a single master key?

I want to derive a 256 bit encryption key and a 256 bit MAC key from a single 256 bit master key for an authenticated encryption scheme. I was considering the following construction to derive the two ...
2
votes
3answers
566 views

Format Preserving Encryption for 32 or 64 bit plaintext values

I am looking for a Format Preserving Encryption implementation to apply to either a 32-bit or a 64-bit integer. It looks like AES/FFX mode is just what I need in terms of established security ...
-1
votes
1answer
83 views

Convert message to polynomial NTRU

How to make a message into a polynomial? I saw many answers to this question and yes, i know that here are some questions. But i did not get it. I think that i am making some mistakes. I took a word ...
6
votes
3answers
741 views

What is the use of Mersenne Primes in cryptography

There is an international search for Mersenne Primes. The project is huge. But what is the use of Mersenne Primes in cryptography? Do they have any other properties other than the $2^n-1$ form?
0
votes
0answers
26 views

Computing the redundancy of language for a Vigenère cipher with m=5

Redundancy of L = 1- Entropy of L/ log base 2 {P} The Redundancy of L is given by 1 minus the Entropy of L divided by log base 2 of the Cardinality of the Plaintext space. Could someone advise me how ...
1
vote
1answer
62 views

Where is defined the fact of having a “learning” and “challenge” phase in cryptography proofs?

I've read Bellare and Rogaway 2004 and Shoup 2004 about game-based cryptography proofs, but I lack precisions about how should be built the "learning" and "challenge" phases, since my games will ...
8
votes
2answers
238 views

How Secure is a Pronounceable Password? In means of entropy

There are some strong studies which support the use of pronounceable passwords and multiple tools which provide generation of such passwords. According to this question the entropy of a password ...
0
votes
1answer
84 views

Prepending random data to encrypted file

If random data is prepended to a file encrypted with GNUPG's symmetric encryption, how may an attacker find out if the input file is deliberately corrupted or the passphrase is wrong? If it is not ...
0
votes
1answer
150 views

Proof that counter mode of operation and CBC mode are CPA secure when pseudorandom permutations?

I know counter mode can be CPA secure, when used with block ciphers modeled as random permutations. If we use pseudo-random permutations, is it still CPA secure? Is there a proof? How about CBC ...
0
votes
1answer
71 views

Encrypt a file for random access but only after an initial read of the whole file

I'm symmetrically encrypting a file (using a random salt and a user supplied password with PKCS5S2, i.e., nothing special) and I need to be able to access it randomly. Therefore I'm using a stream ...
1
vote
2answers
224 views

Does google's Crypto.JS AES encryption use PBKDF2 as default?

Does google's Crypto.JS AES encryption use PBKDF2 as default? Some references, but I can't figure out the answer myself: https://code.google.com/p/crypto-js/#The_Cipher_Algorithms ...
1
vote
0answers
88 views

To prove $r_2$ is a uniformly at random value in $Z_n$, where $r_2=r_1 . m$

$m$ is arbitrary value in $Z_n$, where n is RSA modulo. Then we do: $r_2=r_1 . m (modn)$, where $r_1$ is a random value such that $r_1\in Z^*_n$. ** Question(1): is $r_2$ a uniformly at random ...
3
votes
2answers
312 views

Small Prime Difference in RSA

In RSA, the $p$ and $q$ should be randomly generated, and they are the same size. The difference between $p$ and $q$ should not be small. Suppose that $u=|p-q|<20$ and $p \times q ...
1
vote
1answer
114 views

Protection of Elliptic Curve Implementations against side-channel attacks [closed]

Recent fast elliptic curve implementations, for example a presentation at Eurocrypt 2014 (earlier presentation slides, the paper) talks about protection against only timing attacks. Why only timing ...
3
votes
2answers
162 views

Does a stream cipher require a KDF when it's key is variable length?

RC4 has a variable length key. Is it still necessary to use a key derivation function, such as PBKDF2, to initialize it? Would using a single character password weaken it's output when compared to a ...
1
vote
1answer
190 views

Security of chameleon hash functions

With the knowledge of the trapdoor, we are able to compute the same digest for differents messages. I've read that given two messages $m$, $m'$ and two numbers $r$, $r'$ such that ...
4
votes
1answer
748 views

ZIP 2.0 encryption bruteforce attack

I have an old sourcecode backup from my DOS days stored in a ZIP 2.0 encrypted archive, but I lost the password. The password was written on a paper slip, but I remember that it consisted of 30+ ...
4
votes
1answer
80 views

Can we run a probabilistic function on ciphertext with Functional Encryption (or Attribute Based Encryption)?

In the definition of functional encryption ($FE$): $FE.Setup(1^k)$ takes as input the security parameter $1^k$ and outputs a master public key $fmpk$ and a master secret key $fmsk$. $FE.KeyGen(fmsk, ...
1
vote
1answer
238 views

problem with “one time pad” [closed]

I am a french student and I read the post on the forums (How does one attack a two-time pad (i.e. one time pad with key reuse)?). I need your help if possible. I 'm 11 encrypted messages , all ...
1
vote
0answers
88 views

Does the transposition cipher have a network application?

So I'm reading a chapter in my networking book and it talks about substitution and transposition ciphers (Transposition Cipher Wikipedia). I know that most network security uses public key or ...
3
votes
1answer
91 views

Why can't garbled circuits be reused?

There are a bunch of papers do research on resizable garbled circuits. But I wonder why garbled circuits cannot be reused? For example, the constructor constructs a garbled circuit of "AND" like ...
2
votes
1answer
103 views

Implementation of garbled circuits using RSA

I was just reading these notes on garbled (Yao) circuits and I just stuck trying to figure out how an implementation of Table 1 would work using RSA encryption. In RSA the public key is (n,e). So for ...
3
votes
1answer
121 views

What does “learnable with oracle queries” mean?

I came across the following quotes in reading papers on obfuscation (1, ibid, and 2): The next result follows from the fact that point functions are not exactly learnable (since a uniformly chosen ...
0
votes
1answer
78 views

MD5 update functions

In the hashlib module in python is a function called m.update() where m is a ...
0
votes
0answers
75 views

initiate the elliptic curve

when we consider a curve in a prime field for example Weierstrass form and want to initiate it in Miracl,we should give these inputs for initiate curve: ebrick_init(&binst,x,y,a,b,n,window,nb) ...
0
votes
0answers
203 views

Existential Unforgeability of signature scheme against Adaptive Chosen Message Attack

While reading a literature on signature schemes, I came across the concept of Existential Unforgeability of signature scheme against Adaptive Chosen Message Attack. Can anyone point me to the paper ...
0
votes
1answer
116 views

blowfish ecb with openssl doesn't give the expected result

I do the following via the Linux CLI: ...
0
votes
1answer
56 views

HMAC_DRBG Generate Process: requesting N bytes at once different from requesting N bytes in total?

Am I correct in assuming that HMAC_DRBG would return different results if I, e.g. first request 4 bytes followed by a request of another 4 bytes instead of asking for 8 bytes at once? It seems that ...
-1
votes
1answer
193 views

Prove that the affine cipher over Z26 has perfect secrecy if every key is used with equal probability of 1/312

Prove that the affine cipher over Z26 has perfect secrecy if every key is used with equal probability of 1/312. Just some guidance/help with this problem would be greatly appreciated not sure how to ...
1
vote
1answer
130 views

Chess Grandmaster Problem and “Valid” Attacks on Zero-Knowledge Proofs of Identity

A long question here, but I really want to motivate why I'm confused. Consider the following attack on the Schnorr Identification Scheme. Alice chooses a random $k$, computes $\gamma = \alpha^k ...
0
votes
1answer
132 views

Encrypting twice with different modes?

I was using a SOCKS5 proxy today (tunneled through SSH) and I began to wonder what the effect of encrypting twice (TLS over encrypted SOCKS5 in this case) would have on the security of the transmitted ...
0
votes
1answer
102 views

I need to know number of encryption/decryption operations? [closed]

If i want to break quadruple DES (say EDED), what is complexity? Like for EDE, it is O(2^112).

15 30 50 per page