Analysis of RSA over Gaussian Integers Algorithm

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Aleksey Koval Articles by Boris S. Verkhovsky

Fifth International Conference on Information Technology: New Generations (itng 2008)

April 07-April 09

ISBN: 978-0-7695-3099-4

	ASCII Text	x
	Aleksey Koval, Boris S. Verkhovsky, "Analysis of RSA over Gaussian Integers Algorithm," Information Technology: New Generations, Third International Conference on, pp. 101-105, Fifth International Conference on Information Technology: New Generations (itng 2008), 2008.

	BibTex	x
	@article{ 10.1109/ITNG.2008.44, author = {Aleksey Koval and Boris S. Verkhovsky}, title = {Analysis of RSA over Gaussian Integers Algorithm}, journal ={Information Technology: New Generations, Third International Conference on}, volume = {0}, year = {2008}, isbn = {978-0-7695-3099-4}, pages = {101-105}, doi = {http://doi.ieeecomputersociety.org/10.1109/ITNG.2008.44}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Information Technology: New Generations, Third International Conference on TI - Analysis of RSA over Gaussian Integers Algorithm SN - 978-0-7695-3099-4 SP101 EP105 A1 - Aleksey Koval, A1 - Boris S. Verkhovsky, PY - 2008 KW - Cryptography KW - RSA KW - Gaussian Integers KW - Gaussian primes VL - 0 JA - Information Technology: New Generations, Third International Conference on ER -

Aleksey Koval

Boris S. Verkhovsky

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ITNG.2008.44

In this paper we analyze the extended RSA algorithm into the field of Gaussian integers. We examine in depth the perceived advantages of this extension, such as security and efficiency. We found that the extended RSA is slightly less efficient and could be more secure only if RSA is not as strong as factoring (even in this case it is not guaranteed to add security).

Index Terms:

Cryptography, RSA, Gaussian Integers, Gaussian primes

Citation:

Aleksey Koval, Boris S. Verkhovsky, "Analysis of RSA over Gaussian Integers Algorithm," itng, pp.101-105, Fifth International Conference on Information Technology: New Generations (itng 2008), 2008

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.