
	(Show all Grid articles . . . )

Information for Linux System Administration

Grid: Factor big numbers with a quadratic sieve

vote

Most of today's secure communications, including SSL and cryptographic algorithms, rely on the simple mathematical fact that factoring very large numbers is computationally difficult. And by "difficult," we mean that given current computational resources, it would take many years to find the factors (numbers that multiplied by themselves give the original number) of a very large number. Among the many algorithms designed for this task, the quadratic sieve is one of the fastest. In this article, the author provides an OGSA-based, Globus Toolkit 3.0 implementation of the self-initializing quadratic sieve for a grid environment.

read more | mail this link | score:7113 | -Idean Momtaheni, March 18, 2004

More Programming articles...

coding headlines

Introduction to Java programming

Tutorial: Build a Real-Time web tool with jQuery, XMPP and PHP

Compile Crystal Space in Ubuntu 10.04

Linux core files

Scripting: Bash Array Tutorial

Ten more One-Liners from CommandLineFu explained