New answers tagged cr.crypto-security
2
Using Fermat theorem, $a^p -a = 0 (\mod p) $ and if a and p are co-prime, then $ a^{pā1} ā 1 =1(\mod p) $
So if u choose n to be a prime number(say p), then $a^{b^c} \mod p = a^{ (b^{c} \mod (p-1))} \mod p $ ,
Then you can use Fast Exponentiation trick in two levels, once for $b^c \mod p-1 $ then for $a^{b^c} \mod p $
I also suggest you to look at cses ...
Top 50 recent answers are included
Related Tags
cr.crypto-security × 253cc.complexity-theory × 57
reference-request × 28
one-way-function × 19
quantum-computing × 16
hash-function × 16
zero-knowledge × 16
factoring × 12
security × 12
cryptographic-attack × 12
pseudorandom-generators × 11
nt.number-theory × 10
ds.algorithms × 9
it.information-theory × 9
randomness × 9
pseudorandomness × 9
complexity-classes × 7
circuit-complexity × 7
homomorphic-encryption × 7
pr.probability × 5
quantum-information × 5
relativization × 5
primes × 5
privacy × 5
extractors × 5