Goutam Paul
Revisiting Fermat's Factorization for the RSA Modulus.
Пт, 10/23/2009 - 14:26 — SomNambulAuthors: Goutam Paul, Sounak Gupta
Subjects: Cryptography and Security
AbstractWe revisit Fermat's factorization method for a positive integer $n$ that is a
product of two primes $p$ and $q$. Such an integer is used as the modulus for
both encryption and decryption operations of an RSA cryptosystem. The security
of RSA relies on the hardness of factoring this modulus. As a consequence of
our analysis, two variants of Fermat's approach emerge. We also present a
comparison between the two methods' effective regions.- Читать далее
- login or register to post comments
On Necessary and Sufficient Number of Cops in the Game of Cops and Robber in Multidimensional Grids.
Ср, 09/09/2009 - 22:08 — SomNambulAuthors: Sayan Bhattacharya, Goutam Paul, Swagato Sanyal
Subjects: Discrete Mathematics
AbstractWe theoretically analyze the Cops and Robber Game for the first time in a
multidimensional grid. It is shown that for an $n$-dimensional grid, at least
$n$ cops are necessary to ensure capture of the robber. We also present a set
of cop strategies for which $n$ cops are provably sufficient to catch the
robber. Further, for two-dimensional grid, we provide an efficient cop strategy
for which the robber is caught even by a single cop under certain conditions.
Вход в систему
