User Barack Obama - Cryptography Stack Exchange

Barack Obama

Unregistered

Member for 10 years, 10 months
Last seen more than 9 years ago

16 Answers

Score Activity Newest

31 votes

Accepted

Why do the elliptic curves recommended by NIST use 521 bits rather than 512?

answered Feb 3, 2013 at 23:23

5 votes

Solving a discrete logarithm using GDlog

answered May 7, 2013 at 3:26

4 votes

Accepted

ElGamal: Generation of "g" value?

answered Apr 12, 2013 at 23:07

3 votes

RSA leak bits to factor N

answered May 7, 2013 at 3:45

3 votes

How to derive formulas for addition and multiplication in Jacobian coordinates

answered May 9, 2013 at 1:19

3 votes

Accepted

How can I take advantage of repeated patterns in non random RSA prime factors?

answered Aug 31, 2013 at 1:44

3 votes

Accepted

Pollard's Rho - Constructing the Random Function

answered Sep 16, 2014 at 21:24

3 votes

Operation which needs much computing power to be created, but just a little to be solved?

answered Oct 23, 2014 at 22:42

2 votes

Accepted

Curve parameter for hyperelliptic curve cryptography?

answered Oct 6, 2013 at 11:01

2 votes

Why would this method of discrete logarithm finding not work?

answered Feb 2, 2013 at 1:03

2 votes

Trapdoor implementation

answered Feb 3, 2013 at 18:48

1 vote

Which area of Maths should I pursue?

answered Jul 11, 2013 at 1:03

1 vote

Reversing N CRC steps

answered Oct 6, 2013 at 12:40

1 vote

Key management for military GPS receivers

answered Sep 23, 2014 at 2:08

1 vote

CRC32 vs. low 32 bits of cryptographic hash

answered Nov 1, 2014 at 2:58

1 vote

Accepted

Discrete log analog of ECM factoring algorithm?

answered Jan 31, 2013 at 2:44