December 2003 - cypherpunks-legacy

Testing
by rcain＠netcom.com 17 Dec '03

17 Dec '03

to see if 20 some copies of this note also go to the list. Sorry about that last one, I've never had that problem from netcom before and sorta suspect it is the list software. Peace, Bob -- Bob Cain rcain(a)netcom.com 408-354-8021 "I used to be different. But now I'm the same." --------------PGP 1.0 or 2.0 public key available on request.------------------

1 0

Re: Crypto Regulation Reform
by rcain＠netcom.com 17 Dec '03

17 Dec '03

Sameer sez: > > Idea: > Apply for the patent. If they decide to classify it release > the idea through the anonymous remailers. Right, spend a bunch of money for nothing and risk prison for "espionage". I think that is what they charge you with when you release classified info. No thanks, Sameer. There isn't an anonymous mailer yet that I would trust and do you honestly think my account (hell, my life) would not be monitored if such a classification were to occur? I do have an idea though that might satisfy the skeptics. I will divulge the method to *one* of you for evaluation that is considered capable and trusted by this community at large under a non-disclosure agreement if my attorney says there is such a thing that can be written between individuals which has teeth. If anybody wants to take me up on this, first get permission from the individual and email me the name and email address. He/she must have PGP and it must reside on a stand alone machine connected only by a modem to another machine on the net. Fair enough? I would prefer someone that has followed everything in crypto though for a few years to help me determine if there is in fact any prior art I am not aware of. That was one of the reasons I brought it up here, to see if I would get a bunch of "It's already been done" responses. None so far. In fact if that person is the creative type and can bring something to the party (I think there is a way to make it even more secure between strangers but I haven't been able to tease it out of my brain completely yet) I would conider co-filing with that person. Peace, Bob -- Bob Cain rcain(a)netcom.com 408-354-8021 "I used to be different. But now I'm the same." --------------PGP 1.0 or 2.0 public key available on request.------------------

1 0

For Pr0duct Cypher
by Derek Atkins 17 Dec '03

17 Dec '03

