Stack Exchange
sign up
|
log in
|
Cryptography
beta
Questions
Tags
Tour
Users
Ask Question
Samuel Neves
less info
meta user
|
network profile
1,027
reputation
4
9
bio
website
location
age
visits
member for
1 year, 9 months
seen
40 mins ago
stats
profile views
34
1,027
reputation
bio
website
visits
member for
1 year, 9 months
4
9
badges
location
seen
40 mins ago
summary
answers
questions
tags
badges
favorites
bounties
reputation
activity
17
Answers
newest
activity
votes
14
How long does it take to crack DES and AES?
8
Why doesn't CTR mode require blocking?
6
Are safe primes $p=2^k \pm s$ with $s$ small less recommandable than others as a discrete log modulus?
6
How to practically find solutions to a discrete logarithm?
5
How to perform Multiplicative Inverse Modulo in IDEA
5
In RSA, rationale for prime $p$ with $p-1$ having prime factor $u$ with $u-1$ having large prime factor?
4
Is (2^333)-1 a prime number?
4
How does the cyclic attack on RSA work?
4
Why is public-key encryption so much less efficient than secret-key encryption?
3
Why would anyone use an elliptic curve with a cofactor > 1?
3
Standardized parameters for elliptic curve cryptography
3
Can ECDSA signatures be safely made “deterministic”?
3
What is the sign bit for in Feige-Fiat-Shamir?
2
Trying to better understand the failure of the Index Calculus for ECDLP
2
Solving hard problems in $\mathbb Z_{p}^{*}$ when $\mathbb p$ is close to $\mathbb 2^{n}$
2
Discrete logs on elliptic curve with embedding degree 3 with the 'MOV' attack
2
Choosing good parameter for Lenstra's elliptic curve factorization
Cryptography Stack Exchange works best with JavaScript enabled
meta user
network profile
