default search action
Duc-Phong Le
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j11]Keerthi Nelaturu
, Han Du
A Review of Blockchain in Fintech: Taxonomy, Challenges, and Future Directions. Cryptogr. 6(2): 18 (2022) - [j10]Xichen Zhang, Mohammad Mehdi Yadollahi, Sajjad Dadkhah, Haruna Isah, Duc-Phong Le, Ali A. Ghorbani:
Data breach: analysis, countermeasures and challenges. Int. J. Inf. Comput. Secur. 19(3/4): 402-442 (2022) - [j9]Duc-Phong Le
Improved fault analysis on SIMECK ciphers. J. Cryptogr. Eng. 12(2): 169-180 (2022) - [c15]Raza Ali Kazmi, Duc-Phong Le, Cyrus Minwalla:
Privacy-Preserving Post-quantum Credentials for Digital Payments. Financial Cryptography Workshops 2022: 118-137 - 2021
- [j8]Sze Ling Yeo, Duc-Phong Le
Improved algebraic attacks on lightweight block ciphers. J. Cryptogr. Eng. 11(1): 1-19 (2021) - [c14]Farzaneh Shoeleh, Masoud Erfani, Saeed Shafiee Hasanabadi, Duc-Phong Le, Arash Habibi Lashkari
User Profiling on Universal Data Insights tool on IBM Cloud Pak for Security. PST 2021: 1-10 - [i11]Duc-Phong Le, Sze Ling Yeo, Khoongming Khoo:
Algebraic Differential Fault Analysis on SIMON block cipher. IACR Cryptol. ePrint Arch. 2021: 436 (2021) - 2020
- [j7]Duc-Phong Le
Memory-Efficient Random Order Exponentiation Algorithm. IEEE Access 8: 146923-146931 (2020) - [c13]Farzaneh Shoeleh, Masoud Erfani, Duc-Phong Le, Ali A. Ghorbani:
Ensemble of Hierarchical Temporal Memory for Anomaly Detection. DSAA 2020: 50-59 - [i10]Duc-Phong Le, Rongxing Lu, Ali A. Ghorbani:
Improved Fault Analysis on SIMECK Ciphers. CoRR abs/2010.05296 (2020) - [i9]Duc-Phong Le, Rongxing Lu, Ali A. Ghorbani:
Improved Fault Analysis on SIMECK Ciphers. IACR Cryptol. ePrint Arch. 2020: 1263 (2020)
2010 – 2019
- 2019
- [j6]Duc-Phong Le
On the near prime-order MNT curves. Appl. Algebra Eng. Commun. Comput. 30(2): 107-125 (2019) - [j5]Duc-Phong Le
Algebraic Differential Fault Analysis on SIMON Block Cipher. IEEE Trans. Computers 68(11): 1561-1572 (2019) - [c12]Duc-Phong Le, Guomin Yang
A New Multisignature Scheme with Public Key Aggregation for Blockchain. PST 2019: 1-7 - [i8]Duc-Phong Le, Guomin Yang, Ali A. Ghorbani:
DDH-based Multisignatures with Public Key Aggregation. IACR Cryptol. ePrint Arch. 2019: 771 (2019) - 2018
- [c11]Duc-Phong Le, Huasong Meng
BIFF: A Blockchain-based IoT Forensics Framework with Identity Privacy. TENCON 2018: 2372-2377 - [i7]Duc-Phong Le, Nadia El Mrabet, Safia Haloui, Chik How Tan:
On the near prime-order MNT curves. CoRR abs/1806.02536 (2018) - 2016
- [j4]Duc-Phong Le
Further refinements of Miller's algorithm on Edwards curves. Appl. Algebra Eng. Commun. Comput. 27(3): 205-217 (2016) - [j3]Chik How Tan, Theo Fanuela Prabowo
Breaking an ID-based encryption based on discrete logarithm and factorization problems. Inf. Process. Lett. 116(2): 116-119 (2016) - 2015
- [c10]Duc-Phong Le
On Near Prime-Order Elliptic Curves with Small Embedding Degrees. CAI 2015: 140-151 - [c9]Duc-Phong Le
Randomizing the Montgomery Powering Ladder. WISTP 2015: 169-184 - [i6]Duc-Phong Le, Chik How Tan, Michael Tunstall:
Randomizing the Montgomery Powering Ladder. IACR Cryptol. ePrint Arch. 2015: 657 (2015) - [i5]Duc-Phong Le, Nadia El Mrabet, Chik How Tan:
On near prime-order elliptic curves with small embedding degrees. IACR Cryptol. ePrint Arch. 2015: 835 (2015) - 2014
- [j2]Duc-Phong Le
Improved Miller's Algorithm for Computing Pairings on Edwards Curves. IEEE Trans. Computers 63(10): 2626-2632 (2014) - [c8]Duc-Phong Le
On Double Exponentiation for Securing RSA against Fault Analysis. CT-RSA 2014: 152-168 - 2013
- [i4]Duc-Phong Le:
Further Refinements of Miller Algorithm on Edwards curves. CoRR abs/1305.2694 (2013) - [i3]Duc-Phong Le, Chik How Tan:
Speeding up Ate Pairing Computation in Affine Coordinates. IACR Cryptol. ePrint Arch. 2013: 119 (2013) - 2012
- [c7]Duc-Phong Le
Speeding Up Ate Pairing Computation in Affine Coordinates. ICISC 2012: 262-277 - [c6]Duc-Phong Le
Fast point quadrupling on elliptic curves. SoICT 2012: 218-222 - 2011
- [j1]Duc-Phong Le
Refinements of Miller's Algorithm over Weierstrass Curves Revisited. Comput. J. 54(10): 1582-1591 (2011) - [c5]Duc-Phong Le
Improved Precomputation Scheme for Scalar Multiplication on Elliptic Curves. IMACC 2011: 327-343 - [i2]Duc-Phong Le, Chao-Liang Liu:
Refinements of Miller's Algorithm over Weierstrass Curves Revisited. CoRR abs/1103.0337 (2011) - [i1]Duc-Phong Le:
Fast Quadrupling of a Point in Elliptic Curve Cryptography. IACR Cryptol. ePrint Arch. 2011: 39 (2011) - 2010
- [c4]John Boxall, Nadia El Mrabet, Fabien Laguillaumie, Duc-Phong Le
A Variant of Miller's Formula and Algorithm. Pairing 2010: 417-434
2000 – 2009
- 2009
- [c3]Duc-Phong Le
Multisignatures as Secure as the Diffie-Hellman Problem in the Plain Public-Key Model. Pairing 2009: 35-51 - 2008
- [c2]Duc-Phong Le
A Secure Round-Based Timestamping Scheme with Absolute Timestamps (Short Paper). ICISS 2008: 116-123 - [c1]Duc-Phong Le
Signtiming scheme based on aggregate signature. ISI 2008: 145-149
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 20:13 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: