0
votes
1answer
21 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 ...
0
votes
0answers
18 views

Is it possible to crack any MD5 hash?

I really wonder is it possible to crack any MD5 hash?
-2
votes
0answers
12 views

Cryptography, Number Theory and RSA

cryptography, number theory and RSA
-3
votes
0answers
13 views

Number Theory, Trying to solve this

This is Number theory, cryptography and RSA
-2
votes
0answers
24 views

Number Theory, Cryptography

Cryptography. Number Theory, RSA
2
votes
1answer
25 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
11 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 ...
0
votes
1answer
19 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
18 views

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

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 ...
0
votes
1answer
37 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
16 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 ...
0
votes
0answers
29 views

Which commitment scheme is better for malicious models

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
1answer
62 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
0answers
68 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 ...
0
votes
1answer
132 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
31 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
0answers
19 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
55 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?
5
votes
1answer
102 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
62 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 ...
1
vote
0answers
43 views

SHA256 Padding and Parsing [on hold]

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 ...
-1
votes
1answer
41 views

Positioning of keys in encrypted text

I'm just looking at very simple encryption. I've noticed that the key is typically either at the front or at the back of the encrypted text. This is quite easy to break if you know the key. It can ...
1
vote
1answer
34 views

What is a 'secret key factory'? What precisely is it doing? [on hold]

I have found a Java implementation of AES CBC mode that runs in Netbeans. The lines below appear to create the key from password and salt: ...
0
votes
1answer
20 views

Does IKEv2 protocol have two modes like IKE

IKE Protocol have 2 modes, that modes have different structure. Does IKEv2 protocol have two modes like IKE.
3
votes
2answers
143 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 ...
0
votes
0answers
5 views

Certificate Revocation List [migrated]

There are many fields on a certificate revocation list (CRL) like Algorithm, Parameters, Issuer Name, This update date, Next update date, user certificate serial #, etc. While I understand the purpose ...
1
vote
1answer
58 views

Exchanging Keyspace and Message space in PRF

Suppose there is a secure PRF $F: K \times X \to Y$. Then is $F': X \times K \to Y$, defined by $F'(x,k):=F(k,x)$, a secure PRF? In my opinion it should be because exchanging the keyspace with ...
2
votes
2answers
78 views

does re-encrypting the same value with multiple keys reduce security

I found myself wondering today, how much security is lost if you take a plaintext - assume that its content, including any metadata is unknown to an attacker, for example it may be random data - and ...
0
votes
2answers
97 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? ...
-1
votes
2answers
28 views

How to make sure the pre-agreed information safe for DH-Key Exchange

The definition of DH key exchange was given as the method let two authenticate each other & exchange the crypto key over an insecure channel. DH-key-exchange was innovated to defence ...
-2
votes
0answers
48 views

Compute in GF(2^8) [duplicate]

(x^4+x+1)/(x^7+x^6+x^3+x^2), where the irreducible polynomial is the one used by AES, P(x)=x^8+x^4+x^3+x+1. I think I need to ...
1
vote
1answer
45 views

In Pedersen Key Distribution, can the public key be persistent?

I am implementing a key distribution protocol described by Torben Pedersen in A Threshold Cryptosystem without a Trusted Party (EUROCRYPT'91). In the protocol, the $n$ parties distribute a public key ...
11
votes
2answers
646 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 ...
0
votes
1answer
36 views

How to understand authenticator working process [on hold]

Now days authenticator are used widely, however as a beginner to cryptography, I'm confused on the mechanism of key refresh. How it works ? Is that related to DH-key-exchange or the server will change ...
1
vote
1answer
114 views

How to select $g$ in Paillier Cryptosystem

For my cryptography class project in university I have selected Paillier Cryptosystem as a course project ...
-1
votes
1answer
55 views

How do they implement MAC in TLS?

I recently read questions about "MAC then Encrypt/Encrypt then MAC" which made me curious about how they actually use the algorithm. MAC only calculated once either case (according to what I read). ...
1
vote
1answer
74 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: ...
1
vote
0answers
46 views

A known-plaintext attack on an LFSR-based stream cipher

I am reading a book about Cryptography, and I am stuck in a question. I am really trying to solve it for weeks. But I think the problem is I couldn't understand the whole picture. The question was ...
0
votes
2answers
84 views

Perfect Forward Secrecy in TLS

I read that TLS does PFS using Diffie Hellman. However, DH can be used even without certificates - so how is DHE-RSA better than plain DHE? Is DHE a insecure algorithm, that DHE-RSA is needed?
1
vote
0answers
54 views

How we can said a crypto system have perfect secrecy?

For example: I have 3 plaintexts ($a$, $b$, $c$) and 4 keys ($K_1$, $K_2$, $K_3$, $K_4$), making a table map to the cipher text, key as row and plaintext as column $\begin{matrix} \ \ \ \ \ \ \ \ \ \ ...
1
vote
2answers
90 views

Why do some block cipher modes of operation only use encryption while others use both encryption and decryption?

In Chapter 6, Question 6.8, of his book “Cryptography and Network Security Principles and Practices”, William Stalling asks: Why do some block cipher modes of operation only use encryption while ...
3
votes
0answers
105 views

Security of RSA for paranoids with padding?

RSA for Paranoids (RSAP) (in cryptobytes v3n1), also known as Unbalanced RSA, is a variant of RSA proposed in 1995 by Adi Shamir, as a mean to increase the RSA public modulus size while keeping ...
1
vote
0answers
53 views

El Gamal encryption scheme and symmetric encryption scheme

Consider the El Gamal encryption scheme, a symmetric encryption scheme (KG,E,D), and the following hybrid encryption scheme having an encryption algorithm that, on input a public key (G,q,g,h), where ...
2
votes
1answer
85 views

Why does HMAC need a fixed length padding?

As everybody knows in order to calculate HMAC we have to concatenate padding to the message. I am just curious why the padding needs to be fixed-length. Why do we need the blocksize parameter here? ...
0
votes
0answers
52 views

New modulus or new key pair?

I have this assignment question that I'm not sure how to answer. Any insight would be helpful. In the RSA public-key encryption scheme, each user has a public key, e, and a private key, d. Suppose ...
1
vote
1answer
41 views

Disadvantages of one-way accumulators?

One-way accumulators are built upon a (quasi)-commutative one-way function. With quasi-commutativity, I refer to the following property: For $f : X \times Y \to X$, it is true that $f(f(x, y_1), y_2) ...
0
votes
0answers
53 views

Basic Encryption Tests [on hold]

For study purposes I have created a block cipher as a bit of fun. Everything appears to be working really well to me, but what steps are normally taken in investigating whether an encryption algorithm ...
4
votes
1answer
116 views

Why are collision attacks important when talking about MAC schemes?

I'm reading Ferguson, Schneier, and Kouno's Cryptography Engineering, and it has a section on MACs. It discusses different types of MACs, but it seems to claim that to acheive 128-bit level security, ...
1
vote
1answer
40 views

Showing that security of a elgamal invariant is insecure

Original Elgamal signature is defined $S(m, \alpha) = (r, s)$, where $$r = g^k \bmod p$$ $$s = (m – r*α)k^{-1} \bmod (p – 1)$$ more information on Elgamal signature can be found here. Variant ...
3
votes
1answer
120 views

Given a message and signature, find a public key that makes the signature valid (ECDSA)

This question is a variant on Given a message and signature, find a public key that makes the signature valid, which discusses the analogous question for RSA. It was suggested to me by this post over ...

15 30 50 per page