History of Exponentiating by squaring

HomePage | Recent Changes | Preferences

	Revision 10 . . (edit) December 15, 2001 6:23 am by AxelBoldt [Moving matrix link to first occurrance]
	Revision 9 . . December 14, 2001 11:45 pm by BenBaker
	Revision 8 . . December 13, 2001 3:26 am by AxelBoldt [Number of multiplications; integer powers ]
	Revision 7 . . (edit) December 13, 2001 3:16 am by Taw [/Talk]
	Revision 6 . . December 13, 2001 1:08 am by Damian Yerrick [generalized to any integer n]
	Revision 5 . . (edit) December 12, 2001 8:20 am by AxelBoldt
	Revision 4 . . December 12, 2001 8:18 am by Taw [some notes about sample implementation]
	Revision 3 . . December 10, 2001 2:56 am by AxelBoldt
	Revision 2 . . December 10, 2001 2:43 am by Taw [Example implementation in Ruby]
	Revision 1 . . December 10, 2001 2:04 am by AxelBoldt [new]

Difference (from prior major revision) (minor diff, author diff)

Changed: 9c9

The method works in every semigroup and is often used to compute powers of matrices, and, especially in cryptography, to compute powers in a ring of integers modulo q. It can also be used to compute integer powers in a group, using the rule Power(x, -n) = (Power(x, n))^-1.