Conjecture on RSA factorization O(k)

in cryptography •  6 years ago 

Conjecture on RSA factorization O(k)

Esempio

N=703

(703-3)/4=175

[175-(4n+1)]/3-[175-(4n+1)]/3-(2n+1)]/3=Z(4n+1)
,
4[175-(4n+1)]/3+1=(4Z+1)(4n+1)

https://steemit.com/cryptography/@logicalworld/conjecture-on-rsa-factorization-in-2-i-1-log-2-i-1-n

cryptography rsa factorization hacker cybersecurity
6 years ago by

Downvoting a post can decrease pending rewards and make it less visible. Common reasons:

  • Disagreement on rewards
  • Fraud or plagiarism
  • Hate speech or trolling
  • Miscategorized content or spam

Submit
$0.00
    1 vote
    1
    Authors get paid when people like you upvote their post.
    If you enjoyed what you read here, create your account today and start earning FREE STEEM!
    Sort Order:  
  • Trending
    • [-]
      ·  6 years ago 

    FALSE

    Downvoting a post can decrease pending rewards and make it less visible. Common reasons:

    • Disagreement on rewards
    • Fraud or plagiarism
    • Hate speech or trolling
    • Miscategorized content or spam

    Submit
    $0.00