Breaking an ID-based encryption based on discrete logarithm and factorization problems

DOI10.1016/j.ipl.2015.09.014zbMath1350.94054OpenAlexW2198095277WikidataQ123285299 ScholiaQ123285299MaRDI QIDQ894450

Duc-Phong Le, Theo Fanuela Prabowo, Chik How Tan

Publication date: 1 December 2015

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2015.09.014

zbMATH Keywords

cryptographydiscrete logarithm problemcryptanalysisfactorization problemID-based encryption

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• An efficient ID-based cryptographic encryption based on discrete logarithm problem and integer factorization problem
• Identity-Based Cryptosystems and Signature Schemes
• Advances in Cryptology – CRYPTO 2004
• Efficient Identity-Based Encryption Without Random Oracles

This page was built for publication: Breaking an ID-based encryption based on discrete logarithm and factorization problems