Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Jihoon Kim

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Piljoo Choi

> Home > Persons > Jihoon Kim

Publications

2022
[j85]
- view
  authority control:
- export record
  dblp key:
  - journals/tc/ChoiKKLK22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tc/ChoiKKLK22
Piljoo Choi, Won Bae Kong, Ji-Hoon Kim, Mun-Kyu Lee, Dong Kyue Kim:
Architectural Supports for Block Ciphers in a RISC CPU Core by Instruction Overloading. IEEE Trans. Computers 71(11): 2844-2857 (2022)
2019
[j65]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/access/ChoiKK19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/access/ChoiKK19
Piljoo Choi, Ji-Hoon Kim, Dong Kyue Kim:
Fast and Power-Analysis Resistant Ring Lizard Crypto-Processor Based on the Sparse Ternary Property. IEEE Access 7: 98684-98693 (2019)
2018
[j56]
- view
  authority control:
- export record
  dblp key:
  - journals/tcas/ChoiLKK18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcas/ChoiLKK18
Piljoo Choi, Mun-Kyu Lee, Ji-Hoon Kim, Dong Kyue Kim:
Low-Complexity Elliptic Curve Cryptography Processor Based on Configurable Partial Modular Reduction Over NIST Prime Fields. IEEE Trans. Circuits Syst. II Express Briefs 65-II(11): 1703-1707 (2018)

a service of

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.