#powers-of-extremely-large-numbers
Read more stories on Hashnode
Articles with this tag
Problem As we all know the expression: \(x^n \mod m; (\forall x,n,m \in \mathbb N)\) is the building block of most of the cryptographic techniques. A...