Cryptography
PulpSpy's user avatar
PulpSpy's user avatar
PulpSpy's user avatar
PulpSpy
  • Member for 11 years, 10 months
  • Last seen more than 9 years ago
Profile Activity
Stats
8,537
reputation
550k
reached
89
answers
3
questions
Communities
View all
About

Postdoctoral fellow interested in authentication and cryptographic voting.

Badges
View all badges
1
gold badge
28
silver badges
45
bronze badges
Top tags
View all tags
199
Score
18
Posts
20
Posts %
119
Score
15
Posts
16
Posts %
101
Score
9
Posts
10
Posts %
89
Score
8
Posts
9
Posts %
69
Score
12
Posts
13
Posts %
65
Score
11
Posts
12
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
answer
94
Time Capsule cryptography?
Sep 3, 2011
answer
39
Are there two known strings which have the same MD5 hash value?
Jan 30, 2012
answer
36
Random oracle model proofs and programmability
Dec 8, 2011
answer
22
ElGamal: Multiplicative cyclic group and key generation
Jan 5, 2012
question
22
Mapping points between elliptic curves and the integers
Aug 3, 2011
answer
21
How to fairly select a random number for a game without trusting a third party?
Sep 24, 2011
answer
18
Can Elgamal be made additively homomorphic and how could it be used for E-voting?
Aug 24, 2012
answer
16
Is H(k||length||x) a secure MAC construction?
Nov 14, 2011
answer
16
Definition of textbook RSA
Dec 12, 2011
answer
15
Are there asymmetric cryptographic algorithms that are not based on integer factorization and discrete logarithm?
Jul 19, 2011
Top Meta posts
0
2
4
Do we want "literature recommendations" and similar "list/subjective questions"?
Top network posts
View all network posts
83
Rotated column titles in tabular
31
If someone breaks encryption, how do they know they're successful?
23
Sentence case for titles in biblatex
20
Why triple DES used in EDE mode?
19
The AES Crypt implementation hashes a password 8192 times to generate the key. Is this necessary?

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.