There are countless ways of multiplying two numbers such as 15 * 15.
Even if you don't live in mathematics, you just need to be the parent of a third grader to know that there are simple, complex, confusing and very efficient ways how to calculate the product of two numbers. In fact, efficiency is a big deal still today, especially in computer sciences, and it is quite fascinating to watch the work that is going on in this area.
Intel was granted today a patent that is simply headlines as "multiplying two numbers." It is based on the fast Karatsuba algorithm, which has been around for about 50 years and has been improved several times since its publication in 1962. Intel's patent addresses extremely large numbers for cryptography applications and the bottleneck of 32-bit and 64-bit processors when they are dealing with protocols that include numbers ranging from 1024 to 4096.
The patent does not reveal exact numbers on how much faster the technique could work when compared to previous approaches. However, at least partial tests mentioned in the patent suggest that just modular reduction approaches can accelerate 512 bit number operations by 27% and up to 177% for 4096 bit numbers.