Page 121 - untitled

เݡΪ

Yang, Bo-Yin ਿ ͉ ༟ ࣘ Research Description
͉
͉
͉
ਿ
ਿ
ਿ
ਿ ͉ ༟ ࣘ
༟
ࣘ
ࣘ
༟
ࣘ
Research Description
༟
ᔖcc၈jਓ޼ӺࡰAssociate Research Fellow (2006/8--) My research interests can be roughly divided protocol; the other is the study of cryptography that
into the following areas: Effective Crypto Algo- resists the advent of Quantum Computers, which are
௰৷ኪዝjPh.D., Mathematics, MIT (1991) rithms (especially for Low-Resource and Pervasive rumored to arrive within two decades. Our research
Applications); Cryptology (including Post-Quantum in MPKCs (Multivariate Public-Key Cryptosystems)
ཥcc༑j+886-2-2788-3799 ext. 1731 Cryptosystems and Algebraic Cryptanalysis) and which depends on the difficulty of instances in EIP
other Combinatorial Studies (including Analysis of (Extended Isomorphism of Polynomials) and Multi-
ෂccॆj+886-2-2782-4814 Algorithms and other topics). variate Quadratic problems, has advanced the under-
ཥɿڦᇌjbyyang@iis.sinica.edu.tw, by@moscito.org standing of the field in both theoretical and practical
1. Effective Crypto Algorithms especially for viewpoints. MPKCs operate on a vector of vari-
ၣccࠫjhttp://www.iis.sinica.edu.tw/pages/byyang Low-Resource and Pervasive Applications: ables over a small field as opposed to an element in Research Fellows
a huge algebraic structure (as in RSA or ECC). This
It seems that computers are everywhere, work-
key characteristic makes MPKCs faster at compara-
ing invisibly and seamlessly. As it is getting more
ble design security. This is useful for low-resource
and more ubiquitous, security and privacy becomes
environments, such as embedded systems and smart
pressing issues. RSA may be on its way out within
cards. Recently we have proposed several analysis
5-10 years even without the advance of Quantum
• Adjunct Research Fellow, Taiwan Information Secu- Computing. Indeed, NATO is standardizing on ECC and improvements in the design of such primitives.
Research Fellows
r
rity Center, 2005-- (ECIES, ECDSA) as the next standard. This is due B. Algebraic Cryptanalysis: We have made
to the need for security in pervasive or ubiquitous practical advances to equation-solving and algebraic
• Associate Professor of Mathematics, Tamkang Uni- ޼Ӻᔊʧ computing. RSA is simply too heavy-weight to fit cryptanalysis, especially those including Gröbner
Ӻ
ʧ
ᔊ
޼Ӻᔊʧ
޼
versity, 1992--2006 all occasions. Even the proponents concede this Bases and the related XL (eXtended Linearization)
point. We study topics ranging from restricted lin- method and its variants. Such methods of attack has
• Postdoc, Institute of Mathematics 1992 ͉ɛ˴ࠅٙ޼Ӻ̍ў੗ᇁኪଣሞ৷ࣖଟٙ੗ᇁ ear algebra, resource-limited arithmetic, fast arith- revolutionized the field of stream ciphers and led the
• Ph.D., Mathematics, MIT (1991) ྼЪၾՉ˼ଡ଼Υᅰኪሙᕚഃfᗫ׵੗ᇁኪଣሞdତ metic to efficient primitives. European Ecrypt project to reissue a call for primi-
tives; at the moment they are still in their shakeout
චݬ˴ࠅ޼Ӻމܝඎɿࣛ˾੗ᇁኪၾ˾ᅰॎ੗ኪd Our recent work in this area includes design-
• B.S., Physics, National Taiwan University (1987) phase in looking for a replacement to the venerable
ing a module that can do a signature for a low power
ܝ٫ಀிϓڐ఻ϋЕݴό̋੗ӻ୕ٙɽήቤdᆄ RC4 cipher. We are still working on faster imple-
RFID tag within the standard constraints of power
mentations of such work.
ݲ੗ᇁኪࠇྌ Ecrypt ɰΪϤʮකᅄӋ RC4 ٙܝᘱ and current.
٫f͉ɛί༆˙೻ଡ଼ٙଣሞձྼყɪѩϞอٙԈ༆ 2. Cryptology: In this area, we concentrate in the 3. Other Combinatorial Studies
following areas:
ၾഹЪdԨᘱᚃ޼ӺϤ˙ࠦٙҷආfίۃ٫dҢࡁ I work on many other combinatorial prob-
lems especially those dealing with enumeration and
݊޼Ӻεᜊඎ੗ᇁኪٙਖ਼࢕iεᜊඎʮකږᝌ੗ᇁ A. Post-Quantum Cryptography: There are analysis of algorithms that deals with iterative or
two major meanings for this term: One is the study
ӻ୕݊ɓ၇̙˸תҤඎɿཥ໘ҸᏘٙอӻ୕d௰ڐ of cryptosystems using quantum effects to estab- recursive structures that can be handled by standard
combinatorial methods.
lish security and privacy, such as the famous BB84
Ϊމඎɿཥ໘̙ঐึίɤՑɚɤϋගྼ᜗ʷdԨҁ
Ό࿣์ତϞٙ RSA, ECC, ElGamal ഃӻ୕ϾաՑࠠ
ൖf͉ɛίϤჯਹ౤̈əɓԬอٙӻ୕ձɓԬᔚϞ
Selected Publications
Selected Publications
ӻ୕ٙʱؓၾҷഛdԨߧɢ׵வᗳӻ୕ྼ͜ʷٙʈ
1. B.-Y. Yang and Y. Yeh, Zigging and Zagging in Pentachains, Adv. in 7. B.-Y. Yang, J.-M. Chen, and N. Courtois, On Asymptotic Security
Ъfί৷ࣖଟٙ੗ᇁኪྼЪ˙ࠦdՍ͍޼Ӻ̙˸Ꮠ Appl. Math. 16(1995) pp. 72-94. Estimates in XL and Gröbner Bases-Related Algebraic Cryptanalysis,
th
͜ίЭ༟๕ձʃӻ୕ɪd˸ၪᚐ༟ৃτΌၾᒯӷٙ 2. W.-C. Huang, B.-Y. Yang, and Y. Yeh, From Ternary Strings to Wie- Proc. 6 Int’l Conference on Information and Communications Secu-
ner indices of Benzenoid Chains, Discrete Appl. Math. 73(1997), rity; LNCS V. 3269 (2004), pp. 401-413.
੗ᇁӻ୕ձஷৃ՘֛f௰ڐಀ༊Ъɓࡈ̙˸ৣΥЭ pp. 113-131. 8. B.-Y. Yang and J.-M. Chen, All in the XL Family: Theory and Prac-
th
3. H.-K. Hwang, B.-Y. Yang, and Y. Yeh, Presoting Algorithms: an Av- tice, Proc. 7 International Conference on Information Security and
̌ଟ࢛᎖፫ᗆᅺᜀ (RFID) ٙᅰЗᖦ௝ӻ୕ྼЪd erage Case Point of View, Theo. Comp. Sci. 242(2000), no. 1-2, pp. Cryptology (ICISC '04, Dec. 2-3, Seoul, Korea), LNCS V. 3506 (2005),
̙˸တԑՉᘌ߭ٙཥݴၾঐඎࠢՓf௰ܝd͉ɛ͵ 29-40. pp. 67-86.
4. B.-Y. Yang and Y. Yeh, A Crowning Moment for Wiener Indices, Stud- 9. S.-P. Eu, B.-Y. Yang, and Y. Yeh, Computing the Generalized Wie-
Ϟጳሳ׵ε၇ଡ଼Υᅰኪٙ޴ᗫ޼Ӻdतй݊ࠇᅰ׌ ies in Applied Mathematics, 112(2004), pp. 333-340. ner Indices of Hex Chains, Int'l J. of Quant. Chem. 106(2006),
5. B.-Y. Yang and J.-M. Chen, Theoretical Analysis of XL over Small pp. 426-435.
ଡ଼Υਪᕚձစၑجٙʱؓf th
Fields, Proc. 9 Austral-asian Conference on Information Security 10. B.-Y. Yang, C.-M. Cheng, B.-R. Chen, and J.-M. Chen, Implementing
and Privacy; LNCS V. 3108 (2004), pp. 277-288. Minimized Multivariate Public-Key Cryptosystems on Low-Resource
rd
6. B.-Y. Yang, Y.-H. Chen, and J.-M. Chen, TTS: High-Speed Signa- Embedded Systems, Proc. 3 Security of Pervasive Computing Con-
th
tures on a Low-Cost Smart Card, Proc. 6 Workshop on Crypto- ference, LNCS v. 3934 (2006), pp. 73-88.
graphic Hardware and Embedded Systems; LNCS V. 3156 (2004),
pp. 371-385.
110
110 111