Skip to main content
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Saves in:saves
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options not deleted user 64

Analysis of individual security aspects of a cipher or algorithm, not the security of a cipher or algorithm in general (which would lean towards “algorithm-design”).

2 votes

Where can I find useful data for cryptography/coding theory?

If you use a high-level mathematical language (Mathematica, Maple, etc.), generating this data is very easy. I use Mathematica personally, but some are free and apparently very good. In a pinch, you …
PulpSpy's user avatar
  • 8,717
7 votes
Accepted

Can you help with that definition for a CCA?

In step 2, the adversary outputs two messages. One of these will be selected at random for encryption. You can think of the adversary sending these messages to a "challenger" that also has oracle acce …
PulpSpy's user avatar
  • 8,717
2 votes

For public-key encryption, why does COA resistance imply CPA resistance?

I have a definition of COA-security in my head but I cannot find this definition (applied to public key cryptography) in the literature or reference books. Under it, textbook RSA is an example of a …
PulpSpy's user avatar
  • 8,717
16 votes

Definition of textbook RSA

RSA is both an encryption and signature function. I have heard the term "textbook RSA" used mostly with the encryption function, but the same basic principle applies to RSA signatures as well. It is e …
PulpSpy's user avatar
  • 8,717
6 votes
Accepted

Is there some way to generate a non-predictable random number in a decentralised network?

A service that provides such numbers is called a random beacon. Since everyone has to agree on what a beacon's value is and peers may not have a complete view of the network, it is very difficult to …
PulpSpy's user avatar
  • 8,717
11 votes

How to attack a classical cipher using known partial plaintext?

I do not have a solution, but I pursued the cipher long enough to establish it wasn't one of the easy classical ciphers. This approach should get you started. The first thing you want to do is conver …
PulpSpy's user avatar
  • 8,717
40 votes

Are there two known strings which have the same MD5 hash value?

A new result shows how to generate single block MD5 collisions, including an example collision: Message 1 Message 2 > md5sum message1.bin message2.bin > 008ee33a9d58b51cfeb425b0959121c9 message1.bin > …
PulpSpy's user avatar
  • 8,717
6 votes
Accepted

How to forge Schnorr signatures if you can guess the challenge

In the other answers, you'll find how to simulate a proof if you know $e$. This answer is meant to provide some "color commentary" on the other answers. It is a companion piece. Notation In step 1 …
PulpSpy's user avatar
  • 8,717