Ayaan Khan

#### Description Optimize the already exist large Integer mutiplication algorithm (Karastuba Algorithm) by Schonhage–Strassen algorithm

[feat] implement __builtin_ctz(x) for largeInt

2

#### Description - This function is used to count the trailing zeros of the given integer. Note : ctz = count trailing zeros. - include tests for new implementation

#### Description Currently we have only macOS and ubuntu CI workflow, task is to do the same for windows also.

[feat] operator overloads

22

- [ ] + overload - [ ] - overload - [x] * overload - [ ] / overload - [ ] += overload - [ ] -= overload -...

[feat] overload bitwise operators for large Integers

1

#### Description Implement all bitwise operator overloads for large Integers - [ ] Bitwise OR - [ ] Bitwise AND - [ ] Bitwise NOT - [ ] Bitwise XOR

[feat] implement libbig::largeInt::to_binary()

1

### Description - implement to_binary() function which returns the binary equivalent of a largeInt - include tests for new implementation

#### Description - Implement a Pseudo Random Number Generator (PRNG) for largeInt class that will be able to generate Random Large integers

#### Description - This function is used to count the leading zeros of the large integer. Note : clz = count leading zero’s - include tests for new implementation

#### Description - a method on the class largeInt which return the count the number of one’s(set bits) in an large integer. - include tests for new implementation