Finding $x$ such that $g^x\bmod p<p/k$?
Is Pohlig-Hellman Cipher the only option?
Potential Flaws With Lattice Based Cryptography?
How exactly does ASKE (Alpha Secure Key Establishment) in Zigbee work?