Sung-Ming Yen |
|
|---|---|
Author's Web Page  | |
| 9 papers in database with 268 citations  H-number: 7 | |
Conference Papers |
|
| 1. Sung-Ming Yen, Wei-Chih Lien, Sang-Jae Moon, JaeCheol Ha, Power Analysis by Exploiting Chosen Message and Internal Collisions - Vulnerability of Checking Mechanism for RSA-Decryption, pp. 183 - 195, MYCRYPT 2005. [  Electronic
Edition][ Cited
27 times
] | |
| 2. Marc Joye, Sung-Ming Yen, The Montgomery Powering Ladder, pp. 291 - 302, CHES 2002. [ Electronic
Edition][Cited
140 times
 ] | |
| 3. Marc Joye, Sung-Ming Yen, One-Way Cross-Trees and Their Applications, pp. 346 - 356, PKC 2002. [ Electronic
Edition][Cited
4 times
] | |
| 4. Marc Joye, Sung-Ming Yen, New Minimal Modified Radix-r Representation with Applications to Smart Cards, pp. 375 - 384, PKC 2002. [ Electronic
Edition][Cited
13 times
] | |
| 5. Marc Joye, Jean-Jacques Quisquater, Sung-Ming Yen, Moti Yung, Observability Analysis - Detecting When Improved Cryptosystems Fail, pp. 17 - 29, CT-RSA 2002. [ Electronic
Edition][Cited
22 times
] | |
| 6. Sung-Ming Yen, Chi-Sung Laih, The Fast Cascade Exponentiation Algorithm and its Applications on Cryptography, pp. 447 - 456, ASIACRYPT 1992. [ Electronic
Edition][Cited
18 times
] | |
| 7. Tsutomu Matsumoto, Hideki Imai, Chi-Sung Laih, Sung-Ming Yen, On Verifiable Implicit Asking Protocols for RSA Computation, pp. 296 - 307, ASIACRYPT 1992. [ Electronic
Edition][Cited
28 times
] | |
| 8. Chi-Sung Laih, Sung-Ming Yen, Secure Addition Sequence and Its Application on the Server-Aided Secret Computation Protocols, pp. 219 - 230, ASIACRYPT 1992. [ Electronic
Edition][Cited
5 times
] | |
| 9. Chi-Sung Laih, Sung-Ming Yen, Lein Harn, Two Efficient Server-Aided Secret Computation Protocols Based on the Addition Sequence, pp. 450 - 459, ASIACRYPT 1991. [ Electronic
Edition][Cited
11 times
] | |
3755 authors,
5428 conference papers from 177 conference proceedings,
559 journal papers from 8 journals