Author of the publication

Collusion-resistant convertible ring signature schemes.

, , , , and . SCIENCE CHINA Information Sciences, 58 (1): 1-16 (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.

Dipl.-Ing. Karl Kübler

Approach for manufacturer independent automated machine tool control software test, , , , and . Progress in production engineering; selected, peer reviewed papers from the 2015 WGP Congress, September 7 - 8, 2015, Hamburg, Germany, 794, page 347-354. Pfaffikon, Trans Tech Publ., (2015)
 

Other publications of authors with the same name

Fast Bit-Parallel Shifted Polynomial Basis Multiplier Using Weakly Dual Basis Over GF(2m)., and . IEEE Trans. VLSI Syst., 19 (12): 2317-2321 (2011)Efficient Bit-Parallel Multiplier for Irreducible Pentanomials Using a Shifted Polynomial Basis., , and . IEEE Trans. Computers, 55 (9): 1211-1215 (2006)Explicit formulae for Mastrovito matrix and its corresponding Toeplitz matrix for all irreducible pentanomials using shifted polynomial basis., , , and . Integration, (2016)Parallel GF(3m) multiplier for trinomials., , and . Inf. Process. Lett., 113 (4): 111-115 (2013)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)Low Complexity Multiplier Based on Dickson Basis Using Efficient Toeplitz Matrix-Vector Product., , , and . IEICE Transactions, 98-A (11): 2283-2290 (2015)Efficient Oblivious Transfer in the Bounded-Storage Model., , and . ASIACRYPT, volume 2501 of Lecture Notes in Computer Science, page 143-159. Springer, (2002)Low Complexity Bit-Parallel Multiplier for GF(2^m) Defined by All-One Polynomials Using Redundant Representation., , and . IEEE Trans. Computers, 54 (12): 1628-1630 (2005)Comments on Ön the Polynomial Multiplication in Chebyshev Form"., , , and . IEEE Trans. Computers, 63 (12): 3162-3163 (2014)Low Complexity Bit-Parallel Squarer for GF(2n) Defined by Irreducible Trinomials., and . IEICE Transactions, 89-A (9): 2451-2452 (2006)