• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.1
• /
• pp.101-111
• /
• 2004

Preneel, Govaerts, and Vandewalle considered the 64 basic ways to construct a collision resistant hash function from a block cipher. They regarded 12 of these 64 schemes as secure, though no proofs or formal claims were given. Black, Rogaway, and Shrimpton presented a more proof-centric look at the schemes from PGV. They proved that, in the black box model of block cipher, 12 of 64 compression functions are CRHFs and 20 of 64 extended hash functions are CRHFs. In this paper, we present 64 schemes of block-cipher-based universal one way hash functions using the main idea of PGV and analyze these schemes in the black box model. We will show that 30 of 64 compression function families UOWHF and 42 of 64 extended hash function families are UOWHF. One of the important results is that, in this black box model, we don't need the mask keys for the security of UOWHF in contrast with the results in general security model of UOWHF. Our results also support the assertion that building an efficient and secure UOWHF is easier than building an efficient and secure CRHF.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.14 no.2
• /
• pp.11-17
• /
• 2018

IDS/IPS and networked computer systems are playing an increasingly important role in our society. They have been the targets of a malicious attacks that actually turn into intrusions. That is why computer security has become an important concern for network administrators. Recently, various Detection/Prevention System schemes have been proposed based on various technologies. However, the techniques, which have been applied in many systems is useful for existing intrusion patterns on standard-only systems. Therefore, probe detection of private clouds using BlockChain has become a major security protection technology to detection potential attacks. In addition, BlockChain and Probe detection need to take into account the relationship between the various factors. We should develop a new probe detection technology that uses BlockChain to fine new pattern detection probes in cloud service security in the end. In this paper, we propose a probe detection using Fuzzy Cognitive Map(FCM) and Self Adaptive Module(SAM) based on service security using BlockChain technology.

• 한국전산유체공학회:학술대회논문집
• /
• 2000.05a
• /
• pp.78-83
• /
• 2000

An iterative time marching procedure for solving incompressible internal flow has been applied to the flow around a rotor-stator. This procedure solves three-dimensional incompressible Reynolds-averaged Navier-Stokes equation on a moving, time-deforming, non-orthogonal body-fitted grid using second-order accurate schemes for the time derivatives and third/second-order accurate schemes for the spatial derivatives. To handle rotationg geometry, the multiblock technique is applied and the overall flow domain is subdivided into two blocks. In each block, a grid is generated and flowfield is solved independently of the other blocks. The boundary data for each block is provided by the neighboring blocks using bilinear interpolation technique.

• IEIE Transactions on Smart Processing and Computing
• /
• v.5 no.4
• /
• pp.231-234
• /
• 2016

The next-generation video coding standard known as High-Efficiency Video Coding (HEVC) was developed with the aim of doubling the bitrate reduction offered by H.264/Advanced Video Coding (AVC) at the expense of an increase in computational complexity. Mode decision with motion estimation is still one of the most time-consuming computations in HEVC, as it is with H.264/AVC. Several schemes for a fast mode decision have been presented in reference software and in other studies. However, a possible speed-up in conventional schemes is sometimes insignificant for videos that have inhomogeneous spatial and temporal characteristics. This paper proposes a bypass algorithm to skip large-block-size predictions for videos where small block sizes are preferred over large ones. The proposed algorithm does not overlap with those in previous works, and thus, is easily used with other fast algorithms. Consequently, an independent speed-up is possible.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.10A
• /
• pp.980-986
• /
• 2008

Spatial multiuser access is investigated for the reverse link of multiuser multiple-input multiple-output (MIMO) systems. In particular, we consider two alternative a aches to spatial multiuser access that adopt the same detection algorithm at the base station: one is a closed-loop approach based on singular value decomposition (SVD) of the channel matrix, whereas the other is an open-loop approach based in space-time block coding (STBC). We develop multiuser detection algorithms for these two spatial multiuser access schemes based on the minimum mean square error (MMSE) criterion. Then, we compare the bit error rate (BER) performance of the two schemes and a single-user MIMO scheme. Interestingly, it is found that the STBC approach can provide much better BER performance than the SVD approach as well as than a single-user MIMO scheme.

