![]() |
|
|
#1 |
|
Bemusing Prompter
"Danny"
Dec 2002
California
5×479 Posts |
Last fiddled with by ixfd64 on 2010-09-21 at 03:22 Reason: typo |
|
|
|
|
|
#2 |
|
Tribal Bullet
Oct 2004
DD716 Posts |
She did a great job.
|
|
|
|
|
|
#3 |
|
Bamboozled!
"πΊππ·π·π"
May 2003
Down not across
250348 Posts |
|
|
|
|
|
|
#4 |
|
Sep 2009
977 Posts |
Interesting summary indeed, bookmarked
![]() What does "HOLF", used several times in the presentation, mean ? I noticed a typo on page 3: 512-bit RSA keys are typically 154 or 155 digits (instead of 174). Last fiddled with by debrouxl on 2010-09-21 at 12:48 |
|
|
|
|
|
#5 |
|
Tribal Bullet
Oct 2004
3·1,181 Posts |
|
|
|
|
|
|
#6 |
|
6809 > 6502
"""""""""""""""""""
Aug 2003
101Γ103 Posts
981810 Posts |
|
|
|
|
|
|
#7 | |
|
Aug 2006
3×1,993 Posts |
Quote:
Code:
#define HOLF_MULTIPLIER 480 Code:
/*
This is a reasonable implementation of Bill Hart's "one line" factor algorithm. (HOLF)
WARNING: this is more than one line.
*/
unsigned long z_factor_HOLF(unsigned long n,unsigned long iters)
{
unsigned long orig_n=n, in, square, sqrti, mod, factor, factoring = iters, iin;
n*=HOLF_MULTIPLIER;
iin = 0;
in = n;
while (factoring && (iin < in))
{
sqrti = z_intsqrt(in);
sqrti++;
square = sqrti*sqrti;
mod = square-in;
if (z_issquare2(mod,&factor))
{
sqrti -= factor;
factor = z_gcd(orig_n,sqrti);
if (factor != 1)
{
return factor;
}
}
factoring--;
iin = in;
in += n;
}
return 0;
}
Last fiddled with by CRGreathouse on 2010-09-21 at 14:41 |
|
|
|
|
|
|
#8 |
|
Bemusing Prompter
"Danny"
Dec 2002
California
45338 Posts |
|
|
|
|
|
|
#9 |
|
Bamboozled!
"πΊππ·π·π"
May 2003
Down not across
22·5·72·11 Posts |
|
|
|
|
|
|
#10 |
|
6809 > 6502
"""""""""""""""""""
Aug 2003
101Γ103 Posts
2·4,909 Posts |
|
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| my first research paper presentation | ixfd64 | Lounge | 2 | 2004-11-05 23:42 |