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

DOI10.1016/J.IPL.2015.09.014zbMATH Open1350.94054OpenAlexW2198095277WikidataQ123285299 ScholiaQ123285299MaRDI QIDQ894450FDOQ894450

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

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

zbMATH Keywords

cryptographydiscrete logarithm problemcryptanalysisfactorization problemID-based encryption

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Title not available (Why is that?)
• Identity-Based Cryptosystems and Signature Schemes
• Title not available (Why is that?)
• Efficient Identity-Based Encryption Without Random Oracles
• Advances in Cryptology – CRYPTO 2004
• An efficient ID-based cryptographic encryption based on discrete logarithm problem and integer factorization problem

Cited In (2)

• Title not available (Why is that?)
• An ID-based key sharing scheme based on discrete logarithm problem over a product of three primes

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)