Cryptography Stack Exchange is a question and answer site for software developers, mathematicians and others interested in cryptography. It only takes a minute to sign up.

Sign up to join this community
Anybody can ask a question
Anybody can answer
The best answers are voted up and rise to the top

Explore our questions

0 votes
0 answers
16 views

If mac M is defined as M(k,x) = f(k||x) where f is one way function, can M be UNF-CMA secure Mac scheme?

1 vote
1 answer
298 views

What is meant by software and hardware implementations? How to do it?

1 vote
2 answers
62 views

MAC from PRF secure under different restriction

1 vote
1 answer
257 views

Decrypt a ciphertext knowing of a pattern of key repetition

5 votes
1 answer
112 views

Conformance of Windows Random Number Generator (SP800-90A) with Key Lifecycle Security Requirements of the BSI

0 votes
0 answers
19 views

Recursive snarks with a genus-2 no-cycle hyperelliptic curve?

0 votes
0 answers
17 views

Subkeys of multiple generated sets not combineable Shamir Secret Sharing

2 votes
3 answers
475 views

Check if encrypted text is equal without decrypting or doing heavy calculation - AES

1 vote
0 answers
60 views

Pseudo random generator notation

2 votes
1 answer
68 views

$\epsilon$ parameter choice in lattice-based schemes

1 vote
1 answer
101 views

Post-quantum EU-CMA security from OWF-only

1 vote
1 answer
93 views

RSA signature with random padding

1 vote
0 answers
32 views

TR-31 Key Exchange Mode of Use

10 votes
2 answers
3k views
+100

In textbook RSA with low public exponent, how big does a random message needs to be?

Browse more Questions