Consider the Twin Primes produced by (11,13) 11===(347,349)====347===(10427,10429)====10427======(312839,312841) ====================================10429 ...
16773
Jud McCranie
judmccr
Jun 11, 2005 2:46 pm
... Can you outline your construction procedure? Also, take p=2^24036583-1 and show how you find an f that will work....
16774
ratwain@...
ratwain
Jun 12, 2005 12:38 pm
Encrypted message is available. [Non-text portions of this message have been removed]...
16775
Ron
ron_s_dotson
Jun 13, 2005 9:12 am
Hi all, I'm building a Verilog HDL implementation of the Elliptic Curve factoring method (ECM) for implementation in an FPGA (or two or three closely coupled...
16776
Phil Carmody
thefatphil
Jun 13, 2005 10:38 am
From: ratwain@... ... Someone has "Netsky". Who, I don't know; however: X-Originating-IP: 193.126.130.96 tells me: inetnum: 193.126.128.0 -...
16777
Jose Ramón Brox
ambroxius
Jun 13, 2005 12:06 pm
... From: "Ron" <Yaho6Hb3c@...> Hi all, I'm building a Verilog HDL implementation of the Elliptic Curve factoring method (ECM) for implementation in an...
16778
kradenken
Jun 13, 2005 12:48 pm
Hi All, I have stopped accepting posts from Milton on this subject. He is 'yet' again refusing to answer direct questions concerning his methods while...
16779
Sarad AV
jtrjtrjtr2001
Jun 13, 2005 3:03 pm
hi, ... Let n=p*q Let the curve be C: y^=x^+bx+c and P=(x1,y1) a point the curve. It is to easy to keep the point P and one of the curve parameters fixed and...
16780
Paul Leyland
xilmanuk
Jun 13, 2005 5:32 pm
... I'm certainly interested. Some years ago I wrote some MP software in assembly for Texas Instruments DSP chips, largely for the fun of it. ... What you...
16781
Larry Soule
lsoulesbc
Jun 13, 2005 6:16 pm
I'm also interested in your project. I work at Synopsys on the development side of the VCS-MX simulator (a mixed Verilog-VHDL simulator) and can help out with...
16782
Deapesh Misra
deapesh
Jun 13, 2005 7:44 pm
... ..............<snip>........................ Hi, I have been associated with this topic for some time now. Would like to share the list of good resources: ...
16783
Elena Erbiceanu
shiana_heavens
Jun 13, 2005 9:47 pm
Hello, I am working on the implementation of the AKS primality test for large numbers, using a big-int library (MpNT). I am not sure yet which approach I...
16784
Ron
ron_s_dotson
Jun 14, 2005 12:57 am
... WOW, Jackpot!!! It turns out that what I need most right now is a good Verilog simulator. ;-) At present I'm using the Icarus simulator from...
16785
Ron
ron_s_dotson
Jun 14, 2005 1:22 am
... Hi Jose. Yes, the thought has occurred to me because 8-bit ADC's and DAC's are so cheap these days. The problem is that FPGA's use all digital voltage...
16786
Sarad AV
jtrjtrjtr2001
Jun 14, 2005 5:14 am
hi, If the number under test 'n' is small, you can find the first root, second root,...,k th root of n >0. If any of them is a whole number, then we have a...
16787
Ron
ron_s_dotson
Jun 14, 2005 6:57 am
... wrote: <See Below> Hi Sarad. Yours is a very interesting reply and touches upon my next area of interest now that the random number problem is solved...
16788
thefatphil
Jun 14, 2005 9:02 am
... As Paul Leyland has noted, a counter is typically sufficiently random when it comes to seeding ECs for ECM. LFSRs are very cheap to implement, and are an...
16789
thefatphil
Jun 14, 2005 9:12 am
... That's "Yes" as in "No, not in general". For factoring arbitrary numbers, such as those in the Cunningham Project and its many extensions, the Home Prime...
16790
Sarad AV
jtrjtrjtr2001
Jun 14, 2005 2:04 pm
Hello Ron, ... If we are lucky to get a non-trivial factor other than 1 and n, we are done. ... C(Z/nZ)= C(Fp)*C(Fq), we are trying to find a K such that K...
16791
Ron
ron_s_dotson
Jun 14, 2005 2:58 pm
... At first I assumed an LFSR was the same thing I know as a "Linear Congruential" pseudo-random number generator that only requires a multiply and an add,...
16792
Ron
ron_s_dotson
Jun 14, 2005 3:08 pm
... Yes, in fact I read somewhere that a fast ECM factoring "machine" for numbers on the order of 2^20 or 2^30 would be very useful for finding "B-Smooth";...
16793
Ron
ron_s_dotson
Jun 14, 2005 4:21 pm
... So to paraphrase in terms I can understand, I'm to find a K that is evenly divisible by a number close to P (in which case K would likely be much larger...
16794
Sarad AV
jtrjtrjtr2001
Jun 14, 2005 4:30 pm
hello, ... Yes but we need it to have certain values for the multiplier to attain maximum period. ... In the book Applied Cryptogarphy,Bruce Schneier,Second ...
16795
James Wanless
bearnol
Jun 14, 2005 4:39 pm
... I've been following your posts with interest too - I'm glad you're game to attack RSA-640 - good luck with it whatever you decide after reading this...
16796
James Wanless
bearnol
Jun 14, 2005 5:09 pm
... btw, my message above was just meant for (and originally just sent to) Ron, but if anybody else is interested, feel free to contact me for terms... J...
16797
Sarad AV
jtrjtrjtr2001
Jun 14, 2005 6:25 pm
hello, ... I forgot to mention that #C(Fp) is the number of points satisfying the curve (modulo p). Its the standard notation. We are looking for curves such...
16798
Sarad AV
jtrjtrjtr2001
Jun 14, 2005 6:34 pm
... Small prime powers to be precise. __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam...
16799
Ron
ron_s_dotson
Jun 14, 2005 6:34 pm
... Thanks for the tip Sarad. I just ordered the book you recommended from Amazon.com. :-) By the way, to clarify my previous message to you, the ECM algorithm...
16800
Ron
ron_s_dotson
Jun 14, 2005 7:17 pm
Thanks for your suggestion James. Perhaps I'm just dense today, but I cannot find any source code on your web site (only binaries). Nor can I find any...
16801
James Wanless
bearnol
Jun 14, 2005 7:38 pm
... You should be looking in the right place on my site (under Binaries) The source should be there - it's in java - so can you see "we2.java"; for example? ......
