Kazuyoshi Furukawa

A fast RSA implementation on itanium 2 processor

We show the fastest implementation result of RSA on Itanium 2. For realizing the fast implementation, we improved the implementation algorithm of Montgomery multiplication proposed by Itoh et al. By using our implementation algorithm, pilepine delay is decreased than previous one on Itanium 2. And we implemented this algorithm with highly optimized for parallel processing. Our code can execute 4 instructions per cycle (At maximum, 6 instructions are executed per cycle on Itanium 2), and its probability of pipeline stalling is just only 5%. Our RSA implementation using this code performs 32 times per second of 4096-bit RSA decryption with CRT on Itanium 2 at 900MHz. As a result, our implementation of RSA is the fastest on Itanium2. This is 3.1 times faster than IPP, a software library developed by Intel, in the best case.

High-Speed Forensic Technology Against Targeted Cyber Attacks (Extended Abstract)

This paper introduces the high-speed forensics technology that promptly analyzes the damage after the targeted cyber attack had been detected and visualizes the whole picture of the attack by binding the communication packets and users’ logs.

Improving the Confidential Data Totalization

With a rapid spread of the cloud computing, confidential data totalization technologies are becoming more important. In 2011, Ushida et al. proposed a confidential data totalization technique based on the value distortion, in which each data in a formulaic corss-tabulation table is randomized by a random data shared in a pre-provided random data table, and the cloud server is able to totalize the data by summing randomized data since the sum of the randomized table data is known to the server. So the cloud server does not require any specific functions for totalizing randomized data and no information is leaked to the cloud server. However, there are tow problems. The first problem is data leakage from randomized table data if the same random table is used twice or more. The second problem is the difficulty of appending new rows or columns to the random data table without reproviding them to the users. This paper introduces solutions for these problems: a table updating method for the random table and and a table extending method for the random table without any re-provisions. With the proposed solutions, the cost of the the secure table data analysis method for the update and the extension can be reduced extremely.