• Title/Summary/Keyword: Shuffling

Search Result 94, Processing Time 0.033 seconds

Selective Shuffling for Hiding Hangul Messages in Steganography (스테가노그래피에서 한글 메시지 은닉을 위한 선택적 셔플링)

  • Ji, Seon-su
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.15 no.3
    • /
    • pp.211-216
    • /
    • 2022
  • Steganography technology protects the existence of hidden information by embedding a secret message in a specific location on the cover medium. Security and resistance are strengthened by applying various hybrid methods based on encryption and steganography. In particular, techniques to increase chaos and randomness are needed to improve security. In fact, the case where the shuffling method is applied based on the discrete cosine transform(DCT) and the least significant bit(LSB) is an area that needs to be studied. I propose a new approach to hide the bit information of Hangul messages by integrating the selective shuffling method that can add the complexity of message hiding and applying the spatial domain technique to steganography. Inverse shuffling is applied when extracting messages. In this paper, the Hangul message to be inserted is decomposed into the choseong, jungseong and jongseong. It improves security and chaos by applying a selective shuffling process based on the corresponding information. The correlation coefficient and PSNR were used to confirm the performance of the proposed method. It was confirmed that the PSNR value of the proposed method was appropriate when compared with the reference value.

Shuffling of Elliptic Curve Cryptography Key on Device Payment

  • Kennedy, Chinyere Grace;Cho, Dongsub
    • Journal of Korea Multimedia Society
    • /
    • v.22 no.4
    • /
    • pp.463-471
    • /
    • 2019
  • The growth of mobile technology particularly smartphone applications such as ticketing, access control, and making payments are on the increase. Elliptic Curve Cryptography (ECC)-based systems have also become widely available in the market offering various convenient services by bringing smartphones in proximity to ECC-enabled objects. When a system user attempts to establish a connection, the AIK sends hashes to a server that then verifies the values. ECC can be used with various operating systems in conjunction with other technologies such as biometric verification systems, smart cards, anti-virus programs, and firewalls. The use of Elliptic-curve cryptography ensures efficient verification and signing of security status verification reports which allows the system to take advantage of Trusted Computing Technologies. This paper proposes a device payment method based on ECC and Shuffling based on distributed key exchange. Our study focuses on the secure and efficient implementation of ECC in payment device. This novel approach is well secure against intruders and will prevent the unauthorized extraction of information from communication. It converts plaintext into ASCII value that leads to the point of curve, then after, it performs shuffling to encrypt and decrypt the data to generate secret shared key used by both sender and receiver.

PingPong 256 shuffling method with Image Encryption and Resistance to Various Noise (이미지 암호화 및 다양한 잡음에 내성을 갖춘 PingPong 256 Shuffling 방법)

  • Kim, Ki Hwan;Lee, Hoon Jae
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.24 no.11
    • /
    • pp.1507-1518
    • /
    • 2020
  • High-quality images have a lot of information, so sensitive data is stored by encryption for private company, military etc. Encrypted images can only be decrypted with a secret key, but the original data cannot be retained when attacked by the Shear attack and Noise pollution attack techniques that overwrite some pixel data with arbitrary values. Important data is the more necessary a countermeasure for the recovery method against attack. In this paper, we propose a random number generator PingPong256 and a shuffling method that rearranges pixels to resist Shear attack and Noise pollution attack techniques so that image and video encryption can be performed more quickly. Next, the proposed PingPong256 was examined with SP800-22, tested for immunity to various noises, and verified whether the image to which the shuffling method was applied satisfies the Anti-shear attack and the Anti-noise pollution attack.

Segment unit shuffling layer in deep neural networks for text-independent speaker verification (문장 독립 화자 인증을 위한 세그멘트 단위 혼합 계층 심층신경망)

  • Heo, Jungwoo;Shim, Hye-jin;Kim, Ju-ho;Yu, Ha-Jin
    • The Journal of the Acoustical Society of Korea
    • /
    • v.40 no.2
    • /
    • pp.148-154
    • /
    • 2021
  • Text-Independent speaker verification needs to extract text-independent speaker embedding to improve generalization performance. However, deep neural networks that depend on training data have the potential to overfit text information instead of learning the speaker information when repeatedly learning from the identical time series. In this paper, to prevent the overfitting, we propose a segment unit shuffling layer that divides and rearranges the input layer or a hidden layer along the time axis, thus mixes the time series information. Since the segment unit shuffling layer can be applied not only to the input layer but also to the hidden layers, it can be used as generalization technique in the hidden layer, which is known to be effective compared to the generalization technique in the input layer, and can be applied simultaneously with data augmentation. In addition, the degree of distortion can be adjusted by adjusting the unit size of the segment. We observe that the performance of text-independent speaker verification is improved compared to the baseline when the proposed segment unit shuffling layer is applied.

The Science of HwaTu Card Shuffling (화투 섞기의 과학)

  • Huh, Myung-Hoe;Lee, Yong-Goo
    • The Korean Journal of Applied Statistics
    • /
    • v.23 no.6
    • /
    • pp.1209-1216
    • /
    • 2010
  • We describe shuffling process of 48 HwaTu(Flower) cards from a mathematical aspect and give the number of shuffles that are needed to arrive at a state of randomness. We observe that the cards are shuffled much less times in usual plays, that results in much riskier outcomes.

Comparison of Exon-boundary Old and Young Domains during Metazoan Evolution

  • Lee, Byung-Wook
    • Genomics & Informatics
    • /
    • v.7 no.2
    • /
    • pp.131-135
    • /
    • 2009
  • Domains are the building blocks of proteins. Exon shuffling is an important mechanism accounting for combination of a limited repertoire of protein domains in the evolution of multicellular species. A relative excess of domains encoded by symmetric exons in metazoan phyla has been presented as evidence of exon shuffling, and symmetric domains can be divided into old and new domains by determining the ages of the domains. In this report, we compare the spread, versatility, and subcellular localization of old and new domains by analyzing eight metazoan genomes and their respective annotated proteomes. We found that new domains have been expanding as multicellular organisms evolved, and this expansion was principally because of increases in class 1-1 domains amongst several classes of domain families. We also found that younger domains have been expanding in membranes and secreted proteins along with multi-cellular organism evolution. In contrast, old domains are located mainly in nuclear and cytoplasmic proteins. We conclude that the increasing mobility and versatility of new domains, in contrast to old domains, plays a significant role in metazoan evolution, facilitating the creation of secreted and transmembrane multidomain proteins unique to metazoa.

Enhancement of PHB depolymerase Activity from Alcaligenes faecalis T1 by DNA Shuffling (DNA shuffling을 이용한 Alcaligenes faecalis T1의 PHB depolymerase 활성 증진)

  • 신동성;이영하;남진식
    • Korean Journal of Microbiology
    • /
    • v.39 no.2
    • /
    • pp.76-82
    • /
    • 2003
  • To prepare evolved PHB depolymerase with increased activity for PHB or P(3HB-co-3HV) compared to the activity of the original PHB depolymerase from Alcaligenes faecalis T1, random mutation of the cloned PHB depolymerase gene was performed by using a DNA shuffling method. A library of mutated PHB depolymerase genes from A. faecalis T1 was fused to the ice nucleation protein (INP) gene from Pseudomonas syringae in pJHCl 1 and approximately 7,000 transformants were isolated. Using M9 minimal medium containing PHB or P(3HB-co-3HV) as the carbon source, mutants showing alteration in PHB depolymerase activity were selected from the transformants. The PHB depolymease activity of the transformants was confirmed by the formation of halo around colony and the turbidity decrease tests using culture supermatants. The catalytic activity of PHB depolymerase of the best mutant II-4 for PHB or P(3HB-co-13 mol% 3HV) was approximately 1.8-fold and 3.2-fold, respectively, higher than that of the original PHB depolymerase. DNA sequence analysis revealed that three amino acid residues (Ala209Val, Leu258Phe, and Asp263Thr) were substituted in II-4. From the mutational analysis, it was presumed that the substitution of amino acids near catalytic triad to more hydrophobic amino acids enhance the catalytic activity of PHB depolymerase from A. faecalis T1.

