default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHatem M. Bahig
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j16]Taha E. Rashad
, Soheir Mohamed Khamis, Hatem M. Bahig, Dieaa I. Nassr:
A recent approach based on inspired crows behavior in steganography. Evol. Intell. 17(4): 2617-2636 (2024)- 2022
- [j15]Hatem M. Bahig, Dieaa I. Nassr, Mohammed A. Mahdi, Hazem M. Bahig:
Small Private Exponent Attacks on RSA Using Continued Fractions and Multicore Systems. Symmetry 14(9): 1897 (2022) - [j14]Hazem M. Bahig, Mohamed A. G. Hazber, Khaled Abdul-Aziz Al-Utaibi, Dieaa I. Nassr, Hatem M. Bahig:
Efficient Sequential and Parallel Prime Sieve Algorithms. Symmetry 14(12): 2527 (2022) - [j13]Dieaa I. Nassr, M. Anwar, Hatem M. Bahig:
Improving small private exponent attack on the Murru-Saettone cryptosystem. Theor. Comput. Sci. 923: 222-234 (2022) - [j12]Hazem M. Bahig, Dieaa I. Nassr, Mohammed A. Mahdi, Mohamed A. G. Hazber, Khaled Abdul-Aziz Al-Utaibi, Hatem M. Bahig:
Speeding up wheel factoring method. J. Supercomput. 78(14): 15730-15748 (2022) - 2021
- [j11]Hazem M. Bahig, Hatem M. Bahig, Khaled A. Fathy:
Fast and scalable algorithm for product large data on multicore system. Concurr. Comput. Pract. Exp. 33(2) (2021) - [j10]Mohamed S. Esseissah, Ashraf Bhery, Sameh S. Daoud, Hatem M. Bahig:
Three Strategies for Improving Shortest Vector Enumeration Using GPUs. Sci. Program. 2021: 8852497:1-8852497:13 (2021) - [i2]Dieaa I. Nassr, M. Anwar, Hatem M. Bahig:
New Public Key Cryptosystem (First Version). IACR Cryptol. ePrint Arch. 2021: 92 (2021) - 2020
- [j9]Mohamed S. Esseissah, Ashraf Bhery, Hatem M. Bahig:
Improving BDD Enumeration for LWE Problem Using GPU. IEEE Access 8: 19737-19749 (2020) - [j8]Hatem M. Bahig, Dieaa I. Nassr, Ashraf Bhery, Abderrahmane Nitaj:
A Unified Method for Private Exponent Attacks on RSA Using Lattices. Int. J. Found. Comput. Sci. 31(2): 207-231 (2020)
2010 – 2019
- 2018
- [j7]Hatem M. Bahig, Khaled A. AbdElbari:
A fast GPU-based hybrid algorithm for addition chains. Clust. Comput. 21(4): 2001-2011 (2018) - 2014
- [c11]Abderrahmane Nitaj, Muhammad Rezal Kamel Ariffin, Dieaa I. Nassr, Hatem M. Bahig:
New Attacks on the RSA Cryptosystem. AFRICACRYPT 2014: 178-198 - [i1]Abderrahmane Nitaj, Muhammad Rezal Kamel Ariffin, Dieaa I. Nassr, Hatem M. Bahig:
New Attacks on the RSA Cryptosystem. IACR Cryptol. ePrint Arch. 2014: 549 (2014) - 2012
- [c10]Hatem M. Bahig, Ashraf Bhery, Dieaa I. Nassr:
Cryptanalysis of Multi-Prime RSA with Small Prime Difference. ICICS 2012: 33-44 - 2011
- [j6]Hatem M. Bahig, Hazem M. Bahig:
A new strategy for generating shortest addition sequences. Computing 91(3): 285-306 (2011) - [j5]Hatem M. Bahig:
Star reduction among minimal length addition chains. Computing 91(4): 335-352 (2011) - [c9]Dalia B. Nasr, Hatem M. Bahig, Sameh S. Daoud:
Visualizing Secure Hash Algorithm (SHA-1) on the Web. AMT 2011: 101-112 - [c8]Khaled A. Fathy, Hazem M. Bahig, Hatem M. Bahig, A. A. Ragb:
Binary Addition Chain on EREW PRAM. ICA3PP (2) 2011: 321-330 - 2010
- [c7]Mohamed S. Asseisah, Hatem M. Bahig, Sameh S. Daoud:
Interactive Visualization System for DES. AMT 2010: 18-25 - [c6]Hatem M. Bahig, Yasser Kotb:
Interactive Visualization Applets for Modular Exponentiation Using Addition Chains. HAIS (2) 2010: 209-216
2000 – 2009
- 2008
- [j4]Hatem M. Bahig:
On a generalization of addition chains: Addition-multiplication chains. Discret. Math. 308(4): 611-616 (2008) - [c5]Dieaa I. Nassr, Hatem M. Bahig, Ashraf Bhery, Sameh S. Daoud:
A new RSA vulnerability using continued fractions. AICCSA 2008: 694-701 - 2007
- [c4]Hazem M. Bahig, Hatem M. Bahig:
Optimal Parallel Merging by Counting. ITNG 2007: 664-669 - 2006
- [j3]Hatem M. Bahig:
Improved Generation of Minimal Addition Chains. Computing 78(2): 161-172 (2006) - [c3]Hatem M. Bahig:
On the Number of Minimal Addition Chains. CSC 2006: 202-208 - [c2]Hatem M. Bahig, Hazem M. Bahig:
Speeding Up Evaluation of Powers and Monomials. FCS 2006: 149-153 - 2003
- [j2]Hatem M. Bahig, Ken Nakamula:
Erratum to "Some properties of nonstar steps in addition chains and new cases where the Scholz conjecture is true": [J. Algorithms 42 (2002) 304-316]. J. Algorithms 47(1): 60-61 (2003) - 2002
- [j1]Hatem M. Bahig, Ken Nakamula:
Some Properties of Nonstar Steps in Addition Chains and New Cases Where the Scholz Conjecture Is True. J. Algorithms 42(2): 304-316 (2002) - 2001
- [c1]Hatem M. Bahig, Mohamed H. El-Zahar, Ken Nakamula:
Some Results for Some Conjectures in Addition Chains. DMTCS 2001: 47-54
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-03 21:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
