期刊名称：International Journal on Computer Science and Engineering
印刷版ISSN：2229-5631
电子版ISSN：0975-3397
出版年度：2010
卷号：2
期号：3
页码：433-436
出版社：Engg Journals Publications
摘要：We address the problem of computation involved in RSA algorithm namely exponentiation under modulo arithmetic and various mathematical and timing attacks in RSA. The computation is made easy and quick by assigning elements from the fundamental group in algebraic topology. This can also be regarded as a Zero Knowledge Interactive Protocol (ZKIP).
关键词：RSA algorithm; exponentiation in modular arithmetic; fundamental group in algebraic topology; Zero Knowledge Interactive Protocol
