mersenneforum.org  

Go Back   mersenneforum.org > Search Forums
Reload this Page Search Results
Register FAQ Search Today's Posts Mark Forums Read

Showing results 1 to 5 of 5
Search took 0.01 seconds. Search: Posts Made By: orever
Forum: CADO-NFS 2022-06-27, 23:26
Replies: 94
Views: 23,065
Posted By orever
Is this another case of a secret number or can...

Is this another case of a secret number or can you say the number?

Maybe with ECM you can factor faster, or is it an RSA key?
Forum: CADO-NFS 2022-06-27, 23:22
Replies: 94
Views: 23,065
Posted By orever
Have you tried to see if http://factordb.com/ has...

Have you tried to see if http://factordb.com/ has the number you want to factor?
Forum: Factoring 2022-04-25, 12:28
Replies: 55
Views: 5,329
Posted By orever
On this github there is code that says it factors...

On this github there is code that says it factors in a matter of hours. A number of 512-bit RSA keys.

https://github.com/eniac/faas

And so, anyone can factor a 512 very quickly.

If you use...
Forum: Operation Kibibit 2020-01-07, 00:09
Replies: 25
Views: 57,595
Posted By orever
Thanks for the answer. The complementary data: ...

Thanks for the answer.
The complementary data:
POLY:

skew: 3280536.395
c0: -2963521726450804168545574989181604944974055470262264097100
c1:...
Forum: Operation Kibibit 2020-01-06, 16:42
Replies: 25
Views: 57,595
Posted By orever
Hello, first. This text was written with the...

Hello, first.
This text was written with the help of google translator.

I am entering this world of factoring, 6 months ago.

I have problems factoring a number of 1024 bits, I know it is too...
Showing results 1 to 5 of 5

 
All times are UTC. The time now is 01:34.


Wed Jul 6 01:34:31 UTC 2022 up 82 days, 23:35, 0 users, load averages: 1.47, 1.33, 1.38

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.

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