large number factorization

Welcome to Crypto. We hope you enjoy your visit.

You're currently viewing our forum as a guest. This means you are limited to certain areas of the board and there are some features you can't use. If you join our community, you'll be able to access member-only sections, and use many member-only features such as customizing your profile, sending personal messages, and voting in polls. Registration is simple, fast, and completely free.

Join our community!

If you're already a member please log in to your account to access all of our features:

large number factorization
Topic Started: Jul 6 2009, 05:02 PM (130 Views)
Darksun22	Jul 6 2009, 05:02 PM Post #1
Just registered Posts: 1 Group: Members Member #3,272 Joined: June 16, 2009	Hello, we're doing an assignment for our university course on cryptography. In order to get the bonus for completing this, we need to factorize a large number, thus gaining the key to an encrypted Message (RSA Encryption). We've got the tools (msieve (http://www.boo.net/~jasonp/qs.html), any hints on something faster?), but not the raw computing power necessary to factorize the number fast enough (for example my specs are: DualCore 2 ghz, factorizing would take days.). Any help would be greatly appreciated. n=26218811125331640126896937461203696544618127965662155572206310743977952199200349502588684707333493281113301 searching for p,q \| n=p*q ^ p,q prime



jdege	Jul 7 2009, 01:43 PM Post #2
Elite member Posts: 263 Group: Admin Member #246 Joined: December 7, 2006	I see no one has replied. You're unlikely to be able to significantly improve on the performance of msieve in a couple of days. So if you can't wait the days it would take msieve to factor the numbers on your computer, see if you can't borrow some faster hardware.
	When cryptography is outlawed, bayl bhgynjf jvyy unir cevinpl.


1 user reading this topic (1 Guest and 0 Anonymous)


« Previous Topic · Off-topic · Next Topic »