# Recent questions tagged rsa-security-networks 1
In RSA public key cryptosystem suppose $n=p*q$ where $p$ and $q$ are primes. $(e,n)$ and $(d,n)$ are public and private keys respectively. Let $M$ be an integer such that $o< M< n$ and $\phi(n)=(p-1)(q-1)$ ... I and II I and III II and III I and IV
1 vote
2
The RSA encryption algorithm also works in reverse, that is, you can encrypt a message with the private key and decrypt it using the public key. This property is used in instruction detection systems digital signatures data compression certification
3
Alice and Bob use RSA public key encryption in order to communicate between them. Trudy finds out that Alice and Bob shared one of the primes used to determine the number n of their public key pairs. In other words, Trudy found out that na = pa × q and nb = pb × q. How can Trudy use this information to break Alice’s code?
1 vote
4
Using the RSA public key cryptosystem, with a = 1, b = 2 . . . y = 25, z = 26. (a) If p = 5 and q = 13, list five legal values for d. (b) If p = 5, q = 31, and d = 37, find e. (c) Using p = 3, q = 11, and d = 9, find e and encrypt ‘‘hello’’.
5
From a large set of prime numbers Jimmy choose 23 and 17 as P and Q respectively and a random integer to be 13. Jimmy wants to sends a plain text to M = 127. What will be the value of cipher text using RSA? since i am getting ciphertext =(127^13) mod 391 now how should i calculate
6
7
In an RSA system, the public key of given user is e = 31 and n = 3599. The private key of user will be ________
1 vote
8
How To Solve..? 17 * d = 1 mod 3120. should we need to apply bruteforce?
9
In RSA Algorithm, we have public key(e,n) and private key(d,n). Sender side we encrypt plain text P as an integer between 0 and n-1 as follows: $P^{e}modn$ and send it. At receiver side, we do the following: $(P^{e}modn)^{d}modn = P^{ed}modn$ ... encrypting the message P we are taking it as as integer between 0 and n-1. So, the P may not be coprime to n. Then how does the algorithm work?
1 vote
10
11
Plz tell me how to solve this .I am feeling problem o calculate -- 10 = p^5 mod 35 . How to solve this type of question quickly.
12
s1 only s1 and s2 s2,s3,s4 none of these
13
Alice chooses 5 and 11 as P and Q respectively and e is a random number 13. Public key for Alice 35. Private key for Bob 17. What is the value of Cipher text for Alice,Plain text for Bob, Private key for Alice, Public key for Bob? ----------------------------------------- ... -------------------------------------- Now I got confuse with formula and logic Can someone tell me which logic used where?
14
Consider the following statements with respect to digital signatures: S1: Digital signature ensures authenticity of the sender but not integrity of the message. S2: A single secret key can be used by the sender to sign multiple documents for multiple receiver. S3: Using a ... key. S4: Both RSA cryptosystem and RSA digital signature scheme uses same set of keys. Which of the following is true?
15
Please explain theorem in simplest way and solve example with explanation. Using RSA algorithm what is the value of cipher test c if the plain text m=5 and P=3, q=11 & d = 7 ( if d not given how to find d ).
1 vote
16
Message digest provides only message authentication or can it provide user authentication also? MDC is a digest for message authentication.Can i also say MAC is also a digest for sender authentication?Please explain this
In a RSA cryptosystem, a participant $A$ uses two prime numbers $p = 13$ and $q = 17$ to generate her public and private keys. If the public key of $A$ is $35$, then the private key of $A$ is __________ .