advanced
Journal Information
Journal Information
   Description
   Editorial Board
   Guide for Authors
   Ordering

Contents Services
Contents Services
   Regular Issues
   Special Issues
   Authors Index

Links
Links
   FEI STU Bratislava
   SAS Bratislava

   Feedback

[05-06, 1999] 

Journal of Electrical Engineering, Vol 50, 05-06 (1999)

COMPOSED MODULUS FOR RSA ALGORITHM

Otokar Grošek - Karol Nemoga - Ladislav Satko

   It is well known that there does not exist any polynomial time algorithm to prove primality of an integer although there are many sophisticated methods to do it with probability close to 1. We present a result concerning the case when a composed non square free integer m is in use providing gcd(s, f(m))=1.

Keywords: RSA, composed modulus


[full-paper]


© 1997-2019  FEI STU Bratislava