Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Gyu Chol Kim"'
Publikováno v:
PLoS ONE, Vol 18, Iss 11, p e0294840 (2023)
In order to prove the ElGamal CCA(Chosen Ciphertext Attack) security in the random oracle model, it is necessary to use the group where ICDH(Interactive Computational Diffie Hellman) assumption holds. Until now, only bilinear group with complex algeb
Externí odkaz:
https://doaj.org/article/1e05cb0891cf4867942b385ae546f83f
Publikováno v:
Theoretical Computer Science. :1-19
In RSA, private exponent is usually obtained from the preselected public exponent by extended Euclid algorithm and is roughly the same bit size as a modulus number. If the private exponent is preselected as in rebalanced RSA, then the public exponent
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b58a2d8c2f660b75109f2bf75b83afe4
https://doi.org/10.1016/j.tcs.2020.04.024
https://doi.org/10.1016/j.tcs.2020.04.024
Autor:
Gyu-Chol Kim, Su-Chol Li
Publikováno v:
PLoS ONE, Vol 15, Iss 10, p e0240248 (2020)
PLoS ONE
PLoS ONE
Public key cryptosystems such as RSA, rebalanced RSA and ElGamal have the disadvantage of serious asymmetry between encryption and decryption speed. We reduced the CRT (Chinese Remainder Theorem) exponents maintaining full sized private exponent in E
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cbe16ded182962d3442b5e79c3066833
https://doaj.org/article/54b5a3dd7b9e4b5890de7edbb7a71683
https://doaj.org/article/54b5a3dd7b9e4b5890de7edbb7a71683