This is the top of the page.
Displaying present location in the site.
  1. Home
  2. About NEC
  3. Research & Development
  4. Code and Cryptography
  5. Paper List
Main content starts here.

Paper List



  • Tal Malkin, Isamu Teranishi, Moti Yung: Key dependent message security: recent results and applications. CODASPY 2011: 3-12
  • Tal Malkin, Isamu Teranishi, Moti Yung: Efficient Circuit-Size Independent Public Key Encryption with KDM Security. EUROCRYPT 2011: 507-526
  • Tal Malkin, Isamu Teranishi, Yevgeniy Vahlis, Moti Yung: Signatures Resilient to Continual Leakage on Memory and Computation. TCC 2011: 89-106
  • Satoshi Obana: Almost Optimum t-Cheater Identifiable Secret Sharing Schemes. EUROCRYPT 2011: 284-302
  • Sumio Morioka, Toshiyuki Isshiki, Satoshi Obana, Yuichi Nakamura, Kazue Sako: Flexible architecture optimization and ASIC implementation of group signature algorithm using a customized HLS methodology. HOST 2011: 57-62
  • Kazuhiko Minematsu, Tomoyasu Suzaki, Maki Shigeri: On Maximum Differential Probability of Generalized Feistel. ACISP 2011: 89-105
  • Kazuhiko Minematsu, Tetsu Iwata: Building Blockcipher from Tweakable Blockcipher: Extending FSE 2009 Proposal. IMA Int. Conf. 2011: 391-412
  • Tomoyasu Suzaki, Kazuhiko Minematsu, Sumio Morioka and Eita Kobayashi: Twine: A Lightweight, Versatile Blockcipher. ECRYPT Workshop on Lightweight Cryptography (LC11), 2011.


  • Toshiyuki Isshiki, Koichiro Wada, Keisuke Tanaka: A Rational Secret-Sharing Scheme Based on RSA-OAEP. IEICE Transactions 93-A(1): 42-49 (2010)
  • Frederik Armknecht, Jun Furukawa: On the Minimum Communication Effort for Secure Group Key Exchange. Selected Areas in Cryptography 2010: 320-337
  • Jun Furukawa, Kengo Mori, Kazue Sako: An Implementation of a Mix-Net Based Network Voting Scheme and Its Use in a Private Organization. Towards Trustworthy Elections 2010: 141-154
  • Tomoyasu Suzaki, Kazuhiko Minematsu: Improving the Generalized Feistel. FSE 2010: 19-39
  • Kazuhiko Minematsu: How to Thwart Birthday Attacks against MACs via Small Randomness. FSE 2010: 230-249


  • Jun Furukawa, Kazue Sako, Satoshi Obana: IC card-based single sign-on system that remains secure under card analysis. Digital Identity Management 2009: 63-72
  • Isamu Teranishi, Jun Furukawa, Kazue Sako: k-Times Anonymous Authentication. IEICE Transactions 92-A(1): 147-165 (2009)
  • Kazuhiko Minematsu: Beyond-Birthday-Bound Security Based on Tweakable Block Cipher. FSE 2009: 308-326
  • Kazuhiko Minematsu, Toshiyasu Matsushima: Generalization and Extension of XEX* Mode. IEICE Transactions 92-A(2): 517-524 (2009)
  • Yukiyasu Tsunoo, Teruo Saito, Hiroki Nakashima, Maki Shigeri: Higher Order Differential Attack on 6-Round MISTY1. IEICE Transactions 92-A(1): 3-10 (2009)
  • Yukiyasu Tsunoo, Hiroki Nakashima, Hiroyasu Kubo, Teruo Saito, Takeshi Kawabata: Results of Linear Cryptanalysis Using Linear Sieve Methods. IEICE Transactions 92-A(5): 1347-1355 (2009)


  • Akira Numayama, Toshiyuki Isshiki, Keisuke Tanaka: Security of Digital Signature Schemes in Weakened Random Oracle Models. Public Key Cryptography 2008: 268-287
  • Isamu Teranishi, Wakaha Ogata: Relationship between Two Approaches for Defining the Standard Model PA-ness. ACISP 2008: 113-127
  • Isamu Teranishi, Wakaha Ogata: Cramer-Shoup Satisfies a Stronger Plaintext Awareness under a Weaker Assumption. SCN 2008: 109-125
  • Isamu Teranishi, Wakaha Ogata: Relationship between Standard Model Plaintext Awareness and Message Hiding. IEICE Transactions 91-A(1): 244-261 (2008)
  • Isamu Teranishi, Takuro Oyama, Wakaha Ogata: General Conversion for Obtaining Strongly Existentially Unforgeable Signatures. IEICE Transactions 91-A(1): 94-106 (2008)
  • Kaoru Kurosawa, Jun Furukawa: Universally Composable Undeniable Signature. ICALP (2) 2008: 524-535
  • Jun Furukawa, Nuttapong Attrapadung, Ryuichi Sakai, Goichiro Hanaoka: A Fuzzy ID-Based Encryption Efficient When Error Rate Is Low. INDOCRYPT 2008: 116-129
  • Jun Furukawa, Frederik Armknecht, Kaoru Kurosawa: A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort. SCN 2008: 392-408
  • Yukiyasu Tsunoo, Etsuko Tsujihara, Maki Shigeri, Teruo Saito, Tomoyasu Suzaki, Hiroyasu Kubo: Impossible Differential Cryptanalysis of CLEFIA. FSE 2008: 398-411
  • Yukiyasu Tsunoo, Teruo Saito, Hiroyasu Kubo, Tomoyasu Suzaki: Key Recovery Attack on Stream Cipher Mir-1 Using a Key-Dependent S-Box. ICICS 2008: 128-140
  • Yukiyasu Tsunoo, Teruo Saito, Maki Shigeri, Takeshi Kawabata: Higher Order Differential Attacks on Reduced-Round MISTY1. ICISC 2008: 415-431
  • Yibo Fan, Jidong Wang, Takeshi Ikenaga, Yukiyasu Tsunoo, Satoshi Goto: An Unequal Secure Encryption Scheme for H.264/AVC Video Compression Standard. IEICE Transactions 91-A(1): 12-21 (2008)
  • Tsunoo Yukiyasu, Tsujihara Etsuko, Shigeri Maki, Suzaki Tomoyasu, Kawabata Takeshi: Cryptanalysis of CLEFIA using Multiple Impossible Differentials. ISITA 2008:


  • Toshinori Araki, Satoshi Obana: Flaws in Some Secret Sharing Schemes Against Cheating. ACISP 2007: 122-132
  • Jun Furukawa, Hideki Imai: An Efficient Aggregate Shuffle Argument Scheme. Financial Cryptography 2007: 260-274
  • Jun Furukawa, Nuttapong Attrapadung: Fully Collusion Resistant Black-Box Traitor Revocable Broadcast Encryption with Short Private Keys. ICALP 2007: 496-508
  • Jun Furukawa, Kazue Sako: An Efficient Publicly Verifiable Mix-Net for Long Inputs. IEICE Transactions 90-A(1): 113-127 (2007)
  • Nuttapong Attrapadung,Jun Furukawa, Takeshi Gomi, Goichiro Hanaoka, Hideki Imai, Rui Zhang: Efficient Identity-Based Encryption with Tight Security Reduction. IEICE Transactions 90-A(9): 1803-1813 (2007)
  • Kazuhiko Minematsu, Toshiyasu Matsushima: New Bounds for PMAC, TMAC, and XCBC. FSE 2007: 434-451
  • Kazuhiko Minematsu, Toshiyasu Matsushima: Tweakable Enciphering Schemes from Hash-Sum-Expansion. INDOCRYPT 2007: 252-267
  • Kazuhiko Minematsu, Toshiyasu Matsushima: Improved MACs from Differentially-Uniform Permutations. IEICE Transactions 90-A(12): 2908-2915 (2007)
  • Yukiyasu Tsunoo, Teruo Saito, Takeshi Kawabata, Hiroki Nakashima: Distinguishing Attack Against TPypy. Selected Areas in Cryptography 2007: 396-407
  • Yukiyasu Tsunoo, Teruo Saito, Hiroyasu Kubo, Tomoyasu Suzaki: Cryptanalysis of Mir-1: A T-Function-Based Stream Cipher. IEEE Transactions on Information Theory 53(11): 4377-4383 (2007)
  • Yukiyasu Tsunoo, Teruo Saito, Hiroyasu Kubo, Tomoyasu Suzaki: A Distinguishing Attack on a Fast Software-Implemented RC4-Like Stream Cipher. IEEE Transactions on Information Theory 53(9): 3250-3255 (2007)
  • Yibo Fan, Jidong Wang, Takeshi Ikenaga, Yukiyasu Tsunoo, Satoshi Goto: A New Video Encryption Scheme for H.264/AVC. PCM 2007: 246-255


  • N. Kamiya and S. Shioiri,“Concatenated QC-LDPC and SPC Codes for 100Gbps Ultra Long-Haul Optical Transmission Systems,”OFC/NFOEC2010, OThL2, 2010.
  • N. Kamiya and E. Sasaki,“Efficient encoding of QC-LDPC codes related to cyclic MDS codes,” IEEE Journal on Selected Areas in Communications, vol.27, pp.846-854, 2009.
  • T. Okamura, “A Hybrid ARQ Scheme Based on Rate-Compatible Low- Density Parity-Check Codes by Shortening and Extending,'' Trans. IEICE vol.92E-A, pp.2883-2890, 2009.
  • T. Okamura, " A Hybrid ARQ Scheme based on Shortened Low-Density Parity-Check Codes,'' Proceeding of IEEE WCNC'08, pp.82-87, Mar., 2008.
  • N. Kamiya,“High-rate quasi-cyclic low-density parity-check codes derived from finite affine planes,”IEEE Transactions on Information Theory, vol.53, pp.1444-1459, 2007.
  • N. Kamiya and E. Sasaki, “Design of High-Rate QC-LDPC Encoder/Decoder for Microwave Radio Systems,”Proceedings of IEEE GLOBECOM 2007, pp.1744-1748, 2007.
  • N. Kamiya and M. P. C. Fossorier,“Quasi-cyclic codes from a finite affine plane,”Designs, Codes and Cryptography, vol.38, pp.311-329, 2006.
  • T. Okamura, “On the Construction of Quasi-Cyclic Low-Density Parity-Check Codes,'' Trans. IEICE, vol.E87-A, pp.2432-2439, 2004.
  • N. Kamiya,“On algebraic soft-decision decoding algorithms for BCH codes,”IEEE Transactions on Information Theory, vol.47, pp45-58, 2001.
  • N. Kamiya,“A unified algorithm for solving key equations for decoding alternant codes,”IEICE Transactions on Fundamentals, vol.E82-A, pp.1998-2006, 1999.
  • T. Okamura, ``Upper Bounds of the Trellis Complexity of Turbo Codes,'' Proceeding of IEEE Globecom'99, vol.5, pp.2571 - 2575, 1999.
  • N. Kamiya, “On acceptance criterion for efficient successive errors-and-erasures decoding of RS and BCH codes,”IEEE Transactions on Information Theory, vol.43, pp.1477-1488, 1997.
  • N. Kamiya, “A sufficient condition for a generalized minimum-distance RS decoder to ensure correct decoding,”IEICE Transactions on Fundamentals, vol.E80-A, pp.2066-2072, 1997.
  • N. Kamiya,“On multi-sequence shift-register synthesis and generalized minimum distance decoding of RS codes,”Finite Fields and Their Applications, vol.1, pp.440-457, 1995.

Top of this page