query: How to work out modular arithmetic quickly for cryptography
positive_passages.docid: 360
positive_passages.text: Modular exponentiation by hand ($a^b\bmod c$)
negative_passages.docid: 36611
negative_passages.text: Algorithms for solving the discrete logarithm $a^x \equiv b\pmod{n}$ when $\gcd(a,n) \neq 1$
negative_passages.docid: 134700
negative_passages.text: Fastest way to get a positive modulo in C/C++
negative_passages.docid: 43477
negative_passages.text: Choosing between additive or multiplicative group for Diffie-Hellman
negative_passages.docid: 45014
negative_passages.text: Modular exponentiation by repeated squaring
negative_passages.docid: 144812
negative_passages.text: Common modulus attack on RSA when the 2 public exponents differ by a single bit
negative_passages.docid: 40397
negative_passages.text: P = NP and current cryptographic systems
negative_passages.docid: 49136
negative_passages.text: How to compute $m$ value from RSA if $phi(n)$ is not relative prime with the $e$?
negative_passages.docid: 50128
negative_passages.text: Efficiently finding two squares which sum to a prime
negative_passages.docid: 36031
negative_passages.text: Finding modular of a fraction
negative_passages.docid: 97303
negative_passages.text: Calculate the multiplicative inverse modulo a composite number
negative_passages.docid: 9118
negative_passages.text: Polynomial division: an obvious trick? [reducing mod $\textit{simpler}$ multiples]
negative_passages.docid: 125115
negative_passages.text: Simplifying Large Bases with large Exponents
negative_passages.docid: 74918
negative_passages.text: Construction of addition and multiplication table for GF(4)
negative_passages.docid: 4972
negative_passages.text: Mod of numbers with large exponents [modular order reduction]
negative_passages.docid: 107781
negative_passages.text: Detecting perfect squares faster than by extracting square root
negative_passages.docid: 119433
negative_passages.text: How to find modulo of large numbers like $9801\! \pmod {\!32}$