Watermarking Algorithm for 1-bit Image Authentication using Edges (Edge를 이용한 1-bit 영상의 원본 증명용 워터마킹 알고리즘)

  • 박용정;권오진
    • Proceedings of the IEEK Conference
    • /
    • 2002.06d
    • /
    • pp.105-108
    • /
    • 2002
  • This paper proposes a new watermarking algorithm to embed data in 1-bit images using edges for protecting illegal copies or modifications. This method is based on edge detection to decide the most invisible region. This paper also introduces a new shuffling method which embeds data in each blocks uniformly and finds Positions under the limited attacks. In experiment, we compare the proposed shuffling method with M. Wu's method.

  • PDF

Directed Evolution of Beta-galactosidase from Escherichia coli into Beta-glucuronidase

  • Xiong, Ai-Sheng;Peng, Ri-He;Zhuang, Jing;Liu, Jin-Ge;Xu, Fang;Cai, Bin;Guo, Zhao-Kui;Qiao, Yu-Shan;Chen, Jian-Min;Zhang, Zhen;Yao, Quan-Hong
    • BMB Reports
    • /
    • v.40 no.3
    • /
    • pp.419-425
    • /
    • 2007
  • In vitro directed evolution through DNA shuffling is a powerful molecular tool for creation of new biological phenotypes. E. coli $\beta$-galactosidase and $\beta$-glucuronidase are widely used, and their biological function, catalytic mechanism, and molecular structures are well characterized. We applied an in vitro directed evolution strategy through DNA shuffling and obtained five mutants named YG6764, YG6768, YG6769, YG6770 and YG6771 after two rounds of DNA shuffling and screening, which exhibited more $\beta$-glucuronidase activity than wild-type $\beta$-galactosidase. These variants had mutations at fourteen nucleic acid sites, resulting in changes in ten amino acids: S193N, T266A, Q267R, V411A, D448G, G466A, L527I, M543I, Q626R and Q951R. We expressed and purified those mutant proteins. Compared to the wild-type protein, five mutant proteins exhibited high $\beta$-glucuronidase activity. The comparison of molecular models of the mutated and wildtype enzymes revealed the relationship between protein function and structural modification.

Antenna Selection and Shuffling for DSTTD Systems with Correlated Transmit-Antenna (송신 안테나 사이에 상관관계가 있는 DSTTD 시스템에서 안테나 선택과 뒤섞는 기법)

  • Joung, Jin-Gon;Jeong, Eui-Rim;Lee, Yong-Hoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.8C
    • /
    • pp.767-774
    • /
    • 2007
  • A new transmit antenna selection and shuffling($AS^2$) method for spatially correlated double space time transmit diversity(DSTTD) systems is proposed. The proposed method allows dumb antennas and the superposition of multiple signals at the same transmit antenna, whereas the conventional methods consider the antenna shuffling(AS) only. According to the simulation result, the proposed method provides a 1.8 dB signal-to-noise ratio(SNR) gain over the conventional methods for spatially correlated transmit antennas. Although the number of candidates for $AS^2$ is much higher than that of AS, it is found that the number of candidates for $AS^2$ can be reduced to 36 by using the characteristics and properties of preprocessing matrices, and among them, only 6 candidates are almost always chosen. Next, we empirically compare the bit-error-rate (BER) performance of the proposed method with the conventional spatial multiplexing(SM) technique with antenna selection. Simulation results show that the proposed method outperforms the SM technique.