How would you make a 2048 bit prime number randomizer?

Help
79

Where is it ? I can’t find it.

80
3 Likes
81

Thanks - I’ll see what I can do!

82

Yeah - @Blackhole927 I’m gonna need a lot of help

83

Found something that might be helpful (I understand close to nothing).

https://www.jstor.org/stable/3611701

84

Go to this @Anonymous

85

Yeah- the site anonymous mentioned contains formula is mentioned in the wikipedia article.

Here are, as far as I know, your only options:

  • Solve the Reimann hypothesis (bad idea)
  • Implement one of the formulas (bad idea)
  • Generate the prime numbers outside of gimkit, and copy paste them in. (good idea)
86

I’m gonna try 2 then 1 but NOT 3

87

Oy. If you need to do this, whatever it is, do 3. Oy.

88

No I will NOT do 3

89

How else will you do this?

90

I am one of the best problem-solvers when making GKC maps. Tell me what you’re doing, and I can (hopefully) help. Just tell us!

91

Read all the posts on this topic, then you’ll understand.

92

I have… oh God, I have. However, maybe there’s an alternate way to do it?

93

Solve the Riemann hypothesis to find the alternate way lol

94

No, there might be another way, depending on what he’s trying to do.

95

So what are you trying to do??? Please tell me!!! :scream: :scream: :scream: :scream: :scream: :scream: :scream: :scream:

96

He’s generating large prime numbers for an RSA algorithm. You would know this if you read the posts…

97

I did!!! I read all of them! I want to know why he needs them. I don’t know what RSA is, but I can still help if I know what he needs it for.

98

It’s encryption using large prime numbers or something.