IEICE transactions on fundamentals of electronics, communications and computer

• 

  Año 2006, Vol. 89, Número 5

  • A Steepest Descent Algorithm for M-Convex Functions on Jump Systems

    Kazuo Murota, Ken'ichiro Tanaka

    págs. 1160-1165

    

  • Using Linear Hybrid Cellular Automata to Attack the Shrinking Generator

    Pino Caballero Gil, Amparo Fúster Sabater

    págs. 1166-1172

    

  • Balanced C4-Trefoil Decomposition of Complete Multi-Graphs

    Kazuhiko Ushio, Hideaki Fujimoto

    págs. 1173-1180

    

  • Coding Floorplans with Fewer Bits

    Kazuo Yamanaka, Shin-ichi Nakano

    págs. 1181-1185

    

  • Competitive Analysis of Multi-Queue Preemptive QoS Algorithms for General Priorities

    Toshiya Itoh, Noriyuki Takahashi

    págs. 1186-1197

    

  • Bounds on the Client-Server Incremental Computing

    Cho Chin Lin, Da Wei Wang, Tsan Sheng Hsu

    págs. 1198-1206

    

  • On Reconfiguring Radial Trees

    Yoshiyuki Kusakari

    págs. 1207-1214

    

  • Dynamic Programming and Clique Based Approaches for Protein Threading with Profiles and Constraints

    Tatsuya Akutsu

    págs. 1215-1222

    

  • Topological Book Embedding of Bipartite Graphs

    Miki Miyauchi

    págs. 1223-1226

    

  • The Symmetric Quadratic Semi-Assignment Polytope

    Hiroo Saito

    págs. 1227-1232

    

  • Taxonomical Security Consideration of OAEP Variants

    Yuichi Komano, Kazuo Ohta

    págs. 1233-1245

    

  • A Weil Descent Attack against Elliptic Curve Cryptosystems over Quartic Extension Fields

    Seigo Arita

    págs. 1246-1254

    

  • Practical Application of Lattice Basis Reduction Algorithm to Side-Channel Analysis on (EC)DSA

    Katsuyuki Takashima

    págs. 1255-1262

    

  • A Fast Edge-Splitting Algorithm in Edge-Weighted Graphs

    Horoshi Nagamochi

    págs. 1263-1268

    

  • A Minimum Feedback Vertex Set in the Trivalent Cayley Graph

    Yuuki Tanaka, Yukio Shibata

    págs. 1269-1274

    

  • Group Signature Schemes with Membership Revocation for Large Groups

    Toru Nakanishi, Nobuo Funabiki

    págs. 1275-1283

    

  • Construction of Classifiers by Iterative Compositions of Features with Partial Knowledge

    Kazuya Haraguchi, Toshihide Ibaraki

    págs. 1284-1291

    

  • Efficient Methods for Determining DNA Probe Orders

    Hiro Ito, Kazuo Iwama, Takeyuki Tamura

    págs. 1292-1298

    

  • Transformation of a Parity-Check Matrix for a Message-Passing Algorithm over the BEC

    Naoto Kobayashi, Toshiyasu Matsushima, Shigeichi Hirasawa

    págs. 1299-1306

    

  • A Note on Construction of Orthogonal Arrays with Unequal Strength from Error-Correcting Codes

    Tomohiko Saito, Toshiyasu Matsushima, Shigeichi Hirasawa

    págs. 1307-1315

    

  • Enhanced Exhaustive Search Attack on Randomized BSD Type Countermeasure

    Dong Guk Han

    págs. 1316-1327

    

  • An Efficient Group Signature Scheme from Bilinear Maps

    Jun Furukawa, Hideki Imai

    págs. 1328-1338

    

  • Signature Scheme in Multi-User Setting

    Chik How Tan

    págs. 1339-1345

    

  • An Energy Efficient Ranking Protocol for Radio Networks

    Koji Nakano

    págs. 1346-1354

    

  • An Energy Efficient Leader Election Protocol for Radio Network with a Single Transceiver

    Jacir Luiz Bordim, Yasuaki Ito, Koji Nakano

    págs. 1355-1361

    

  • Defeating Simple Power Analysis on Koblitz Curves

    Camille Vuillaume, Katsuyuki Okeya, Tsuyoshi Takagi

    págs. 1362-1369

    

  • Maximum-Cover Source-Location Problems

    Kenya Sugihara, Hiro Ito

    págs. 1370-1377

    

  • A Quantum Protocol to Win the Graph Colouring Game on All Hadamard Graphs

    David Avis

    págs. 1378-1381

    

  • Visual Secret Sharing Schemes for Multiple Secret Images Allowing the Rotation of Shares

    Mitsugu Iwamoto

    págs. 1382-1395

    

  • A Provably Secure Refreshable Partially Anonymous Token and Its Applications

    Rie Shigetomi

    págs. 1396-1406