default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMd. Al-Amin Khandaker
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j7]Shunsuke Ueda, Ken Ikuta, Takuya Kusaka, Md. Al-Amin Khandaker
, Ali Md. Arshad, Yasuyuki Nogami:
An Extended Generalized Minimum Distance Decoding for Binary Linear Codes on a 4-Level Quantization over an AWGN Channel. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(8): 1235-1244 (2018)- [j6]Yuta Kodera, Takeru Miyazaki, Md. Al-Amin Khandaker, Ali Md. Arshad, Takuya Kusaka, Yasuyuki Nogami, Satoshi Uehara:
Distribution of Digit Patterns in Multi-Value Sequence over the Odd Characteristic Field. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(9): 1525-1536 (2018) - [j5]Yuta Hashimoto, Md. Al-Amin Khandaker, Yuta Kodera, Taehwan Park, Takuya Kusaka, Howon Kim, Yasuyuki Nogami:
An Implementation of ECC with Twisted Montgomery Curve over 32nd Degree Tower Field on Arduino Uno. Int. J. Netw. Comput. 8(2): 341-350 (2018) - [j4]Yuki Nanjo, Md. Al-Amin Khandaker, Takuya Kusaka, Yasuyuki Nogami:
Efficient Pairing-Based Cryptography on Raspberry Pi. J. Commun. 13(2): 88-93 (2018) - [c14]Md. Al-Amin Khandaker, Yuki Nanjo, Takuya Kusaka, Yasuyuki Nogami:
A Comparative Implementation of GLV Technique on KSS-16 Curve. CANDAR 2018: 106-112 - [c13]Yuki Nanjo, Md. Al-Amin Khandaker, Takuya Kusaka, Yasuyuki Nogami:
Consideration of Efficient Pairing Applying Two Construction Methods of Extension Fields. CANDAR Workshops 2018: 445-451 - [c12]Ken Ikuta, Sho Joichi, Kazuya Kobayashi, Md. Al-Amin Khandaker, Takuya Kusaka, Yasuyuki Nogami:
A Study on the Parameter Size of the Montgomery Trick for ECDLP. ISITA 2018: 623-627 - [c11]Ken Ikuta, Sho Joichi, Kazuya Kobayashi, Md. Al-Amin Khandaker, Takuya Kusaka, Yasuyuki Nogami:
A Study on the Parameter of the Distinguished Point Method in Pollard's Rho Method for ECDLP. ISITA 2018: 628-632 - [c10]Yuki Nanjo, Md. Al-Amin Khandaker, Masaaki Shirase, Takuya Kusaka, Yasuyuki Nogami:
Efficient Ate-Based Pairing over the Attractive Classes of BN Curves. WISA 2018: 55-67 - 2017
- [j3]Md. Al-Amin Khandaker, Yasuyuki Nogami:
An Improvement of Scalar Multiplication by Skew Frobenius Map with Multi-Scalar Multiplication for KSS Curve. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100-A(9): 1838-1845 (2017) - [j2]Md. Al-Amin Khandaker, Taehwan Park, Yasuyuki Nogami, Howon Kim:
A Comparative Study of Twist Property in KSS Curves of Embedding Degree 16 and 18 from the Implementation Perspective. J. Inform. and Commun. Convergence Engineering 15(2) (2017) - [c9]Yuta Hashimoto, Md. Al-Amin Khandaker, Yuta Kodera, Taehwan Park, Takuya Kusaka, Howon Kim, Yasuyuki Nogami:
An ECC Implementation with a Twisted Montgomery Curve over Fq32 on an 8-Bit Microcontroller. CANDAR 2017: 445-450 - [c8]Yuta Kodera, Takuya Kusaka, Takeru Miyazaki, Md. Al-Amin Khandaker, Yasuyuki Nogami, Satoshi Uehara:
An Efficient Implementation of Trace Calculation over Finite Field for a Pseudorandom Sequence. CANDAR 2017: 451-455 - [c7]Takuya Kusaka, Sho Joichi, Ken Ikuta, Md. Al-Amin Khandaker, Yasuyuki Nogami, Satoshi Uehara, Nariyoshi Yamai, Sylvain Duquesne:
Solving 114-Bit ECDLP for a Barreto-Naehrig Curve. ICISC 2017: 231-244 - [c6]Md. Al-Amin Khandaker, Yuki Nanjo, Loubna Ghammam, Sylvain Duquesne, Yasuyuki Nogami, Yuta Kodera:
Efficient Optimal Ate Pairing at 128-Bit Security Level. INDOCRYPT 2017: 186-205 - [c5]Taehwan Park, Hwajeong Seo, Garam Lee, Md. Al-Amin Khandaker, Yasuyuki Nogami, Howon Kim:
Parallel Implementations of SIMON and SPECK, Revisited. WISA 2017: 283-294 - [i1]Md. Al-Amin Khandaker, Yuki Nanjo, Loubna Ghammam, Sylvain Duquesne, Yasuyuki Nogami, Yuta Kodera:
Efficient Optimal Ate Pairing at 128-bit Security Level. IACR Cryptol. ePrint Arch. 2017: 1174 (2017) - 2016
- [j1]Shoma Kajitani, Yasuyuki Nogami, Shunsuke Miyoshi, Thomas H. Austin, Md. Al-Amin Khandaker, Nasima Begum, Sylvain Duquesne:
Web-based Volunteer Computing for Solving the Elliptic Curve Discrete Logarithm Problem. Int. J. Netw. Comput. 6(2): 181-194 (2016) - [c4]Md. Al-Amin Khandaker, Yasuyuki Nogami:
Isomorphic Mapping for Ate-Based Pairing over KSS Curve of Embedding Degree 18. CANDAR 2016: 629-634 - [c3]Md. Al-Amin Khandaker, Yasuyuki Nogami:
An improvement of scalar multiplication on elliptic curve defined over extension field Fq2. ICCE-TW 2016: 1-2 - [c2]Md. Al-Amin Khandaker, Hirotaka Ono, Yasuyuki Nogami, Masaaki Shirase, Sylvain Duquesne:
An Improvement of Optimal Ate Pairing on KSS Curve with Pseudo 12-Sparse Multiplication. ICISC 2016: 208-219 - [c1]Md. Al-Amin Khandaker, Yasuyuki Nogami, Hwajeong Seo, Sylvain Duquesne:
Efficient Scalar Multiplication for Ate Based Pairing over KSS Curve of Embedding Degree 18. WISA 2016: 221-232
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-04-24 23:12 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:
