We have seen that the security of the RSA Cryptosystem is related to the difficulty of
factoring large numbers. It is possible to construct Cryptosystems based on other difficult
number-theoretic problems. We now consider the El Gamal Cryptosystem, named after its
inventor, 'Taher El Gamal', which is based on the difficulty of a problem called the \discrete
logarithm."
Subscribe to:
Post Comments (Atom)
Posts
2 comments:
mas kalau bilangannya tidak bisa diterima sama variabel di pemrograman gimana ?
ya...biasanya kalau ak pakek konsep divide and conquer atau divide chaining yaitu kamu pangkatkan bilangan ndalam EL-Gamal sedikit demi sedikit biasanya pangkat dua terus pangkat empat,dst
Post a Comment