( en | de | ru )

 

Disambiguation of "Chang, Ku-Young"

Author of the publication

copydeleteadd this publication to your clipboard
Anonymity-Based Authenticated Key Agreement with Full Binding Property.

, , , , and . WISA, volume 7690 of Lecture Notes in Computer Science, page 177-191. Springer, (2012)

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.

Ku-Ming Chang

Chang-ku Yang

Ku-Young Chung

Young-Sop Chang

Young-Soo Chang

 

Other publications of authors with the same name

Efficient Bit-Parallel Multiplier for Irreducible Pentanomials Using a Shifted Polynomial Basis., , and . IEEE Trans. Computers, 55 (9): 1211-1215 (2006)Practical Multi-party Versions of Private Set Intersection Protocols with Hardware Tokens., , , and . FGIT-FGCN/DCA, volume 350 of Communications in Computer and Information Science, page 72-79. Springer, (2012)Efficient Oblivious Transfer in the Bounded-Storage Model., , and . ASIACRYPT, volume 2501 of Lecture Notes in Computer Science, page 143-159. Springer, (2002)Space Efficient $GF(2^m)$ Multiplier for Special Pentanomials Based on $n$ -Term Karatsuba Algorithm., , , and . IEEE Access, (2020)Anonymity-Based Authenticated Key Agreement with Full Binding Property., , , , and . WISA, volume 7690 of Lecture Notes in Computer Science, page 177-191. Springer, (2012)Low Space Complexity $GF(2^m)$ Multiplier for Trinomials Using $n$ -Term Karatsuba Algorithm., , , and . IEEE Access, (2019)Necessity of Incentive System for the First Uploader in Client-Side Deduplication., and . CSA/CUTE, volume 373 of Lecture Notes in Electrical Engineering, page 397-402. Springer, (2015)New Block Recombination for Subquadratic Space Complexity Polynomial Multiplication Based on Overlap-Free Approach., , , and . IEEE Trans. Computers, 66 (8): 1396-1406 (2017)Comments on Ön the Polynomial Multiplication in Chebyshev Form"., , , and . IEEE Trans. Computers, 63 (12): 3162-3163 (2014)An extension of TYT algorithm for GF((2n)m) using precomputation., , , and . Inf. Process. Lett., 92 (5): 231-234 (2004)