default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSang Geun Hahn
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j12]Young Lee, Sang Geun Hahn:
State of the Art of Anti-Screen Capture Protection Techniques. KSII Trans. Internet Inf. Syst. 15(5): 1871-1890 (2021)
2010 – 2019
- 2019
- [j11]Seonggeun Kim
, Sang Geun Hahn:
Mining Pool Manipulation in Blockchain Network Over Evolutionary Block Withholding Attack. IEEE Access 7: 144230-144244 (2019) - 2018
- [j10]Dongyoung Roh, I-Yeol Kim, Sang Geun Hahn:
The l-th power Diffie-Hellman problem and the l-th root Diffie-Hellman problem. Appl. Algebra Eng. Commun. Comput. 29(1): 41-57 (2018) - [j9]Busik Jang, Sangdon Park, Joohyung Lee, Sang Geun Hahn:
Three Hierarchical Levels of Big-Data Market Model Over Multiple Data Sources for Internet of Things. IEEE Access 6: 31269-31280 (2018) - 2016
- [c4]Jeongsu Kim, Suyong Park, Seonggeun Kim, Busik Jang, Sang Geun Hahn, Sangim Jung, Dongyoung Roh:
Analysis of Error Terms of Signatures Based on Learning with Errors. ICISC 2016: 75-97 - 2012
- [j8]Dongyoung Roh, Sang Geun Hahn:
The square root Diffie-Hellman problem. Des. Codes Cryptogr. 62(2): 179-187 (2012) - 2010
- [j7]Dongyoung Roh, Sang Geun Hahn:
On the bit security of the weak Diffie-Hellman problem. Inf. Process. Lett. 110(18-19): 799-802 (2010) - [j6]Moon Sung Lee, Sang Geun Hahn:
Cryptanalysis of the GGH Cryptosystem. Math. Comput. Sci. 3(2): 201-208 (2010)
2000 – 2009
- 2009
- [j5]Hyeonjin Kim, Sung-Mo Park, Sang Geun Hahn:
On the weight and nonlinearity of homogeneous rotation symmetric Boolean functions of degree 2. Discret. Appl. Math. 157(2): 428-432 (2009) - 2004
- [c3]Bo Gyeong Kang, Je Hong Park, Sang Geun Hahn:
A Certificate-Based Signature Scheme. CT-RSA 2004: 99-111 - [i1]Bo Gyeong Kang, Je Hong Park, Sang Geun Hahn:
A New Forward Secure Signature Scheme. IACR Cryptol. ePrint Arch. 2004: 183 (2004) - 2003
- [j4]Sang Geun Hahn, Eonkyung Lee, Je Hong Park:
Complexity of the generalized conjugacy problem. Discret. Appl. Math. 130(1): 33-36 (2003) - 2002
- [c2]Hae Young Kim, Jung Youl Park, Jung Hee Cheon, Je Hong Park, Jae Heon Kim, Sang Geun Hahn:
Fast Elliptic Curve Point Counting Using Gaussian Normal Basis. ANTS 2002: 292-307 - 2001
- [c1]Eonkyung Lee, Sangjin Lee, Sang Geun Hahn:
Pseudorandomness from Braid Groups. CRYPTO 2001: 486-502 - 2000
- [j3]Dong Geon Kim, Sang Geun Hahn, Yong Soo Kim:
A Syndrome-Distribution Decoding of Mols Lp Codes. Ars Comb. 56 (2000)
1990 – 1999
- 1998
- [j2]Jun Kyo Kim, Sang Geun Hahn:
A new upper bound for binary codes with minimum distance four. Discret. Math. 187(1-3): 291-295 (1998) - 1997
- [j1]Jun Kyo Kim, Sang Geun Hahn:
Partitions of bipartite numbers. Graphs Comb. 13(1): 73-78 (1997)
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-10-07 21:20 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:
