Asymptotic granularity reduction and its application
From MaRDI portal
Publication:719278
DOI10.1016/j.tcs.2011.06.008zbMath1222.68088MaRDI QIDQ719278
Xiubin Fan, Shenghui Su, Lü, Shuwang
Publication date: 10 October 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.06.008
public key cryptosystem; provable security; transcendental logarithm problem; asymptotic granularity reduction; polynomial time reduction
Related Items
A semantically secure public key cryptoscheme using bit-pair shadows, A provably secure non-iterative hash function resisting birthday attack, A public key cryptosystem based on three new provable problems
Cites Work