Asymptotic granularity reduction and its application

DOI10.1016/J.TCS.2011.06.008zbMath1222.68088OpenAlexW2963208362MaRDI 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

zbMATH Keywords

public key cryptosystemprovable securitytranscendental logarithm problemasymptotic granularity reductionpolynomial time reduction

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Related Items (3)

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

• Improved low-density subset sum algorithms
• A public key cryptosystem and a signature scheme based on discrete logarithms
• A method for obtaining digital signatures and public-key cryptosystems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Asymptotic granularity reduction and its application