Presentation 1994/3/18
Two algorithms for modular exponentiation using nonstandard arithmetics
Vassil Dimitrov, Todor Cooklev,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Two new algorithms for performing modular exponentiation are suggested.Interesting non-standard number systems axe used.The first algorithm is based on the representing the exponent as a sum of generalized Fibonacci numbers.This representation is known as Zeckendorf representation.When precomputing is allowed the resulting algorithm is more efficient than the classical algorithm, but requires more memory.The second algorithm is based on a new number system,which is called hybrid binary-ternary number system(HBTNS).With or without precomputing it is superior to the classical algorithm.The properties of the number systems are investigated in detail and computational complexity comparisons are made.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) algorithms / cryptography / information security
Paper # ISEC93-98
Date of Issue

Conference Information
Committee ISEC
Conference Date 1994/3/18(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Vice Chair

Paper Information
Registration To Information Security (ISEC)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Two algorithms for modular exponentiation using nonstandard arithmetics
Sub Title (in English)
Keyword(1) algorithms
Keyword(2) cryptography
Keyword(3) information security
1st Author's Name Vassil Dimitrov
1st Author's Affiliation Department of Computer Science Technical University of Plovdiv Bulgaria()
2nd Author's Name Todor Cooklev
2nd Author's Affiliation Graduate school of Physical Electronics,Tokyo Institute of Technology
Date 1994/3/18
Paper # ISEC93-98
Volume (vol) vol.93
Number (no) 525
Page pp.pp.-
#Pages 7
Date of Issue