search
Log In

Recent questions tagged rsa-security-networks

0 votes
1 answer
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
asked Mar 24 in Computer Networks jothee 110 views
1 vote
1 answer
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
asked Jul 2, 2019 in Computer Networks Arjun 542 views
0 votes
1 answer
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?
asked Mar 19, 2019 in Computer Networks ajaysoni1924 151 views
1 vote
2 answers
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’’.
asked Mar 19, 2019 in Computer Networks ajaysoni1924 217 views
0 votes
0 answers
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
asked Dec 17, 2018 in Computer Networks vijju532 146 views
1 vote
3 answers
8
How To Solve..? 17 * d = 1 mod 3120. should we need to apply bruteforce?
asked Jan 29, 2018 in Computer Networks hacker16 615 views
2 votes
0 answers
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?
asked Jan 12, 2018 in Computer Networks Ashish Sharma 3 610 views
2 votes
2 answers
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.
asked Jan 4, 2018 in Computer Networks ashwina 535 views
0 votes
2 answers
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?
asked Dec 11, 2017 in Computer Networks srestha 954 views
0 votes
1 answer
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?
asked Dec 3, 2017 in Computer Networks Appu B 293 views
0 votes
1 answer
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 ).
asked Dec 2, 2017 in Computer Networks Harikesh Kumar 498 views
1 vote
0 answers
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
asked Aug 13, 2017 in Computer Networks rahul sharma 5 109 views
0 votes
0 answers
17
Let m be the message and c be the cipher text. public key=(e,n) and private key=(d,n) c=pe mod(n) Now, raising c to power of d mod(n), we get plain text p = cd mod(n)=ped mod(n). Now since p=ped mod(n), this condition should be true : ed=1 mod(Φ(n)). I didn't understand this equation.
asked Jun 9, 2017 in Computer Networks Bad_Doctor 121 views
37 votes
12 answers
18
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 __________ .
asked Feb 14, 2017 in Computer Networks Arjun 11.6k views
1 vote
1 answer
19
How to find value of d in RSA algorithm given the values of p , n and e ? Example: p=11 q=7 hence n =77 z = 10 × 6 = 60 e =13 (given) Now d should be multiplicative inverse of e mod z.. How to find it ?
asked Jan 11, 2017 in Computer Networks Nitesh Methani 594 views
To see more, click for the full list of questions or popular tags.
...