activity
20142026
most citedDouble Counting in -ary RSA Precomputation Reveals the Secret Exponent

11 citations · 12 across the 5 of their papers we have counts for

collaborators

5 papers

eess.SP2026

CSI Phase Averaging for High-Sensitivity Wi-Fi Sensing in Low-Multipath Environments

Toshinori Suzuki, Shin-ichiro Ogura, Yu Morishima +1

This paper presents a low-complexity motion detection method for outdoor Wi-Fi sensing based on a model-driven approach. The method exploits the structural characteristics of the p…

cs.IT2018

A True Random Number Generator Method Embedded in Wireless Communication Systems

Toshinori Suzuki, Masahiro Kaminaga

To increase the number of wireless devices, e.g., mobile or IoT terminals, cryptosystems are essential for secure communications. In this regard, random number generation is crucia…

cs.CR2018★ 1 cited

Determining the Optimal Random-padding Size for Rabin Cryptosystems

Masahiro Kaminaga, Toshinori Suzuki, Masaharu Fukase

Rabin encryption and a secure ownership transfer protocol based on the difficulty of factorization of a public key use a small public exponent. Such encryption requires random numb…

cs.CR2016

Crashing Modulus Attack on Modular Squaring for Rabin Cryptosystem

Masahiro Kaminaga, Hideki Yoshikawa, Arimitsu Shikoda +1

The Rabin cryptosystem has been proposed protect the unique ID (UID) in radio-frequency identification tags. The Rabin cryptosystem is a type of lightweight public key system that…

cs.CR2014★ 11 cited

Double Counting in -ary RSA Precomputation Reveals the Secret Exponent

Masahiro Kaminaga, Hideki Yoshikawa, Toshinori Suzuki

A new fault attack, double counting attack (DCA), on the precomputation of -ary modular exponentiation for a classical RSA digital signature (i.e., RSA without the Chinese rem…