Why does some key pair for RSA return same value

  • Thread starter Thread starter f24u7
  • Start date Start date
  • Tags Tags
    Pair Value
AI Thread Summary
Certain RSA key pairs, such as (5,7) and (13,19), exhibit a unique behavior where they yield the same result when encrypting and decrypting. This raises the question of whether there is a mathematical pattern that explains this phenomenon. The discussion highlights the importance of clarifying the conventions used in RSA, particularly the encoding exponent and modulus. One participant points out a potential misunderstanding regarding modular arithmetic, suggesting that specific examples would help clarify the inquiry. Overall, the conversation centers on the mathematical principles underlying RSA encryption and the need for precise definitions to explore this behavior further.
f24u7
Messages
46
Reaction score
0
There are certain key pairs of RSA that will return the same exact value when encrypt and decrypt, for example (5,7) and (13,19)

is there a mathematical pattern that describes this behavior?

Any advice would be appreciated
 
Technology news on Phys.org
What convention are you using? The only one I've seen is (encoding exponent, modulus), but 2^5 \equiv 4 \pmod 7 and 2^7 \equiv 3 \pmod 5, so I presume I have misunderstood your question. Can you give a more specific example?
 

Thread 'Learning Assembly and computer architecture for x86'

Dear Peeps I have posted a few questions about programing on this sectio of the PF forum. I want to ask you veterans how you folks learn program in assembly and about computer architecture for the x86 family. In addition to finish learning C, I am also reading the book From bits to Gates to C and Beyond. In the book, it uses the mini LC3 assembly language. I also have books on assembly programming and computer architecture. The few famous ones i have are Computer Organization and...
View full post »

Thread 'Microsoft Technical Interview question'

I had a Microsoft Technical interview this past Friday, the question I was asked was this : How do you find the middle value for a dataset that is too big to fit in RAM? I was not able to figure this out during the interview, but I have been look in this all weekend and I read something online that said it can be done at O(N) using something called the counting sort histogram algorithm ( I did not learn that in my advanced data structures and algorithms class). I have watched some youtube...
View full post »

Similar threads

Example of encryption key pair algorithm?
Replies
1
Views
3K
Comp Sci RSA to encrypt English Alphabets, any restrictions?
Replies
7
Views
2K
I Confusion about line pairs per millimeter
Replies
4
Views
1K
A Why KE of Annihilation Electrons Differs?
Replies
11
Views
2K
I Why does doping make resonating valence bonds (singlet pairs) mobile?
Replies
2
Views
1K
A How Does the ss¯ Pair Affect the Partial Width Γ2 in Gluon Decays?
Replies
4
Views
3K
Fortran Why Does My Fortran Subroutine Return the Same Value?
Replies
7
Views
3K
Strange change in behavior of home/F11 and end/F12 keys on Dell laptop
Replies
3
Views
3K
I Why does the answer key sometimes have a different form compared to my solution?
2
Replies
68
Views
5K
Math name for asymetric-pair relationship?
Replies
1
Views
2K

Hot Threads

Recent Insights

Back
Top