I really wish there were some way to email you directly. I really hate wasting bandwidth like this... (For everyone else, I'm sorry. Please hit 'd' now). -derek -----BEGIN PGP MESSAGE----- Version: 2.3a hIwCwagUhZdVih0BBACXtR1JP6vWKBEaN3LaxpRbRorRpvmsA3MOD4Sco+F5RgvH xgO5dVBh0aRwDV3zbNLSIk6lF0MpmINu6uRqiwH/OlFErV+ALeSG4RkWONUdpYz+ MZs4vbRuMqjf8rFdF9JORy7Oq0bGY030/HicCP1Zv8HVxOCEL9LZbUYAhZDobaYA AAWV4D6AjWA2gRZrHsycYEV5U2Pc48wq8Rcg5lIKvNTfFYJ+6RufwHfK/7J8kJHJ xzTg7a2l4WiEnsb+VT1en+7hfIi5K2HZ2uFtyY9kqikdi/zPgjBsT/TM5eyvxRV1 MrCSltSmHXzbKxC9QWk3zuqb8LKjA8495hx6VRv4s2KT4rua6ntmsEopJtCTsK6g fQKESkiZYi7gb6b0LaI/jgZ1vY9pnM8JerKzi8A8QfP1Ck5mQu+0ldyEekSGChv8 zGTkhJrwK+ZIPynT/uwks7SUk7YKRv28ezIVGzp7mSk+7oGWvlZEYBGfQOGJwlqX vriYdzfmmbSqkLZw5/Y9awq3+7xF6gjBkgiqdoKbi5sIuFodhLoky/W7KnRqYzi9 jW4FS1JUZncJXlEFYBcmHA+7JzjFIu9nplRjR7SaIF58xwUphyZ8pVweIi/JZiwc 5E/CVRlR3VuBebY69bTcBJKZZ2HJDm2zEsWh/ggjRSEkH+sE9r8WaKRPwvPtlEZA Tigp2a5O9DFLAuuK0KpRWiZoOAd++haYSgGhRfqa5lsCfCsAjcNXIKWNwxpGFTsL 9r/Xr4L6n+3RIiTx8rZQam+83a3YUCO0Ems/JGfbSqckF4/MUJPbLX/HDnmIlRbW lXhDtaNIO7zy4O57cxhgAUQHTg5Yx53YSUxXShHnSz1Cw/2gbv5izlV93tLTIeq/ dVDFDqfnC4hGvLb84y9xSz1n3QnPANSWCGvcybHDX1nNph4iZRPiQfNtWtR7Hbj2 IxmOMI63IAIbou1ybcLFe/GVXpQC7NA42IfDBPnRt/JjwybrYdRa6Gp2dLoW/dge xFTKo1r4B4EW1hpa5ldWDhoC5yT21MX1rocSp+Zqf+rKiRSnx7gPO7ESpX1xidO5 3ffieyuSaARvSaa/2BnK2A/J7jss45S0KW78/rz4RmSCGBVeg17+VFutSPKNyr+b r3GGeYf83lz9sugdbB2CHLmb22hNvWyWilPL0WhPpgxmjTo0fpQKgkfM7mdKlTCz jGOlbH+EfL8kL837FKQOX74Ban1iDCdwFSIlkYWLJLxIz05J6CayPkUzPVDsJUUT nUjEKZoe9S99CCkm4OqDlMrX7zWiwbUQj6Pe/JwxnoGEAvz8GwDYHlQDhm9t8Wom p1pEKbQDLxkpIuEEp7C96cartcq3fun1vmEUuwhlKXoj6p+nXR0NxuUbQPhYnmHH xKTBgOzDC1n7OXC7/5SmdWRvygnKKwl6KI/IZ4TK6gCyv5YwN6HS7/pJNOnb075h WQFKi+Fy9QvgojGxp7+04DV6ZbUwy/UQsVUjHjmCEXGMBF1C23thawRjmcCBOC01 0QKRYlHMerEKvY2tHpvGl4TWM+W/xDXQbUZmDBE7FL2O2Nb5BdNpV+BrxejE8yb0 XBgq127JAzAqMMLTgEkc+SnT24nBrNQxAVuapsvwkUxJ2W7XjouGUjP0t9miYQCg aoIpagGEdIuznve/ZwBfJaXl1GLT8VTmvIU/zTsdJih1U6bzZvERwwDHpwMJx+hI b1sQXZdxagOGuV/W+g3ErTJlqrZFTPBh6beLll99ibD6V6mjYMCI1ho4Nqzx/gHN a7gXyfueIb+Ft7vJ4xU70X099ZSbei4U+Gr0ahKkxIrMEw7gUrbv55kKEHNRHV6w RwwVrJ+GsApGD31mwAcT+VYnnQ5Ye/617cwQ5b+fL5tVNvGrtvGxb00+BOZl5X72 b86sy6zjRxliBi1sv4itk+5XgQrrc8krTbGUQ+561m9iHwjrEsMkFfEvLfMRbate fNL/bz6cAZnqz5t9i62Neydh2RQqp/QDsrcj6O6quwdrEvm4wVTS5Ysh/8T390dt 0uqqi+4Amr3egZkGeBTYQyjo3jmGmZxdZWD2lLCowYFMeFxwLdnNKw== =Fxw+ -----END PGP MESSAGE-----

1 0

Bug in PGP MPI library
by anonymous＠extropia.wimsey.com 17 Dec '03

17 Dec '03

-----BEGIN PGP SIGNED MESSAGE----- Someone please prove me wrong, but I think there is a bug in the function mp_modexp_crt (RSA decryption and signing) in PGP23a's MPI library. Attached to this message is a program which demonstrates the bug. While testing Magic Money for lingering bugs, the client gave the error "Coin from server has bad signature!" I tried again with different coins, and the program worked. The proto.dat file had been cleared as the coins were read, so there was no way to repeat the error. I set up a batch file to repeatedly cycle coins between the client and the server, backing up proto.dat each time. After an hour or so, the error happened again, and I started tracing it. There didn't seem to be any bug to find. For this particular coin, the unblinded coin was garbage. For any other coin, the program worked. I wrote this test program, bug.c, to find the error. It uses the same coin, blinding factor, public, and secret key as Magic Money was using when it crashed. The program first blinds the coin, then signs it, then unblinds it, decrypts the RSA signature, and displays the results. If you just run "bug", Here's what happens: >bug e=0001 0015 n=A8DF 1E61 234B E660 800A 4167 40A9 102D FC01 6962 AD6C BE39 2664 92AE E8B4 CE3A 93EB F4BE FFD1 104A DB81 2F95 684E C188 0901 379C 99BC 5E24 7EC2 660B 1463 139F d=4612 D56D AA0A B760 3561 60C6 EE7A 5CE8 A74B D0C9 501E D7B1 C145 D654 3B38 E90A 6FF4 BC13 221E E354 345D B789 38D6 3427 DA7A 48D6 570C 3860 FC86 0B8F AB80 FCE5 p=C737 3481 985A B4B3 4E0F 0ECB 8E58 1B49 74F4 70D4 0B81 CF2C F858 781F D70F 79EB q=D901 B376 D73A 2163 56D8 3B7B EE02 73F8 9A3F E7FD AC56 F4D9 E072 CECF 85B1 CC1D u=825E FE26 ED64 7E91 6256 A8E8 3DC7 C8E5 0E52 46FE 56B0 B3C9 3559 2C03 BFA1 C06B original coin=0001 FFFF FFFF FFFF FFFF FFFF FFFF FFFF FFFF FFFF FFFF FFFF FFFF FFFF FF00 3020 300C 0608 2A86 4886 F70D 0205 0500 0410 14C1 A83C 1B84 FCAD 472F 6425 3F74 7C80 blinding fact=005B 52D8 BA8D 6AE9 4652 8C2D 5CBB 4BEB D0C7 80C9 48BC 797A CDEE BDE0 E53D 4329 9E7A 00B3 8FF1 5BA4 E78B 81C8 C99A 9C16 CFA7 33A3 93D0 A5C0 7604 8F85 87D9 4D31 blinded coin=797B A351 2280 62DC 1D02 84F8 1812 52E8 152B A421 D7C8 8CD1 E061 776C 138A 9776 E2D6 5764 AF64 4C21 D589 176D 0FD2 F346 7A45 5EB9 7E1F 964A 189C 55BC FD53 0775 signed coin=9994 B5AF A3A5 7B30 9058 5D76 C531 3EF2 81F6 B973 3805 2673 C8D3 C4A8 051A 4979 7882 F598 BB66 57C8 8104 76BB 06D7 F85D 4AA1 AEF3 18EC A105 C8B2 64D4 96ED 6BE4 final coin=2EF9 8656 2799 3071 692A D693 3EF3 AF4D D296 B6AE E3A3 A283 94B1 242E 43BD 9042 086A CCED 5A0A A4F4 F4A9 C1FE B3D0 5C22 BF60 D14D 717F C188 4701 57E5 C9E1 5A77 Notice that the final coin is gibberish. By running "bug b" it increments the blinding factor by one, then performs the same calculation. >bug b original coin=0001 FFFF FFFF FFFF FFFF FFFF FFFF FFFF FFFF FFFF FFFF FFFF FFFF FFFF FF00 3020 300C 0608 2A86 4886 F70D 0205 0500 0410 14C1 A83C 1B84 FCAD 472F 6425 3F74 7C80 blinding fact=005B 52D8 BA8D 6AE9 4652 8C2D 5CBB 4BEB D0C7 80C9 48BC 797A CDEE BDE0 E53D 4329 9E7A 00B3 8FF1 5BA4 E78B 81C8 C99A 9C16 CFA7 33A3 93D0 A5C0 7604 8F85 87D9 4D32 blinded coin=7010 DE32 C491 A343 F041 2779 BA9B BEF3 C394 3DAE 2B48 8110 2260 7D18 876A 820F AFB1 9913 6E77 4D95 185E 17F7 2496 7137 8212 5509 B641 D3BD F67A 685A 0A20 8B9B signed coin=2879 A082 C7DE 2BFC C39D 8E21 F245 17B7 96DC 2458 A201 4756 DA93 8D09 23F2 7741 964C 1984 5A15 AC6F 4AD7 50AB CE98 5E12 CDC6 C1F8 5F14 8699 3FB7 036F B439 F39A final coin=0001 FFFF FFFF FFFF FFFF FFFF FFFF FFFF FFFF FFFF FFFF FFFF FFFF FFFF FF00 3020 300C 0608 2A86 4886 F70D 0205 0500 0410 14C1 A83C 1B84 FCAD 472F 6425 3F74 7C80 The final coin is now correct. By running "bug c" the coin itself is incremented by one, but the blinding factor is not incremented. >bug c original coin=0001 FFFF FFFF FFFF FFFF FFFF FFFF FFFF FFFF FFFF FFFF FFFF FFFF FFFF FF00 3020 300C 0608 2A86 4886 F70D 0205 0500 0410 14C1 A83C 1B84 FCAD 472F 6425 3F74 7C81 blinding fact=005B 52D8 BA8D 6AE9 4652 8C2D 5CBB 4BEB D0C7 80C9 48BC 797A CDEE BDE0 E53D 4329 9E7A 00B3 8FF1 5BA4 E78B 81C8 C99A 9C16 CFA7 33A3 93D0 A5C0 7604 8F85 87D9 4D31 blinded coin=5F91 E5B7 95F7 C37B 5CE6 F0A3 A7CC A51B 7C0E ED85 2E2D CE1F F8E8 75B0 1559 7945 0CA5 BE69 AD2E A75E 5F4E 1D8E 0704 DA3B 8957 D63C E195 1078 5E75 0F31 7E7C DA68 signed coin=4A0B EA0E C336 DE7E 3BC6 0448 9B4B 6185 9964 91BD 3A5E E424 520D 2AEF BF9A 7FBA 382C 136C 0FA4 9D58 A237 8160 C00C EE76 5817 D39E 92B6 BD6F 05DD 91CE 4C97 CB85 final coin=0001 FFFF FFFF FFFF FFFF FFFF FFFF FFFF FFFF FFFF FFFF FFFF FFFF FFFF FF00 3020 300C 0608 2A86 4886 F70D 0205 0500 0410 14C1 A83C 1B84 FCAD 472F 6425 3F74 7C81 Again, the final coin is correct. By running "bug r" everything happens as though you just ran "bug". Neither the blinding factor or coin is incremented. But, the program uses the slower mp_modexp instead of mp_modexp_crt to perform the signature. >bug r original coin=0001 FFFF FFFF FFFF FFFF FFFF FFFF FFFF FFFF FFFF FFFF FFFF FFFF FFFF FF00 3020 300C 0608 2A86 4886 F70D 0205 0500 0410 14C1 A83C 1B84 FCAD 472F 6425 3F74 7C80 blinding fact=005B 52D8 BA8D 6AE9 4652 8C2D 5CBB 4BEB D0C7 80C9 48BC 797A CDEE BDE0 E53D 4329 9E7A 00B3 8FF1 5BA4 E78B 81C8 C99A 9C16 CFA7 33A3 93D0 A5C0 7604 8F85 87D9 4D31 blinded coin=797B A351 2280 62DC 1D02 84F8 1812 52E8 152B A421 D7C8 8CD1 E061 776C 138A 9776 E2D6 5764 AF64 4C21 D589 176D 0FD2 F346 7A45 5EB9 7E1F 964A 189C 55BC FD53 0775 signed coin=6613 B2B0 75FD 398B 30EE C3FD 6A84 9E7D 39D2 738A 387B 4100 CD3F 0DFD C8A7 1D13 7941 0CA7 BE13 1C5E 1E9F 7174 648F 494E B57B 32BA 585E DC04 45DF C40A 468E 32BC final coin=0001 FFFF FFFF FFFF FFFF FFFF FFFF FFFF FFFF FFFF FFFF FFFF FFFF FFFF FF00 3020 300C 0608 2A86 4886 F70D 0205 0500 0410 14C1 A83C 1B84 FCAD 472F 6425 3F74 7C80 The final answer is right, and the signed coin is different from the signed coin in the first example. That pins down the error to mp_modexp_crt. Maybe I'm missing something, but it appears there are a few values for which this function just does not work right. If you want to try it, here's the program. Pr0duct Cypher =========================== cut 8< here ================================= /* bug.c Strange bug demo - "bug b" increments blinding factor "bug c" increments coin "bug r" uses regular mp_modexp instead of mp_modexp_crt Compile with mpilib and mpiio, define DEBUG for mpiio */ #include <stdio.h> #include <stdlib.h> #include "usuals.h" #include "mpilib.h" #include "mpiio.h" typedef unit unitarr[MAX_UNIT_PRECISION]; /* Multiplicative inverse - used for finding d */ void mp_inv(unitptr x,unitptr a,unitptr n); char e_string[]="0001,0015h"; char d_string[]="\ 4612,D56D,AA0A,B760,3561,60C6,EE7A,5CE8\ A74B,D0C9,501E,D7B1,C145,D654,3B38,E90A\ 6FF4,BC13,221E,E354,345D,B789,38D6,3427\ DA7A,48D6,570C,3860,FC86,0B8F,AB80,FCE5h"; char n_string[]="\ A8DF,1E61,234B,E660,800A,4167,40A9,102D\ FC01,6962,AD6C,BE39,2664,92AE,E8B4,CE3A\ 93EB,F4BE,FFD1,104A,DB81,2F95,684E,C188\ 0901,379C,99BC,5E24,7EC2,660B,1463,139Fh"; char p_string[]="\ C737,3481,985A,B4B3,4E0F,0ECB,8E58,1B49\ 74F4,70D4,0B81,CF2C,F858,781F,D70F,79EBh"; char q_string[]="\ D901,B376,D73A,2163,56D8,3B7B,EE02,73F8\ 9A3F,E7FD,AC56,F4D9,E072,CECF,85B1,CC1Dh"; char u_string[]="\ 825E,FE26,ED64,7E91,6256,A8E8,3DC7,C8E5\ 0E52,46FE,56B0,B3C9,3559,2C03,BFA1,C06Bh"; char original_coin_string[]="\ 0001,FFFF,FFFF,FFFF,FFFF,FFFF,FFFF,FFFF\ FFFF,FFFF,FFFF,FFFF,FFFF,FFFF,FF00,3020\ 300C,0608,2A86,4886,F70D,0205,0500,0410\ 14C1,A83C,1B84,FCAD,472F,6425,3F74,7C80h"; char blinding_factor_string[]="\ 005B,52D8,BA8D,6AE9,4652,8C2D,5CBB,4BEB\ D0C7,80C9,48BC,797A,CDEE,BDE0,E53D,4329\ 9E7A,00B3,8FF1,5BA4,E78B,81C8,C99A,9C16\ CFA7,33A3,93D0,A5C0,7604,8F85,87D9,4D31h"; main(int argc,char *argv[]) { int rflag; unitarr e; unitarr d; unitarr n; unitarr p; unitarr q; unitarr u; unitarr dp; unitarr dq; unitarr original_coin; unitarr blinding_factor; unitarr temp; unitarr blinded_coin; unitarr signed_coin; unitarr unblinded_coin; unitarr final_coin; set_precision(MAX_UNIT_PRECISION); /* Load all the values */ str2reg(original_coin,original_coin_string); str2reg(blinding_factor,blinding_factor_string); str2reg(e,e_string); str2reg(d,d_string); str2reg(n,n_string); str2reg(p,p_string); str2reg(q,q_string); str2reg(u,u_string); /* Increment variable if condition entered */ if(argc==2) { if(*argv[1]=='b'||*argv[1]=='B') mp_inc(blinding_factor); if(*argv[1]=='c'||*argv[1]=='C') mp_inc(original_coin); if(*argv[1]=='r'||*argv[1]=='r') rflag=TRUE; else rflag=FALSE; } /* Display them to check */ mp_display("e=",e); mp_display("n=",n); mp_display("d=",d); mp_display("p=",p); mp_display("q=",q); mp_display("u=",u); printf("\n"); mp_display("original coin=",original_coin); /* Raise the blinding factor to the power e */ mp_modexp(temp,blinding_factor,e,n); /* Blind the coin */ stage_modulus(n); mp_modmult(blinded_coin,original_coin,temp); printf("\n"); mp_display("blinding fact=",blinding_factor); printf("\n"); mp_display(" blinded coin=",blinded_coin); /* Sign the blinded coin */ if(rflag) mp_modexp(signed_coin,blinded_coin,d,n); else { mp_move(temp,p); mp_dec(temp); mp_mod(dp,d,temp); mp_move(temp,q); mp_dec(temp); mp_mod(dq,d,temp); mp_modexp_crt(signed_coin,blinded_coin,p,q,dp,dq,u); } printf("\n"); mp_display(" signed coin=",signed_coin); /* Invert the blinding factor */ mp_inv(temp,blinding_factor,n); /* Unblind the coin */ stage_modulus(n); mp_modmult(unblinded_coin,signed_coin,temp); /* Decrypt the signed coin */ mp_modexp(final_coin,unblinded_coin,e,n); printf("\n"); mp_display(" final coin=",final_coin); return(0); } #define swap(p,q) { unitptr t; t = p; p = q; q = t; } #define iplus1 ( i==2 ? 0 : i+1 ) /* used by Euclid algorithms */ #define iminus1 ( i==0 ? 2 : i-1 ) /* used by Euclid algorithms */ #ifdef OLD_MPINV void mp_inv(unitptr x,unitptr a,unitptr n) /* Euclid's algorithm extended to compute multiplicative inverse. Computes x such that a*x mod n = 1, where 0<a<n */ { /* The variable u is unnecessary for the algorithm, but is included in comments for mathematical clarity. */ short i; /* unit y[MAX_UNIT_PRECISION], temp[MAX_UNIT_PRECISION]; unit gcopies[3][MAX_UNIT_PRECISION], vcopies[3][MAX_UNIT_PRECISION]; #define g(i) ( &(gcopies[i][0]) ) #define v(i) ( &(vcopies[i][0]) ) Major stack space hog! */ unit *y=safemalloc(sizeof(unit)*MAX_UNIT_PRECISION); unit *temp=safemalloc(sizeof(unit)*MAX_UNIT_PRECISION); unit *gcopies[3]; unit *vcopies[3]; for(i=0;i<3;i++) { gcopies[i]=malloc(sizeof(unit)*MAX_UNIT_PRECISION); vcopies[i]=malloc(sizeof(unit)*MAX_UNIT_PRECISION); } #define g(i) gcopies[i] #define v(i) vcopies[i] /* unit ucopies[3][MAX_UNIT_PRECISION]; */ /* #define u(i) ( &(ucopies[i][0]) ) */ mp_move(g(0),n); mp_move(g(1),a); /* mp_init(u(0),1); mp_init(u(1),0); */ mp_init(v(0),0); mp_init(v(1),1); i=1; while (testne(g(i),0)) { /* we know that at this point, g(i) = u(i)*n + v(i)*a */ mp_udiv( g(iplus1), y, g(iminus1), g(i) ); mp_mult(temp,y,v(i)); mp_move(v(iplus1),v(iminus1)); mp_sub(v(iplus1),temp); /* mp_mult(temp,y,u(i)); mp_move(u(iplus1),u(iminus1)); mp_sub(u(iplus1),temp); */ i = iplus1; } mp_move(x,v(iminus1)); if (mp_tstminus(x)) mp_add(x,n); mp_burn(g(iminus1)); /* burn the evidence on the stack...*/ mp_burn(g(iplus1)); mp_burn(v(0)); mp_burn(v(1)); mp_burn(v(2)); mp_burn(y); mp_burn(temp); #undef g #undef v free(y); free(temp); for(i=0;i<3;i++) { free(gcopies[i]); free(vcopies[i]); } } /* mp_inv */ #else /* !OLD_MPINV */ /* Faster mp_inv, based on "Fast Multiplicative Inverse in Modular * Arithmetic", J. Gordon, in Cryptography and Coding, edited by * Henry J. Beker and F.C. Piper, 1989. * The mapping from the variables in that paper to our variables is, * roughly, M->n, X->a, HCF->u(iminus1), U->u(i), temp->u(iplus1), * INV->v(iminus1), V->v(i), temp->v(iplus1). We rotate the assignment * to temp and INV in their 2nd block of code. */ void mp_inv(unitptr x,unitptr a,unitptr n) /* Euclid's algorithm extended to compute multiplicative inverse. Computes x such that a*x mod n = 1, where 0<a<n */ { /* The variable u is unnecessary for the algorithm, but is included in comments for mathematical clarity. */ int shifts; int i; int enterloop; /* unit vcopies[3][MAX_UNIT_PRECISION], ucopies[3][MAX_UNIT_PRECISION]; #define u(i) ( &(ucopies[i][0]) ) #define v(i) ( &(vcopies[i][0]) ) Stack space hog deleted */ unit *ucopies[3]; unit *vcopies[3]; for(i=0;i<3;i++) { ucopies[i]=malloc(sizeof(unit)*MAX_UNIT_PRECISION); vcopies[i]=malloc(sizeof(unit)*MAX_UNIT_PRECISION); } #define u(i) ( ucopies[i] ) #define v(i) ( vcopies[i] ) i = 1; /* Modify this to do one division at the beginning. That makes it faster. mp_move(u(0),n); mp_move(u(1),a); mp_init(v(0),0); mp_init(v(1),1); mp_init(v(2),1); */ mp_move(u(0),a); mp_init(v(0),1); /* Init U to n%a, V to -n/a. */ mp_udiv(u(1), v(1), n, a); mp_neg(v(1)); mp_move(v(2),v(1)); do { enterloop = 0; shifts = -1; if (mp_compare(u(i),u(iminus1)) > 0) /* if U > HCF then */ mp_init(u(iplus1),0); else { enterloop = 1; mp_move(u(iplus1),u(i)); /* temp := U */ while (mp_compare(u(iplus1),u(iminus1)) <= 0) { /* temp<=HCF */ ++shifts; mp_shift_left(u(iplus1)); /* leftshift(temp,1) */ } mp_shift_right_bits(u(iplus1),1); /* rightshift(temp,1) */ } mp_sub(u(iminus1),u(iplus1)); /* temp := HCF - temp */ mp_move(u(iplus1),u(iminus1)); i = iplus1; /* V := tempV, tempV := INV, INV := V, */ /* U := tempU, tempU := HCF, HCF := U; */ /* (All simultaneous) */ if (enterloop) { while (shifts--) mp_shift_left(v(i)); /* leftshift(V,shifts) */ mp_sub(v(iplus1),v(i)); /* temp = temp - V */ } mp_move(v(i),v(iplus1)); /* V := temp */ } while (testne(u(i),0) && mp_compare(u(i),u(iminus1))!=0); mp_move(x,v(iminus1)); if (mp_tstminus(x)) mp_add(x,n); mp_burn(u(0)); /* burn the evidence on the stack...*/ mp_burn(u(1)); mp_burn(u(2)); mp_burn(v(0)); mp_burn(v(1)); mp_burn(v(2)); for(i=0;i<3;i++) { free(ucopies[i]); free(vcopies[i]); } #undef u #undef v } /* mp_inv */ #endif /* !OLD_MPINV */ =========================== cut 8< here ================================= -----BEGIN PGP SIGNATURE----- Version: 2.3a iQCVAgUBLVmP6MGoFIWXVYodAQHBdgP7B9n/nep0Y1hV2ze3GMJoBpZvq0BKfT3y EjLFvk2+z9Y3kRTqsA42lGFV0rcQwgkm588VbE7JmT/b0AvGoOm4Hqp9wEzYMfFz iMy8fVRitUHT2VFryLpzCdRtwPzDkW62yIQUMgWcgpW05Vu+GMEgtgD70CpJbKfb GuIT2jH6Tzc= =UcS4 -----END PGP SIGNATURE-----

2 1

Meeting Logs
by Robert A. Hayden 17 Dec '03

17 Dec '03

If anyone is interested, I do have some logs from tonights Cypherpunks virtual meeting. It's not a perfectly clear file, as it has lots of help requests in it (I don't know MOO too well, but the substance is still there. If you want it, just drop me a line and I'll get it right off to you. It is about 90k big. ____ Robert A. Hayden <=> hayden(a)krypton.mankato.msus.edu \ /__ -=-=-=-=- <=> -=-=-=-=- \/ / Finger for Geek Code Info <=> In the United States, they \/ Finger for PGP 2.3a Public Key <=> first came for us in Colorado... -=-=-=-=-=-=-=- (GEEK CODE 1.0.1) GAT d- -p+(---) c++(++++) l++ u++ e+/* m++(*)@ s-/++ n-(---) h+(*) f+ g+ w++ t++ r++ y+(*)

1 0

"national security" exception to wiretap laws
by nobody＠shell.portal.com 17 Dec '03

17 Dec '03

* * * * * 18 USC s 2511(2)(f): Nothing contained in this chapter or chapter 121, or section 705 of the Communications Act of 1934, shall be deemed to affect the acquisition by the United States Government of foreign intelligence information from international or foreign communications, or foreign intelligence activities conducted in accordance with otherwise applicable Federal law involving a foreign electronic communications system, utilizing a means other than electronic surveillance as defined in section 101 of the Foreign Intelligence Surveillance Act of 1978, and procedures in this chapter and the Foreign Intelligence Surveillance Act of 1978 shall be the exclusive means by which electronic surveillance, as defined in section 101 of such Act, and the interception of domestic wire and oral communications may be conducted. * * * * * [From USCA annotations for 18 USC s 2511] 13. Executive powers This chapter providing that nothing therein should be deemed to limit the constitutional power of the President to protect the United States against any clear and present danger to the structure or existence of the government did not constitute a grant of power and was not intended to expand, contract or define whatever presidential surveillance powers existed in matters affecting national security, but was only intended to make clear that this chapter should not be interpreted to limit or disturb such power as the President might have under the Constitution. U.S. v. U.S. Dist. Court for Eastern Dist. of Mich., Southern Division, Mich.1972, 92 S.Ct. 2125, 407 U.S. 297, 32 L.Ed.2d 752. Former Attorney General was entitled to qualified immunity in civil damage action based upon wiretaps, where sufficient facts were alleged to place wiretap in rational national security context. Ellsberg v. Mitchell, 1986, 807 F.2d 204, 257 U.S.App.D.C. 59, certiorari denied 108 S.Ct. 197, 484 U.S. 870, 98 L.Ed.2d 148. Former national security council staff member's admission that he had access to option papers discussing possibility of Cambodian bombing operation, secret talks with North Vietnamese, and withdrawal of troops from Vietnam, as well as contingency planning in event that such steps might be taken, together with evidence that staff member had roomed with reporter who wrote article reporting classified bombing raids on Cambodia, was sufficient to establish reasonable national security grounds for wiretap of staff member's phone so as to entitle government officials who ordered wiretap to qualified immunity defense in civil damage action brought by staff member. Halperin v. Kissinger, 1986, 807 F.2d 180, 257 U.S.App.D.C. 35. Those provisions of this chapter which, in the context of pure intelligence- gathering activities, would frustrate the constitutional power of the President, cannot be applied to such surveillance. (Per Wright, Circuit Judge, with three Judges concurring and three additional Judges concurring in the judgment.) Zweibon v. Mitchell, 1975, 516 F.2d 594, 170 U.S.App.D.C. 1, certiorari denied 96 S.Ct. 1684, 1685, 425 U.S. 944, 48 L.Ed.2d 187. Restrictions upon the President's power which are appropriate in cases of domestic security become artificial in the context of the international sphere. U.S. v. Brown, C.A.La.1973, 484 F.2d 418, certiorari denied 94 S.Ct. 1490, 415 U.S. 960, 39 L.Ed.2d 575. Whatever constitutional power lies without scope of this chapter and is invested in chief executive to authorize warrantless surveillance for sake of "national security," necessary prerequisite to administration of such power is express approval by President or Attorney General. U.S. v. Kearney, D.C.N.Y.1977, 436 F.Supp. 1108.

2 1

Re: Testing
by wcs＠anchor.ho.att.com 17 Dec '03

17 Dec '03

May very well be the net software - I've also been getting lots of empty messages. Is toad.com disk full or something?

1 0

SecureDrive 1.3A Verified available via mail server
by edgar＠spectrx.saigon.com 17 Dec '03

17 Dec '03

-----BEGIN PGP SIGNED MESSAGE----- I have just verified that SecureDrive 1.3A, previously announced here, is available not only at the following public BBS's as SECDR13A.ZIP: Eagle's Nest (408)223-9821 Flying Dutchman (408)294-3065 But I have now verified that Version 1.3A may now be obtained from a mailserver. Send mail to Server(a)Star.Hou.TX.US with body text that looks like this get /files/public/secdr13a.zip quit Please attempt to use the mailserver or the two BBS's above before requesting a copy directly from me. Note: Attempts to use either the above BBS's or mail server to transmit SecureDrive 1.3A (or any strong cryptographic product) outside the USA and/or Canada may violate USA law, which the USA may elect to enforce by arresting violators overseas and bringing them to the USA for trial without benefit of extradition proceedings. -----BEGIN PGP SIGNATURE----- Version: 2.3a iQCVAgUBLVisz94nNf3ah8DHAQHG2AP9HichQaiTd1T/W+NLkmdqUGauexI2gXeh MfyO5SVkpWDYgZzfVmZnAKv7O6OUuj87qZvxnLv4BebWV01zUJ4aml5NJM97yZm7 m/cnhzSGqEIfQifOREfsmkh5hoV4pGgBYjuVDVxpzlWog+5go1tQOcbJF8sSSzEx Ez0iZpTGmLw= =ZyrH -----END PGP SIGNATURE----- -- edgar(a)spectrx.saigon.com (Edgar W. Swank) SPECTROX SYSTEMS +1.408.252.1005 Cupertino, Ca

1 0

Prime Numbers
by garet.jax＠nitelog.com 17 Dec '03

17 Dec '03

I'm presently trying to generate a list of prime numbers on a friend's 486 DX2 66mhz computer, but that is rather slow going as you might imagine. I'd like to get a list of all the prime numbers up to 80 digits in length, and I know these numbers must have already been computed by someone... atleast for cryptography purposes. Does anyone know where I can get such a list, or a portion thereof? Thanks in advance, -Garet {Garet.Jax(a)nitelog.com}

2 1

MIME
by Peter shipley 17 Dec '03

17 Dec '03

it would be nice if people who send PGP's email would also place the appropriate "Content-Type" in there headers so there email in a easy manor. -Pete

2 1