2022 Developer Survey is open! Take survey.
Cryptography
user avatar
user avatar
user avatar
Thomas
  • Member for 10 years, 4 months
  • Last seen more than a week ago
  • Wellington, New Zealand
Profile Activity
Stats
7,298
reputation
494k
reached
84
answers
8
questions
Communities
View all
Badges
View all badges
1
gold badge
29
silver badges
42
bronze badges
Top tags
View all tags
218
Score
14
Posts
15
Posts %
185
Score
21
Posts
23
Posts %
120
Score
9
Posts
10
Posts %
83
Score
10
Posts
11
Posts %
71
Score
7
Posts
8
Posts %
56
Score
8
Posts
9
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
answer
56
Why is it important that phi(n) is kept a secret, in RSA?
Dec 20, 2012
answer
41
Calculating RSA private exponent when given public exponent and the modulus factors using extended Euclid
Jan 3, 2013
answer
34
Low Public Exponent Attack for RSA
Mar 17, 2013
answer
33
Did a certain cryptography method get abandoned due to security flaws in the past?
Jun 4, 2016
answer
32
Why can't I reverse a hash to a possible input?
Nov 11, 2015
answer
30
The difference between these 4 breaking Cipher techniques?
Feb 2, 2014
answer
20
Is there a hash function which has no collisions?
Jun 19, 2013
answer
20
Why RSA can't handle numbers above 76?
Sep 14, 2012
answer
14
Why are these specific values used to initialise the hash buffer in SHA-512?
Nov 11, 2012
answer
13
Would this simple encrypted chat program be feasible using One Time Pads?
Oct 26, 2012
Top Meta posts
1
1
5
What to do with the Snowden questions?
3
Should we name our chat room?
Top network posts
View all network posts
22
Variadic templates and switch statement?
18
Would running VMs inside of VMs be a more secure way to study viruses, etc?
17
Strange behavior with optimizations enabled
17
Can't seem to reconcile geometric optics and wave optics
17
Expression for a choice which isn't really one

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.