« first day (2699 days earlier)      last day (2273 days later) » 

11:15
0
Q: Algorithm to compute DLOG for elliptic curve $E(F_p)$ with order p

satyaI was reading about elliptic curves in this pdf. Page 55 of the pdf states that if number of points on elliptic curve #$E(F_p) = p$, then there exists a p-adic logarithmic map that homomorphically maps points in $E(F_p)$ to $F_p$. Now, solving for discrete logarithm on $E(F_p)$ reduces to solving...

This person posted two questions both on Math and here. On math, they gave answers to both. What to do?
I posted the etiquette under the questions. The action is for moderators. You are incompatible, delete delete, delete,.. lol
Missed the series.
11:41
I love the little tear drops. Somehow adds so much more emotion to it.
It's freaking brilliant.
 
8 hours later…
19:30
Hi, it would be nice if someone could review the answer I posted in this question:
0
A: Given a PRF $F$ , is $G(s) = F_s(1)||F_s(2)||...||F_s(n+1)$ a PRG?

JavierConsider the following game: I assume certain familiarity with the definitions of Katz and Lindell book. In particular, $O$ is denoting an oracle. It can be either a random function oracle (if $b = 0$) or the output of a random function $F_s$ (if $b = 1$). What you do essentially in your disti...

I had a similar doubt before and think the solution can be written like this. Don't hesitate to do any modifications! Thank you.
19:43
The image is very low quality
 
4 hours later…
23:35
Sure, it would be nice to have some tool to draw these diagrams

« first day (2699 days earlier)      last day (2273 days later) »