Author of the publication

New packing method in somewhat homomorphic encryption and its applications.

, , , , and . Secur. Commun. Networks, 8 (13): 2194-2213 (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Parameters for Secure Elliptic Curve Cryptosystem - Improvements on Schoof's Algorithm., , , and . Public Key Cryptography, volume 1431 of Lecture Notes in Computer Science, page 253-257. Springer, (1998)Privacy-Preserving Wildcards Pattern Matching Using Symmetric Somewhat Homomorphic Encryption., , , , and . ACISP, volume 8544 of Lecture Notes in Computer Science, page 338-353. Springer, (2014)On the Hardness of Subset Sum Problem from Different Intervals., , and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 95-A (5): 903-908 (2012)Complexity bounds on Semaev's naive index calculus method for ECDLP., , , and . J. Math. Cryptol., 14 (1): 460-485 (2020)Practical Packing Method in Somewhat Homomorphic Encryption., , , , and . DPM/SETOP, volume 8247 of Lecture Notes in Computer Science, page 34-50. Springer, (2013)Generalized Security Analysis of the Random Key Bits Leakage Attack., , and . WISA, volume 7115 of Lecture Notes in Computer Science, page 13-27. Springer, (2011)Efficient Implementation of Schoof's Algorithm., , , and . ASIACRYPT, volume 1514 of Lecture Notes in Computer Science, page 66-79. Springer, (1998)Efficient Implementation of Schoof's Algorithm in Case of Characteristic 2., , and . Public Key Cryptography, volume 1751 of Lecture Notes in Computer Science, page 210-222. Springer, (2000)Computational hardness of IFP and ECDLP., , , and . Appl. Algebra Eng. Commun. Comput., 27 (6): 493-521 (2016)On the exact decryption range for Gentry-Halevi's implementation of fully homomorphic encryption., , , , and . J. Math. Cryptol., 8 (3): 305-329 (2014)