mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Miscellaneous Math

Reply
 
Thread Tools
Old 2003-03-25, 02:57   #1
Exluminis
 
Mar 2003

32 Posts
Default [Req. Help] Devised Algorithm - Computing All RSA Challenges

With the database of prime numbers at disposal, it would be in best interest to start coding and deploying the proposed fully scalable distributed neural networking systems. Anyone interested in having a hand in the development of the cross-architecture system and project files (via postal mail) under NDA please email me. Quicksilver / Exluminis lead developers in W-XCTV Enterprises(tm) project, "Qualitative Prime Link(tm)". It is a delightful challenge to teach our higher level form of mathematics to all whom seek it.

I am looking for programmers with specific diciplines of mathematics and fundamental understandings.
Requiring developers with high end knowledge in the following areas:
Alpha/PPC/SPARC/x86 (SMP) assembly - highly optimized
Neural Network Programming / (Bubble and or Fuzzy Logic)
Distributed Networks Development
Low-level OSI and TCP/IP coding

If you have other abilities useful in decrypting current public key systems, please do email me.

I assure you that the proposed algorithm will blow you away. The above just describes the beginning. It should only take a matter of weeks after the system is deployed. We can prove these encryption systems a joke and any other ones devised based upon public key cryptology. If we break these factor challenges, it will just be a matter of time before RSA releases a new set of challenges that will just as easily be defeated.

There will be a new number for people to study. It will be similar to epsilon, pi, or the golden ratio. Interested in taking the journey?

- ultimic@x-mail.net
- [ The theory of "Connectivity through Universal Proximity Factors and Redundancy" (*William Sawyer 2.3) ]
- Bye all. 34486710031212
Exluminis is offline   Reply With Quote
Old 2003-03-25, 06:08   #2
TTn
 

7·13·107 Posts
Default

What is this number all about? I am interested in numbers like pi, Phi, e, etc. Is it composite like pi?
  Reply With Quote
Old 2003-03-25, 06:28   #3
crash893
 
crash893's Avatar
 
Sep 2002

23·37 Posts
Default

i think its more along the lines of looking at all the past primes and factors to try to make predicting numbers more rewarding.

soemthing like that
crash893 is offline   Reply With Quote
Old 2003-03-25, 21:21   #4
ewmayer
2ω=0
 
ewmayer's Avatar
 
Sep 2002
República de California

1173710 Posts
Default Re: [Req. Help] Devised Algorithm - Computing All RSA Challe

Quote:
Originally Posted by Exluminis
I assure you that the proposed algorithm will blow you away.
Call me a narrow-minded skeptic, but somehow, I'm not yet feeling assured.
Why don't you help me out by doing something that should be quite easy for
such a breakthrough algorithm to do, say, by factoring the smallest
outstanding RSA challenge number, which is RSA-576, having 576 bits and
174 decimal digits:

18819881292060796383869723946165043980716356337941
73827007633564229888597152346654853190606065047430
45317388011303396716199692321205734031879550656996
221305168759307650257059

That would be a good way to get folks to participate in your proposed
project. Since the above number is so small, it shouldn't need a whole
lot of assembly-code wizardry or distributed computing for you to crack.
We can save that kind of fancy stuff for the really big numbers RSA will
surely start throwing out in their desperation, once they realize how
woefully inadequate their encryption schemes are.
ewmayer is offline   Reply With Quote
Old 2003-03-26, 03:24   #5
crash893
 
crash893's Avatar
 
Sep 2002

4508 Posts
Default

rough but effective test
crash893 is offline   Reply With Quote
Old 2003-03-28, 17:51   #6
Exluminis
 
Mar 2003

32 Posts
Default

You may be right. You obviously have more experience with mathematics than myself-- but I do have the ability to effectively coordinate this orchestrated system. It takes time to code, but with enough throughput on all levels and processing power the recorded data may benefit many fields even if it is not useful in the factorization process. I was quite arrogant to say that it will happen in two weeks. And I do apologize for any misleading information, but this is meant to gather talented individuals to assembly, to that we may develop the system. Mete me as you may whence we compute the algorithms of complexity devised to public-key crypt information.
Exluminis is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
GPU Computing Cheat Sheet (a.k.a. GPU Computing Guide) Brain GPU Computing 20 2015-10-25 18:39
Two possible challenges devarajkandadai Miscellaneous Math 1 2013-11-09 23:30
The RSA Challenges - RIP BotXXX Factoring 16 2007-05-27 03:37
The difference between P2P and distributed computing and grid computing GP2 Lounge 2 2003-12-03 14:13
[help] Devised Algorithm Cmpting. All RSA Factr. Challenges Exluminis Software 2 2003-03-26 15:50

All times are UTC. The time now is 08:19.


Sun Jul 3 08:19:36 UTC 2022 up 80 days, 6:20, 0 users, load averages: 1.05, 1.31, 1.32

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2022, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.

≠ ± ∓ ÷ × · − √ ‰ ⊗ ⊕ ⊖ ⊘ ⊙ ≤ ≥ ≦ ≧ ≨ ≩ ≺ ≻ ≼ ≽ ⊏ ⊐ ⊑ ⊒ ² ³ °
∠ ∟ ° ≅ ~ ‖ ⟂ ⫛
≡ ≜ ≈ ∝ ∞ ≪ ≫ ⌊⌋ ⌈⌉ ∘ ∏ ∐ ∑ ∧ ∨ ∩ ∪ ⨀ ⊕ ⊗ 𝖕 𝖖 𝖗 ⊲ ⊳
∅ ∖ ∁ ↦ ↣ ∩ ∪ ⊆ ⊂ ⊄ ⊊ ⊇ ⊃ ⊅ ⊋ ⊖ ∈ ∉ ∋ ∌ ℕ ℤ ℚ ℝ ℂ ℵ ℶ ℷ ℸ 𝓟
¬ ∨ ∧ ⊕ → ← ⇒ ⇐ ⇔ ∀ ∃ ∄ ∴ ∵ ⊤ ⊥ ⊢ ⊨ ⫤ ⊣ … ⋯ ⋮ ⋰ ⋱
∫ ∬ ∭ ∮ ∯ ∰ ∇ ∆ δ ∂ ℱ ℒ ℓ
𝛢𝛼 𝛣𝛽 𝛤𝛾 𝛥𝛿 𝛦𝜀𝜖 𝛧𝜁 𝛨𝜂 𝛩𝜃𝜗 𝛪𝜄 𝛫𝜅 𝛬𝜆 𝛭𝜇 𝛮𝜈 𝛯𝜉 𝛰𝜊 𝛱𝜋 𝛲𝜌 𝛴𝜎𝜍 𝛵𝜏 𝛶𝜐 𝛷𝜙𝜑 𝛸𝜒 𝛹𝜓 𝛺𝜔