| 2023 |
Practical Randomized Lattice Gadget Decomposition With Application to FHE. ESORICS 2023 |
| 2023 |
On Insecure Uses of BGN for Privacy Preserving Data Aggregation Protocols. Fundamenta Informaticae Vol. 188 |
| 2022 |
On Pairwise Gaussian bases and LLL algorithm for three dimensional lattices. Journal of the Korean Mathematical Society Vol. 59 |
| 2022 |
Memory-Efficient Algorithm for Scalar Multiplications on Twisted Edwards Curves for Isogeny-Based Cryptosystems. Mathematical Problems in Engineering Vol. 2022 |
| 2021 |
Analysis on Yu et al.’s dynamic algorithm for canonic DBC. Discrete Applied Mathematics Vol. 294 |
| 2021 |
Efficient Lattice Gadget Decomposition Algorithm with Bounded Uniform Distribution. IEEE Access Vol. 9 |
| 2021 |
Storage efficient algorithm for Hermite Normal Form using LLL. Linear Algebra and its Applications Vol. 613 |
| 2020 |
Algorithms for the Generalized NTRU Equations and Their Storage Analysis. Fundamenta Informaticae Vol. 17 |
| 2020 |
A refinement of M¨uller’s cube root algorithm. Finite Fields and their Applications Vol. 67 |
| 2020 |
New orthogonality criterion for shortest vector of lattices and its applications. Discrete Applied Mathematics Vol. 283 |
| 2020 |
Towards Round-Optimal Secure Multiparty Computations: Multikey FHE without a CRS. (Journal Version) International Journal of Foundations of Computer Science Vol. 31 |
| 2019 |
On the Security of Multikey Homomorphic Encryption. Cryptography and Coding, Lecture Notes in Computer Sciences 11929 |
| 2019 |
On the Non-repudiation of Isogeny Based Signature Scheme. Information Security Theory and Practice, Lecture Notes in Computer Sciences 11469 |
| 2019 |
Minimal condition for shortest vectors in lattices of low dimension. Electronic Notes in Discrete Mathematics Vol. 71 |
| 2019 |
Improving the Pocklington and Padr´o-S´aez Cube Root Algorithm. Bulletin of the Korean Mathematical Society Vol. 56 |
| 2018 |
Towards Round-Optimal Secure Multiparty Computations: Multikey FHE without a CRS, ACISP 2018. Lecture Notes in Computer Science Vol. 10946 |
| 2018 |
A Lattice Attack on Homomorphic NTRU with Non-invertible Public Keys. ICICS 2017, LNCS 10631 |
| 2017 |
Forgeable quantum messages in arbitrated quantum signature schemes. Quantum Information Processing Vol. 16 |
| 2017 |
Duplication Free Public Keys Based on SIS-Type Problems. Finite Fields and Their Applications Vol. 48 |
| 2017 |
On Pairing Inversion of the Self-bilinear Map on Unknown Order Groups. CSCML 2017, LNCS 10332 |
| 2017 |
Security analysis of a certificateless signature from lattices. Security and Communication Networks Vol. 2017 |
| 2016 |
An Efficient Lattice Reduction Using Reuse Technique Blockwisely on NTRU. Discrete Applied Mathematics Vol. 214 |
| 2016 |
Message Expansion of the BGN Cryptosystem Using Product Pairing. ETRI Journal Vol. 38 |
| 2016 |
Families of Pairing-Friendly Elliptic Curves from a Polynomial Modification of the Dupont-Enge-Morain Method. Applied Mathematics and Information Sciences 10 |
| 2015 |
Quantum signature scheme for known quantum messages. Physica Scripta Vol. 90 |
| 2015 |
Explicit formula for optimal ate pairing over cyclotomic family of elliptic curves. Finite Fields and Their Applications Vol.34 |
| 2015 |
A Depth Specific Description of Somewhat Homomorphic Encryption and Its Applications. Appl. Math. Inf. Sci. 9 |
| 2015 |
Polynomial representations for n-th roots in finite fields. J. Korean Math. Soc. Vol. 52 |
