Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Bongjoo Park

dblp:68/1815 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2005
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Coding theory · 100%
Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis
stream cipher		 0.011999
An Efficient Implementation of the D-Homomorphism for Generation of de Bruijn Sequences · IEEE Trans. Inf. Theory 1999
Coding theory › sequences
de bruijn sequences		 0.011999
An Efficient Implementation of the D-Homomorphism for Generation of de Bruijn Sequences · IEEE Trans. Inf. Theory 1999
Coding theory › sequences
sequence generation		 0.011999
An Efficient Implementation of the D-Homomorphism for Generation of de Bruijn Sequences · IEEE Trans. Inf. Theory 1999

Methods — techniques the papers use, named apart from their topics

d-homomorphism · 0.0exclusive-or operations · 0.0Exclusive-OR operation · 0.0
YearPublicationVenuePosition
2005 New Key Management Systems for Multilevel Security
Hwankoo Kim, Bongjoo Park, JaeCheol Ha, Byoungcheon Lee, DongGook Park
 ICCSA (2)2
1999 An Efficient Implementation of the D-Homomorphism for Generation of de Bruijn Sequences
abstract
An efficient implementation of the D-homomorphism for generating de Bruijn (1946) sequences is presented. The number of exclusive-or operations required to generate the next bit for de Bruijn sequences of order n from a de Bruijn function of order k is shown to be approximately k(2/sup W(n-k)/-1), where W(r) is the number of one's in the binary representation of r: therefore, the number of required operations can be reduced to k if the de Bruijn function is selected appropriately. As an application, the stream cipher is indicated.
Taejoo Chang, Bongjoo Park, Yun Hee Kim, Iickho Song
 IEEE Trans. Inf. Theory2