• Proceedings of the KOSOMBE Conference
• /
• v.1996 no.11
• /
• pp.293-296
• /
• 1996

In this paper, we studied two image characteristics, similarity and smoothness, which give rise to local and global redundancy in image representation. The similarty means that any patterns in the image repeat itself anywhere in the rest of image. The smoothness means that the gray level values within a given block vary gradually rather than abruptly. In this sense, we propose a lossless medical image compression scheme which exploits both types of redundancy. This method segments the image into variable size blocks and encodes them depending on characteristics of the block. The proposed compression schemes works better than other compression schemes such as the huffman, the arithmetic, the Lempel-Ziv and the lossless scheme of JPEG.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12A
• /
• pp.933-940
• /
• 2009

This paper proposes a robust detection scheme for quasi-orthogonal space-time block code over time-selective fading channels. The proposed detector performs interference cancellation and decision feedback equalization to remove the inter-antenna interference and inter-symbol interference when the channel varies from symbol to symbol. Cholesky factorization is used on the channel Gram matrix after performing interference cancellation to obtain feed forward equalizer and feedback equalizer. It is shown by simulations that the proposed detection scheme outperforms the conventional detection schemes and the exiting detection schemes to time-selectivity.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.2
• /
• pp.139-151
• /
• 1997

An ATM switching system may be designed so that communications between processors of its control part can be performed via its switching network rather than a separate inter-processor communications (IPC) network. In such a system, there should be interfaces to convent IPC traffic from message format to cell format and vice versa, that is, mechanisms to perform the SAR (Segmentation And Reassembly) sublayer functions. In this paper, we concern the cell reassembly mechanism among them, mainly focussed on buffer management schemes. We consider a few alternatives to implement cell reassembly function block, namely, separated buffering, reserved buffering and shared buffering in this paper. In case of separated and reserved buffering, we employ a continuous time Markov chain for the performance evaluation of cell reassembly mechanism, judicially defining the states of the mechanism. Performance measures such as measage loss probability, mean number of message queued in buffer and average reassembly delay are obtianed in closed forms. In case of shared buffering, we compare the alternatives for implementing cell reassembly function block using simulation because it is almost impossible to analyze the mechanism of shared buffering by analytical modeling. Some illustrations are given for the performance analysis of the alternatives to implement cell reassembly function block.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.5
• /
• pp.2326-2345
• /
• 2016

For the compression of color images, a common bitmap usually is generated to replace the three individual bitmaps that originate from block truncation coding (BTC) of the R, G and B channels. However, common bitmaps generated by some traditional schemes are not the best possible because they do not consider the minimized distortion of the entire color image. In this paper, we propose a near-optimized common bitmap scheme for BTC using Binary Ant Colony Optimization (BACO), producing a BACO-BTC scheme. First, the color image is compressed by the BTC algorithm to get three individual bitmaps, and three pairs of quantization values for the R, G, and B channels. Second, a near-optimized common bitmap is generated with minimized distortion of the entire color image based on the idea of BACO. Finally, the color image is reconstructed easily by the corresponding quantization values according to the common bitmap. The experimental results confirmed that reconstructed image of the proposed scheme has better visual quality and less computational complexity than the referenced schemes.

• ETRI Journal
• /
• v.28 no.5
• /
• pp.684-687
• /
• 2006

In this letter, we evaluate the system performance of a space-time block coded (STBC) multicarrier (MC) DS-CDMA system over a time selective fading channel, with imperfect channel knowledge. The average bit error rate impairment due to imperfect channel information is investigated by taking into account the effect of the STBC position. We consider two schemes: STBC after spreading and STBC before spreading in the MC DS-CDMA system. In the scheme with STBC after spreading, STBC is performed at the chip level; in the scheme with STBC before spreading, STBC is performed at the symbol level. We found that these two schemes have various channel estimation errors, and that the system with STBC before spreading is more sensitive to channel estimation than the system with STBC after spreading. Furthermore, derived results prove that a high spreading factor (SF) in the MC DS-CDMA system with STBC before spreading leads to high channel estimation error, whereas for a system with STBC after spreading this statement is not true.