[119230] in Cypherpunks

home help back first fref pref prev next nref lref last post

logarithms of nonsingular binary matrices

daemon@ATHENA.MIT.EDU (bill payne)
Tue Oct 19 23:23:43 1999

Message-ID: <380D2E47.2F34@nmol.com>
Date: Tue, 19 Oct 1999 20:51:51 -0600
From: bill payne <billp@nmol.com>
MIME-Version: 1.0
To: beeline@iname.com, taocp@cs.stanford.edu
CC: koolhans@rice.edu, j orlin grabbe <kalliste@aci.net>, lb@qainfo.se,
        Fushimi@misojiro.t.u-tokyo.ac.jp, laszlo_baranyi@nai.com,
        cypherpunks@toad.com, ukcrypto@maillist.ox.ac.uk,
        biham@cs.technion.ac.il, even@cs.technion.ac.il, wpi@wpiran.org,
        abd@cdt.org, merata@pearl.sums.ac.ir, awya@lucs-01.novell.leeds.ac.uk
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Reply-To: bill payne <billp@nmol.com>

Alexandr
http://www.semionoff.com/cellular/hacking/phreaking/  

Roots of nonsingular binary matrices can be computed.

 	011 011       010     
        111 111  =    001
        101 101       110

How about logarithms?  

Like
		010		
	log 	001
		110
I think so.  But this is a mind trip.

This is the guy who suggested I contact Masanori

http://math.jpl.nasa.gov/lhbook/
Linpack http://av.yahoo.com/bin/query?p=linpack&z=2&hc=0&hs=0

I sent Knuth http://www.vtbooks.com/reviews/0201896842.html a copy of
THE TAPE. 

It's now transcribed.

http://home.bip.net/laszlob/cryptoag/crypto_ag.htm

best ... and, of course, keep up-wind.

bill


home help back first fref pref prev next nref lref last post