Possible plain text needed on a congruence modulo - based encryption

Robert Huang

1/7/24, 3:07 PM

Suppose m is a positive integer converted from the plain text in bytes.

And there are two positive integers a, b which satisfies $a^2=1+4919b^2$ in the encryption process. (a and b are both unknown)

The cipher text is x which satisfies $x = (am+b) mod p$ where p is known and is a large prime number.

For some reasons, the cipher texts are shuffled by group. And so I got several possible values of x (which are all very large)

Given the cues above, how to get the possible integer number m? The possible m can be checked by deciding if the plain text converted from the m makes sense.

Any detailed solution would be appreciated, thank you!

0 + 1

number-theory

congruence

Lev

1/12/24, 9:10 PM

Could you be more verbose as to what you mean by ciphertexts were shuffled by a group?

Elon Musk

I sit in a Tesla and translated this thread with Ai:

EN: Possible plain text needed on a congruence modulo - based encryption

Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.