A fast algorithm for computing large Fibonacci numbers

We present a fast algorithm for computing large Fibonacci numbers. It is known that the product of Lucas numbers algorithm uses the fewest bit operations to compute the Fibonacci number Fn. We show that the number of bit operations in the conventional product of Lucas numbers algorithm can be reduced by replacing multiplication with the square operation.

• Type: Journal
• Year: 2000
• Where: IPL
• Authors: Daisuke Takahashi
• Keywords: Bit Operations, Fibonacci Number, IPL 2000, Lucas Numbers