Dong Kyue Kim

IEEE Trans. Circuits Syst. II Express Briefs, December, 2023

A 325F2 Physical Unclonable Function Based on Contact Failure Probability With Bit Error Rate < 0.43 ppm After Preselection With 0.0177% Discard Ratio.

[BibT_eX]

[DOI]

IEEE J. Solid State Circuits, 2023

GPU Acceleration of Chinese Remainder Theorem for Fully Homomorphic Encryption.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Electronics, Information, and Communication, 2023

2022

Architectural Supports for Block Ciphers in a RISC CPU Core by Instruction Overloading.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2022

Lightweight and Low-Latency AES Accelerator Using Shared SRAM.

[BibT_eX]

[DOI]

Jaeseong Lee

IEEE Access, 2022

Contact PUF: Highly Stable Physical Unclonable Functions Based on Contact Failure Probability in 180 nm, 130 nm, and 28 nm CMOS Processes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Hardware Oriented Security and Trust, 2022

2021

ECC Coprocessor Over a NIST Prime Field Using Fast Partial Montgomery Reduction.

[BibT_eX]

[DOI]

IEEE Trans. Circuits Syst. I Regul. Pap., 2021

Secure IC with Countermeasure to Unpowered Physical Attack using On-chip Photodiode and Charge Pump.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Electronics, Information, and Communication, 2021

2020

A Physical Unclonable Function With Bit Error Rate × 10-8 Based on Contact Formation Probability Without Error Correction Code.

[BibT_eX]

[DOI]

IEEE J. Solid State Circuits, 2020

2019

Fast and Power-Analysis Resistant Ring Lizard Crypto-Processor Based on the Sparse Ternary Property.

[BibT_eX]

[DOI]

Ji-Hoon Kim

IEEE Access, 2019

2018

Low-Complexity Elliptic Curve Cryptography Processor Based on Configurable Partial Modular Reduction Over NIST Prime Fields.

[BibT_eX]

[DOI]

IEEE Trans. Circuits Syst. II Express Briefs, 2018

Secure circuit with optical energy harvesting against unpowered physical attacks.

[BibT_eX]

[DOI]

Comput. Electr. Eng., 2018

2016

Secure bimodal PIN-entry method using audio signals.

[BibT_eX]

[DOI]

Hyeonjin Nam

Comput. Secur., 2016

2015

Hash function for 3D mesh model authentication.

[BibT_eX]

[DOI]

Proceedings of the 21st Korea-Japan Joint Workshop on Frontiers of Computer Vision, 2015

Towards Zero Bit-Error-Rate Physical Unclonable Function: Mismatch-Based vs. Physical-Based Approaches in Standard CMOS Technology.

[BibT_eX]

[DOI]

Proceedings of the 2015 Euromicro Conference on Digital System Design, 2015

2012

Design of security enhanced TPM chip against invasive physical attacks.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Circuits and Systems, 2012

2011

An Efficient Architecture for a TCP Offload Engine Based on Hardware/Software Co-design.

[BibT_eX]

[DOI]

J. Inf. Sci. Eng., 2011

Probabilistic Analysis on the Optimal Combination of Trial Division and Probabilistic Primality Tests for Safe Prime Generation.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2011

Linear-Time Construction of Two-Dimensional Suffix Trees.

[BibT_eX]

[DOI]

Algorithmica, 2011

2009

Improving Lookup Time Complexity of Compressed Suffix Arrays using Multi-ary Wavelet Tree.

[BibT_eX]

[DOI]

J. Comput. Sci. Eng., 2009

Improving on-line construction of two-dimensional suffix trees for square matrices.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

Finding the longest common nonsuperstring in linear time.

[BibT_eX]

[DOI]

Joong Chae Na

Jeong Seop Sim

Inf. Process. Lett., 2009

Fast Computation of Rank and Select Functions for Succinct Representation.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2009

2008

Linearized Suffix Tree: an Efficient Index Data Structure with the Capabilities of Suffix Trees and Suffix Arrays.

[BibT_eX]

[DOI]

Minhwan Kim

Algorithmica, 2008

2007

A Simple Construction of Two-Dimensional Suffix Trees in Linear Time.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

2006

Efficient Implementation of Pseudorandom Functions for Electronic Seal Protection Protocols.

[BibT_eX]

[DOI]

Proceedings of the Information Security Applications, 7th International Workshop, 2006

Watermarking for 3D Keyframe Animation Based on Geometry and Interpolator.

[BibT_eX]

[DOI]

Suk Hwan Lee

Ki-Ryong Kwon

Proceedings of the Digital Watermarking, 5th International Workshop, 2006

MPEG Postprocessing System Using Edge Signal Variable Filter.

[BibT_eX]

[DOI]

Proceedings of the Image Analysis and Recognition, Third International Conference, 2006

Chosen Message Attack Against Mukherjee-Ganguly-Chaudhuri's Message Authentication Scheme.

[BibT_eX]

[DOI]

Dowon Hong

Proceedings of the Computational Intelligence and Security, International Conference, 2006

2005

Constructing suffix arrays in linear time.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2005

Efficient Hardware Implementation of Elliptic Curve Cryptography over GF(pm).

[BibT_eX]

[DOI]

Proceedings of the Information Security Applications, 6th International Workshop, 2005

Efficient Implementation of Rank and Select Functions for Succinct Representation.

[BibT_eX]

[DOI]

Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

New Computation Paradigm for Modular Exponentiation Using a Graph Model.

[BibT_eX]

[DOI]

Chi Seong Park

Proceedings of the Stochastic Algorithms: Foundations and Applications, 2005

Probabilistic Analyses on Finding Optimal Combinations of Primality Tests in Real Applications.

[BibT_eX]

[DOI]

Proceedings of the Information Security Practice and Experience, 2005

A New Compressed Suffix Tree Supporting Fast Search and Its Construction Algorithm Using Optimal Working Space.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005

Design and Implementation of Crypto Co-processor and Its Application to Security Systems.

[BibT_eX]

[DOI]

Proceedings of the Computational Intelligence and Security, International Conference, 2005

2004

A Fast Algorithm for Constructing Suffix Arrays for Fixed-Size Alphabets.

[BibT_eX]

[DOI]

Junha Jo

Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

An Efficient Index Data Structure with the Capabilities of Suffix Trees and Suffix Arrays for Alphabets of Non-negligible Size.

[BibT_eX]

[DOI]

Jeong Eun Jeon

Proceedings of the String Processing and Information Retrieval, 2004

2003

Generalizations of suffix arrays to multi-dimensional matrices.

[BibT_eX]

[DOI]

Yoo Ah Kim

Theor. Comput. Sci., 2003

Linear-Time Construction of Suffix Arrays.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 14th Annual Symposium, 2003

1999

Efficient Algorithms for Approximate String Matching with Swaps.

[BibT_eX]

[DOI]

J. Complex., 1999

Linear-Time Construction of Two-Dimensional Suffix Trees.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1999

1998

Constructing Suffix Arrays for Multi-dimensional Matrices.

[BibT_eX]

[DOI]

Yoo Ah Kim

Proceedings of the Combinatorial Pattern Matching, 9th Annual Symposium, 1998

1997

Efficient Algorithms for Approximate String Matching with Swaps (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 8th Annual Symposium, 1997

1995

String Matching in Hypertext.

[BibT_eX]

[DOI]