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

DOI10.1016/J.IPL.2015.09.014MaRDI QIDQ894450zbMATH OpenOpenAlexWikidataFDO

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

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)

Recommendations

• An efficient ID-based cryptographic encryption based on discrete logarithm problem and integer factorization problem
• Improvement on Meshram et al.'s ID-based cryptographic mechanism
• An identity-based cryptographic model for discrete logarithm and integer factoring based cryptosystem
• scientific article; zbMATH DE number 4057441
• Identity-Based Encryption from the Weil Pairing

Cites work

• scientific article; zbMATH DE number 954401 (Why is no real title available?)
• scientific article; zbMATH DE number 1842494 (Why is no real title available?)
• Advances in Cryptology – CRYPTO 2004
• An efficient ID-based cryptographic encryption based on discrete logarithm problem and integer factorization problem
• Efficient Identity-Based Encryption Without Random Oracles
• Identity-based cryptosystems and signature schemes

Cited in

(4)

• scientific article; zbMATH DE number 177023 (Why is no real title available?)
• Improvement on Meshram et al.'s ID-based cryptographic mechanism
• An ID-based key sharing scheme based on discrete logarithm problem over a product of three primes
• An efficient ID-based cryptographic encryption based on discrete logarithm problem and integer factorization problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q894450)