0
votes
2answers
19 views

Diffusion in Shamir's secret sharing scheme

The popular command line utility ssss implements the classic Shamir's secret sharing scheme over the generic field $GF(2^q)$ with $8 \le q \le 1024$. When $q>=64$, the constant coefficient ($c_0$) ...
3
votes
1answer
35 views

Security of KDF1 and KDF2 (hash based KDF's)

It's still common to come across implementations of KDF1 and KDF2. Basically these are KDF's that simply derive multiple keys from the key seed and a counter: $K_i = KDF(K_{master}, i) = H(K_{master} ...
0
votes
0answers
28 views

XORing a header with SHA512-hash - secure?

I am writing a application that encrypts text several times and stores the result. The result looks like complete random bytes, therefore I add some random bytes at the end. To let the program know ...
-1
votes
0answers
31 views

Hybrid encryption with Textbook RSA [on hold]

A common variant of textbook RSA is the following: During key generation, the modulus $N$ is chosen as usual. We chose $e$ as $e:=3$ (instead of random). Then $d$ is chosen with $e\cdot ...
1
vote
2answers
45 views

How to calculate Modulo using a standard calculator for a one time pad encryption

I wrote a simple python script to preform one time pad encryption I would like to be able to decrypt the ciphertext by hand. In my script I use mod 26. This is how I was shown to calculate a mod ...
1
vote
1answer
28 views

MAC security and adversaries with memory

The usual definition of MAC security is (roughly) that there is no "efficient" adversary that has non-negligible advantage in the "MAC game" where the MAC game is as follows: the challenger chooses a ...
2
votes
1answer
68 views

Is there a reason that the N value in scrypt is limited to powers of two?

I have been looking at the scrypt hashing algorithm and am confused as to why the N value, which determines the overall cost, is limited to powers of two. There are ...
2
votes
1answer
55 views

Is the strength of RSA over quadratic or other cyclotomic fields as strong as over the integers?

If we assume the strength of RSA is based on the difficulty of factoring (which I know we can't guarantee) and we compose the modulus of some other quadratic ring that is a unique factorization domain ...
5
votes
2answers
203 views

Relation between key size and PRNG state size

Some (supposedly) cryptographically secure PRNGs have an internal state of only 160 bits or less. When the algorithm is otherwise properly designed, that seems like enough to generate a 128 bit key ...
2
votes
1answer
130 views

Is it necessary to use single hash function for signature generation and HMAC?

I am trying to figure out if we need to use single hash function across all the places in a ssh session. i.e – signature generation/verification and HMAC calculation/validation. Is it possible to use ...
1
vote
0answers
38 views

Cryptographic library quality [on hold]

I've been working on a project that will require secure communication over the internet, so I've been thinking of TLS 1.2. After looking around I chose Botan but then I thought about using a more ...
0
votes
1answer
87 views

What does it mean when two encrypted files, encrypted with the same method but with different keys, when xor'd together, produce a repeating pattern?

Let's say I have fileA and fileB, both encrypted somehow, but in the same method with different keys. If I xor them together, they will make a repeating pattern of 32 bytes length. What does that ...
-1
votes
1answer
65 views

Constants Differ in SHA1 implementation

https://code.google.com/p/crypto-js/source/browse/tags/3.1.2/src/sha1.js ...
0
votes
0answers
34 views

ECDSA verification is too slow [on hold]

I found that ECDSA is too slow while verifying signatures; can you tell me why? I'm planing to speed it up, so what tips should I consider to make it fast?
3
votes
2answers
135 views

How vulnerable is the C rand() in public cryptography protocols?

I just learned about the basics of public cryptography a few weeks ago and I am curious as to why the C rand() function should not be used for crypto schemes. For example, say I want to generate a ...
0
votes
2answers
124 views

Decrypting a small Message using RSA with a Private Key

If I have a private key of (43, 341), what would be the steps I need to take to decrypt a small message using RSA. I have looked ...
0
votes
0answers
28 views

RSA algorithm , decrypting a message [on hold]

I have to decrypt a message (24-264-291-291-220) using RSA algorithm given the private key. I did all the calculations and the decryption of that message is 74-66-48-48-55. My question is how would I ...
0
votes
0answers
16 views

Client-server authentication protocol suggestion [migrated]

I'm designing an authentication methods for my client/server system consisting of: a windows desktop client application (.NET) windows/linux servers (C++) one "security server" which authorizes the ...
-2
votes
0answers
49 views

RSA and ECDSA algorithms [on hold]

Hi, i want to learn more about ECDSA and RSA Digital signatures , could you give me both Algorithms for sign and verify the data.
1
vote
1answer
92 views

One time pad: why is it useless in practice?

The symmetric cryptosystem One time pad (OTP) seems to be very beautiful since it is perfectly secret according to Shannon. Many books, however, point out that the main drawback is that one must ...
-1
votes
0answers
40 views

mathematical derivation for elliptic curve cryptography [on hold]

how to derive the mathematical derivation for elliptic curve cryptography,please to send full detail derivation for elliptic curve cryptography,and also i need how to use the galois field in ...
0
votes
0answers
30 views

Is it possible to forge elgamal in a determinsic way? [on hold]

El Gamal is existentially forgeable, would it be possible to forge it in a deterministic way ,i.e., eliminating the randomness? Maybe by using fermats little theorem ?
0
votes
1answer
87 views

Is ElGamal still unforgable if the adversary knows r

Is ElGamal still unforgable if the adversary knows the value of $r$ that was calculated by $g^k$? When we do sign the message $msg$, we calculate $r = g^k$. As we know the regular ElGamal ...
0
votes
1answer
70 views

Using Stream Cipher as CSPRNG

Are there any guidelines or justification for converting a stream cipher algorithm for use as a CSPRNG? For instance, lets say I wanted to convert one of the eStream portfolio Profile 1 (software) ...
1
vote
1answer
92 views

Is there a method to combine encryption and ring signing?

There's the well-known question on whether to sign or encrypt first. However, if instead a message is to be ring-signed such that either recipient could be the actual signer, is there any scheme that ...
1
vote
1answer
52 views

Do Chosen-Chiphertext attacks only apply to public-key cryptosystems?

Do Chosen-Chiphertext attacks (CCA-1/2) only apply to public-key Cryptosystem?
0
votes
1answer
88 views

ECDSA Public Key generation

Referring to both Wikipedia page and ECDSA-cert paper I can understand that, given $\mathcal{E} = \mathcal{E}(a,\,b,\,\mathbb{F}_{2^m})$ as our elliptic curve on $\mathbb{F}_{2^m}$ group $G \in ...
1
vote
1answer
81 views

The relationship between the key length and encrypt time in Xor algorithm?

I did work on the encryption algorithm and the decryption using the XOR method noticed that when more the key length, the less time spent on encryption and decryption. I have two questions in ...
2
votes
3answers
305 views

Would it be possible to create a game where one would need to decrypt a simple encryption?

This might sound pretty weird, but I was thinking of a game a person could play alone with a pen and paper. I got this idea where the person would write a random four letter string on a paper, and ...
2
votes
1answer
53 views

Security of permutation cipher

I would like to understand how secure the permutation cipher is. I would specifically like to understand the following concrete setup: If the alphabet is $L = \{0,1,\dots , 255\}$ and $\sigma_1, ...
0
votes
0answers
67 views

Is it possible to crack any MD5 hash? [on hold]

I really wonder is it possible to crack any MD5 hash?
5
votes
7answers
406 views

Turning a cipher into a hashing function

This is theoretical question. I'd like to know if it's possible (and what are eventually the consequences), not that I'm going to do it in one of my projects. ;) The first hashing functions created ...
1
vote
0answers
33 views

Would usage of jCryption 3.0 + SSL have mitigated the Heartbleed vulnerability? [migrated]

I came across a project called jCryption 3.0, which encrypts data between the client and server, without using SSL. If a website's JavaScript had used jCryption 3.0 to encrypt login form fields before ...
-1
votes
1answer
184 views

How can I convert numbers into prime numbers?

I'm working with one-way accumulators, but I'm not knowledgable in cryptography. Is there an easy peasy way to hash numbers (or whatever) into prime numbers? Obviously I'd like it to be collision ...
1
vote
0answers
32 views

What happens if biometric data is stolen? [migrated]

This question isn't very specific, but I think it would be ok to post it in the cryptography StackExchange (hopefully). As we move toward a future where fingerprints might possibly replace passwords, ...
0
votes
1answer
81 views

Existence of a map $\phi:\mathbb{Z}_{N^2}^* \mapsto \mathbb{F} $

Is there a map between the group of $\mathbb{Z}_{N^2}^*$ where $N$ is a composite number , a product of two equal size secure prime numbers $p$ and $q$ and a finite field $\mathbb{F}$, such that for ...
0
votes
1answer
53 views

Composing hashes and/or MACs

Suppose I have n hash/MAC functions, of which n-1 are extremely insecure, leaving only one that is in fact cryptographically secure. If I use all of them on a message and the XOR them together the ...
0
votes
0answers
26 views

Is anyone aware of Du atallah multiplicative secret sharing scheme for dot products for > 2 party scenario?

I am working on Du Atallah's multiplicative secret sharing scheme for more than 2 party scenario. Is anyone aware of its multiparty version (more than 2 parties). The paper for 2 party can be found ...
-1
votes
0answers
40 views

Which commitment scheme is better for malicious models [on hold]

Can some one suggest which scheme is better for malicious models in terms of efficiency and security? A Pedersen's VSS based scheme or the one based on Fiat-Feige-Shamir digital signatures ?
0
votes
0answers
83 views

SSL-like protocol with public-key hard-coded in the client

Imagine a SSL-like protocol that instead of using certificates signed by a trusted CA, has the server's public key hard-coded in the client. My question is: what happens if the server's private key is ...
1
vote
1answer
76 views

Sequence of Encrypting RSA like Chaum Blinding scheme

I'd be a noob in cryptography but reading up a little on RSA, I do get some understanding and I want to specifically resolve this issue. UPDATED Lets say we have the following values in place: ...
0
votes
0answers
20 views

Decrypt Passwords based on using a user's password [migrated]

I am creating a database to store our client's information at work (a heritage center specializing in DNA based genealogy. Once the results of a test come back we have people that use the information ...
3
votes
1answer
62 views

Has there ever been more then a theortetical difference between preimage resistance and second preimage resistance?

In other words, has there ever been a point in time in which having the content of a message has actually helped break a hash function?
11
votes
2answers
673 views

Are AES-256's related-key weaknesses exploitable if it is used to build a hash?

Assume it is made a hash based on AES-256 encryption (perhaps because this is hardware-accelerated, but no standard hash is); and it is used the Merkle–Damgård structure, that is padding of the ...
1
vote
0answers
49 views

SHA256 Padding and Parsing [closed]

Can anyone please help me with basic Verilog Structure for Padding and Parsing stages of SHA256. I have Googled it a lot but couldn't find it. I'm stuck at How to check the Size " L " of the random ...
3
votes
2answers
167 views

Are there any elliptic curve asymmetric encryption algorithms?

RSA offers the functionality of encrypting (short messages, or symmetric keys) with a public key, and decrypting with a private key. However, RSA key generation is extremely expensive, especially for ...
1
vote
1answer
134 views

Leak-proof protocol: is such a thing possible?

Is it possible to design a protocol that by itself guarantees that a malicious implementation cannot leak secret data without breaking the protocol? Setting: Alice and Bob have a pre-shared secret ...
5
votes
1answer
115 views

Block cipher and parity of permutation

Can anyone explain the following text passage to me? Most real-world block ciphers build even permutations, because it's hard to build odd ones using small operations (32 bit) on larger (128 ...
0
votes
0answers
64 views

Could program verification techniques prevent bugs of the genre of Heartbleed from occurring? [migrated]

On the matter of the Heartbleed bug, Bruce Schneier wrote in his Crypto-Gram of 15th April: '"Catastrophic" is the right word. On the scale of 1 to 10, this is an 11.' I read several years ago that a ...
0
votes
2answers
104 views

Does AES-128 have the same strength as AES-256 with a padded key?

When I use the same 128-bit key for AES-128 and AES-256 with a known/public padding for the latter, is there some weakness in AES-256 that is not present in AES-128 with essentially the same key? ...

15 30 50 per page