# Fast algorithm for reduction modulo a prime [closed]

If the prime is $p=2^a\cdot3^b+1$ , is there any fast reduction technique modulo this prime?

## closed as off-topic by e-sushiMar 10 '16 at 19:36

• This question does not appear to be about cryptography within the scope defined in the help center.
If this question can be reworded to fit the rules in the help center, please edit the question.

• This isn't really related to cryptography and might be better suited for Mathematics. – Artjom B. Mar 9 '16 at 11:34
• @ArtjomB. This is math that's directly relevant to the design of cryptographic algorithms, and it's about an algorithm which makes it more computer science than math, so I really can't see this question being off-topic here. – Gilles Mar 9 '16 at 22:51
• How big are $a$ and $b$? How big is $|a-b|$? How does the larger algorithm you want to use this in look like? – CodesInChaos Mar 10 '16 at 10:55