MHB How Can You Multiply Ciphertexts in ElGamal Without Decrypting?

  • Thread starter Thread starter mathmari
  • Start date Start date
  • Tags Tags
    Encryption System
mathmari
Gold Member
MHB
Messages
4,984
Reaction score
7
Hey! :o

At an ElGamal encryprion system at the group $\mathbb{Z}_{786}^{\star}$ with base $g=\overline{2}$ ( it is a generator ) the public key of Alice is $y=\overline{5}$. We see to encryptions $(r_1, c_1)=(318, 191)$ of the unknown message $m_1$ and $(r_2, c_2)=(79, 118)$ of the unkown message $m_2$. Show how you can calculate the encryption of the message $m_1 \cdot m_2 \pmod p$(without calculations $m_1$ and $m_2$).

Could you give me some hints what we could do ?? (Wondering)
 
Mathematics news on Phys.org
mathmari said:
Hey! :o

At an ElGamal encryprion system at the group $\mathbb{Z}_{786}^{\star}$ with base $g=\overline{2}$ ( it is a generator ) the public key of Alice is $y=\overline{5}$. We see to encryptions $(r_1, c_1)=(318, 191)$ of the unknown message $m_1$ and $(r_2, c_2)=(79, 118)$ of the unkown message $m_2$. Show how you can calculate the encryption of the message $m_1 \cdot m_2 \pmod p$(without calculations $m_1$ and $m_2$).

Could you give me some hints what we could do ?? (Wondering)

Hi mathmari, :)

Elgamal is a Partially Homomorphic encryption scheme which means that there's a correspondence between the operations over the cipertext and the operations over the plaintext. The correspondence is multiplication. So when you multiply two ciphertexts the underlying plaintexts will be multiplied.

Hope this helps. :)
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.

Similar threads

Replies
3
Views
2K
Back
Top