Click here to Skip to main content
Click here to Skip to main content
Search within:



 
Comments & Discussions

Factoring RSA Numbers Using Goldbach's Conjecture

By , 4 Jan 2012
 

Revisions


  

Compare Revision Minor Date Status Editor
publicly available No 9 Jan '12 - 11:47 Available Sean Ewington
2 No 5 Jan '12 - 8:40 Available Sean Ewington
1 No 4 Jan '12 - 13:40 Composing Sean Ewington

License

This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

About the Author

 RogerGDoss
Software Developer (Senior)
United States United States
Member
Dr. Doss holds a PhD in Applied Computer Science. His research interests include Operating Systems, Networking, Theory of NP Completeness,and Software Engineering.
http://www.rdoss.com

About Article
Exploring the dream of designing a new algorithm for factoring semi-primes
Type Article
Licence CPOL
First Posted 4 Jan 2012
Views 6,034
Downloads 176
Bookmarked 3 times
Top News

Old Japanese Man Creates Amazing Art Using Excel (Wait, Excel?)

Get the Insider News free each morning.
Related Videos
Beginners Java Programming - 0703 Using The Scanner To Input Numbers
JavaScript: Function Parameters Part 2
Factoring Algorithms for Selected RSA Numbers
Template Meta Programming and Number Theory
Public Key RSA Encryption in C# .NET
CPP Math and Fun
Build your own cryptographically safe server/client protocol
Prime Number Determination Using Wheel Factorization
Applied Crypto++: Using the RSA Digital Signature System (Part I)
Cryptographic Interoperability: Keys
Encryption - RSA implemented through Java Script to Encryt/Decrypt data
RSA Library with Private Key Encryption in C#
Project Estimation with Use Case Points
BigInteger Library
Cryptography 101 for the .NET Framework
RSA Interoperability between JavaScript and RSACryptoServiceProvider - Form Login Example
Object Oriented JavaScript Class Library in C#/.NET Style
Next Generation of Cryptography for Microsoft Windows Vista
Re-entrant C++/MFC programming
Find Prime Numbers in C# Using the Sieve of Eratosthenes
Creating an Asymmetric/Symmetric Secure Stream without SSL
Improved Algorithm to compute the nearest possible prime number to an input pPrime
Permalink | Advertise | Privacy | Mobile
Web04 | 2.6.130523.1 | Last Updated 4 Jan 2012
Article Copyright 2012 by RogerGDoss
Everything else Copyright © CodeProject, 1999-2013
Terms of Use
Layout: fixed | fluid