Joseph Tonien

A New Attack on Three Variants of the RSA Cryptosystem

In 1995, Kuwakado, Koyama and Tsuruoka presented a new RSA-type scheme based on singular cubic curves

Authentication Codes in the Query Model

y^2\equiv x^3+bx^2\pmod N

Cryptanalysis of RSA-type cryptosystems based on Lucas sequences, Gaussian integers and elliptic curves

where

A new attack on the RSA cryptosystem based on continued fractions

N=pq

102.06 A new elementary proof of Euler's continued fractions

is an RSA modulus. Then, in 2002, Elkamchouchi, Elshenawy and Shaban introduced an extension of the RSA scheme to the field of Gaussian integers using a modulus