PDA

View Full Version : hypercomplex numbers and RSA


mike
May 24th, 2002, 00:32
Thought some of you might enjoy this. It's a comparison of the hypercomplex numbers (a 4-dimensional generalization of complex numbers that isn't quaternions) and Z_n, the ring of integers modulo n, where n = pq, p,q distinct primes. Since Z_n is where RSA does its magic, I deemed it appropriate for this forum. Besides, what's the point of being the moderator if you can't plug your own stuff?

http://home.datawest.net/staym/hypercomplex-rsa.html