🚀 go-pugleaf

In article <11496@lanl.ARPA> jlg@a.UUCP (Jim Giles) writes:
>Scheme:
>    Step 1 - have customer hit space bar N times (to get an N bit number).
>	     The output will be an N bit binary number which consists
>	     of the least significant bit of the microsecond clock at
>	     each space bar detection.  If the leading bit is 0 complement
>	     the whole number (we are looking for an N bit number, so
>	     the leading bit must be one).
>
-----
>
>This doesn't seem to provide much foothold for the codebreakers to
>use.  Maybe factoring would be easier than trying to reconstruct the
>generation sequence used.


	You should also use some sort of semirandom technique to
select the numbers of digits in the two primes. If you know that the
two primes have the same numbers of digits i shoulrd greatly simplify
the attempted factoring process. You can work down (or up which ever is
shorter) from the square root of the number looking for a factor.
It's not easy but it can take several orders of mgnitude off of the
difficulty of the factoring.
			Pat Caudill
			patc@tekcrl.TEK.COM