#lisp

... or aqui... ------------------------ Galera do Bugsec.com.br "I4K,m0nad,_mlk_,sigsegv,b-man" Galera da freenode dos canais #fym,#reset,#c-br,#calculus,#lisp-br,#gentoo-br,#gdb,#c4ll Galera em geral: eremitah, syn_ack, di0, tau, s0n1c, ryonagana, camarllon, twi-john, B4r0n, memset, vuln, delf0, VonNaturAustreVe, menteBinária(nandu), decoder, voidpointer(diego rocha),muzgo,mario-goulart,brn,clandestine, zhide00, sm0k_, darkside, madrand, f117, t0kata, edenc e nibles. visite ai http://coolerlab.wordpress.com http://code.google.com/u/c00f3r/ https://github.com/CoolerVoid/ _____ .: :. (_________) __ | | .: :. ...

... OPTIMIZATION PROBLEMS WHICH WILL BURN ALL YOUR CPU CYCLES IN THE DEEPEST PITS OF COMPUTATIONAL HELL." - William Newman on run-time casting with SBCL (#lisp 2003/03/29) First of all, the ECDLP is hard only if the two following rather strong conditions are met: - The number of elements in your finite Field is larger than at least 2 to the power of 128. 256 bits is better, 512 scares the NSA. - The number of points on your elliptic curve is almost prime, which means that it is of the form |E(F)| = h * p, where p is prime and h very small. This leads to the following problems: (A) Implement sufficiently fast finite field arithmetics for fields ...