Cryptography
Network profile
307
reputation
12

J. Doe

Apparently, this user prefers to keep an air of mystery about them.

2
answers
25
questions
~2k
people reached
  • Member for 10 months
  • 32 profile views
  • Last seen Nov 29 at 11:30

Communities (5)

Top network posts

We respect a laser-like focus on one topic.

Top tags (22)

Score 2
Posts 11
Posts % 41
Score 2
Posts 10
Score 2
Posts 8
Score 0
Posts 8
Score 0
Posts 4
Score 0
Posts 4
View all tags →

Top posts (27) All Questions Answers | Votes Newest

7 How safe is a prime with $P=2 \cdot Q \cdot R \cdot S \cdot t+1$ for discrete logarithm? How to enhance/compare? May 3
4 Any speed up methods for finding the index of a random value produced by the Inversive congruential generator? Nov 17
3 Are there any cryptographic methods which use multiple cyclic groups? Aug 12
3 Does knowing that the exponent is in a certain range help solving discrete log? Aug 17
2 How to determine if $\{n \cdot g^a \mod P\}$ and $\{m \cdot g^a \mod P\}$ generate the same sets? (set size < $P-1$) May 7
2 Elliptic curve as a product of 3 cyclic groups possible? Jan 18
2 Is there a cyclic RNG without an explicit form for $i$'th element which is guaranteed to have a sum of zero (subset of elements, $\mod P$ possible) Nov 26
2 How safe is a prime with $P=2 \cdot Q \cdot R \cdot S \cdot t+1$ for discrete logarithm? How to enhance/compare? May 5
1 'random' function $r_{n+1} = f(r_n)$, $|\{r_i,\forall i\}|=N$, $r_N = r_1$ where a function $g(r_k)=k$ is harder than in ECC? Oct 13
1 Does a different exponent and base but same key help to resolve discrete logarithm? Apr 25
View all questions and answers →

Badges (12)

Gold

—

Silver

—

Bronze

12

Rarest

View all badges →