On Sept. 23, 2013, 4:18 p.m.
Yes but there are already enough challenges on the site that use exactly the same encryption…nothing new is being tested here.
It is my opinion that this si…
Posts
Topics
On Sept. 23, 2013, 4:18 p.m.
Yes but there are already enough challenges on the site that use exactly the same encryption…nothing new is being tested here.
It is my opinion that this si…
On Sept. 13, 2013, 6:19 p.m.
Personally I don't see the point in the Cyrillic part of this, it does nothing to add to the security of the encryption. This is essentially just another simpl…
On March 2, 2012, 6:24 p.m.
I am simply saying you can generate your own examples easily within minutes, there is no system at work here, it is just about calculation. Generate a prime, g…
On March 2, 2012, 5:54 p.m.
Well a thing to be learned would be that in practice people look for the simplest solution. In creating an affine part to the challenge it has made the simples…
On March 2, 2012, 5:46 p.m.
Can you not see that most of the slides are just there as a discussion around the problem and related stuff? (since the problem is highly unsolved).
The ch…
On March 2, 2012, 5:29 p.m.
You misunderstand…what I am saying is why create a challenge about one cryptosystem that really isn't about that cryptosystem at all?
The challenge is suppo…
On March 2, 2012, 1:24 p.m.
…but the challenge has nothing to do with DSA! The challenge is just to compute a discrete logarithm. There is no cryptographical system to break here, it is a…
On March 2, 2012, 1:08 p.m.
Yes, I have no problem with making beginner challenges…just thought it defeated the point on making a challenge in ECC if really the ECC part is irrelevant.
…On Feb. 29, 2012, 12:02 a.m.
I think this is the point, it is a problem that hasn't yet been solved fully. The DLP is not a system…it is not really cryptographical! It is merely a bit of n…
On Feb. 28, 2012, 11:52 p.m.
This challenge can be done without even touching elliptic curves! It is just yet another affine substitution that can be broken by hand in a few mins.
It co…
On Feb. 7, 2012, 11:24 p.m.
I have never really considered a problem like this before so I might have got confused. I don't see a way to find d' without using its relationship with d…and …
On Feb. 7, 2012, 10:29 p.m.
I have returned lol.
I think this challenge is ambiguous…it doesn't say how we have to approximate. Do we match up the left most 510 bits of d or the right …