Solve Cryptography Exercises: Rabbin & RSA Protocols

  • Thread starter Thread starter kopros
  • Start date Start date
  • Tags Tags
    Cryptography
kopros
Messages
3
Reaction score
0
Hi I have stuck at these two exercises ...



1)

Suppose we use the Rabbin protocol and we have chosen p=31,q=51 and B=15. If we want to transmit the message M=20 which will be the encrypted message C?? Also what are the messages the recipient will receive decrypting C ??



2)

Suppose we work in RSA and Alice has the public key (n,e)=(667,3). Suppose m1=26, m2=46, and the signature of Alice in m1 is sig(m1). We want to find sig(m2). We have the right to give her a message x, x different from m2 and she will sign it. We can't use the factoring of 667 neither can we find the d from e=3. What message should we give her?

thnx alot
 
Physics news on Phys.org
kpros,

was this assigned as a homework problem in a class?

just curious.

DJ
 
Hi,
no I am just trying to solve them from a book I study these days..
 
kopros said:
Hi,
no I am just trying to solve them from a book I study these days..

Kopros,

What's the name of the book?

DJ
 
Introduction to Cryptography by Johannes Buchmann
 
I'll see if I have a copy. DJ
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...

Similar threads

Replies
13
Views
3K
Back
Top