Fast bignum square computation

by

If I understand your algorithm correctly, it seems O(n^2) where n is the number of digits.

Have you looked at Karatsuba Algorithm?
It speeds up multiplication using the divide and conquer approach. It may be worth taking a look at.

More Related Contents:

  1. find the number of times a character occurs between two indexes
  2. Program to find sum of prime numbers between 1 and 10^7
  3. Algorithm (especially for c++) to show Every Permutation
  4. Random generation of numbers? [closed]
  5. How to implement big int in C++
  6. Sorting zipped (locked) containers in C++ using boost or the STL
  7. What is the fastest way to transpose a matrix in C++?
  8. Why will std::sort crash if the comparison function is not as operator
  9. Finding all the subsets of a set
  10. Efficient implementation of log2(__m256d) in AVX2
  11. std::transform() and toupper(), no matching function
  12. C++ string::find complexity
  13. C++: Converting Hexadecimal to Decimal
  14. Printing prime numbers from 1 through 100
  15. Circular lock-free buffer
  16. Generating m distinct random numbers in the range [0..n-1]
  17. Special simple random number generator
  18. TMP: how to generalize a Cartesian Product of Vectors?
  19. Efficiently getting all divisors of a given number
  20. How can std::make_heap be implemented while making at most 3N comparisons?
  21. Writing a simple equation parser
  22. What is the right approach when using STL container for median calculation?
  23. Howto create combinations of several vectors without hardcoding loops in C++?
  24. Ways to do modulo multiplication with primitive types
  25. Removing ‘#include ‘ doesn’t break the code
  26. Is it possible to map string to int faster than using hashmap?
  27. Is it possible to implement lock free map in C++
  28. stl ordering – strict weak ordering
  29. Calculate mean and standard deviation from a vector of samples in C++ using Boost
  30. Checking if all elements of a vector are equal in C++

Leave a Comment