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

  • 1
    $\begingroup$ This isn't really related to cryptography and might be better suited for Mathematics. $\endgroup$ – Artjom B. Mar 9 '16 at 11:34
  • 1
    $\begingroup$ @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. $\endgroup$ – Gilles 'SO- stop being evil' Mar 9 '16 at 22:51
  • $\begingroup$ How big are $a$ and $b$? How big is $|a-b|$? How does the larger algorithm you want to use this in look like? $\endgroup$ – CodesInChaos Mar 10 '16 at 10:55