지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 저널정보
- Korean Institute of Information Scientists and Engineers Journal of Computing Science and Engineering Journal of Computing Science and Engineering Vol.18 No.3
- 발행연도
- 2024.9
- 수록면
- 144 - 151 (8page)
- DOI
- 10.5626/JCSE.2024.18.3.144
이용수
초록· 키워드
오류제보하기
Substitution ciphers-where characters are systematically replaced with different ones-have represented a vital tool in safeguarding sensitive information for centuries, eventually laying the foundation for modern encryption techniques. Despite their large key space, substitution ciphers are susceptible to frequency analysis that leverages common English letter patterns. While existing research has suggested certain methods that can improve decryption accuracy using ngram frequencies, these methods face difficulties when used with short ciphertexts due to incomplete letter distribution representation. The present study examines the limitations of current frequency analysis in decrypting short ciphertexts, with the results revealing that deterministic bigram approaches can reduce accuracy in certain cases. To address this shortcoming, we introduce a novel algorithm that uses randomized index selection based on letter distribution to generate multiple candidate keys. We also present a word-level key guessing method using these candidates that maps prominent English words to uncover a secret key. The results of tests with 200 ciphertexts of varying lengths showed an average decryption accuracy of 84.1% for 200-character ciphertexts, an improvement of 147.1% over existing methods. In experiments without dictionary-based decryption, an accuracy of 77.6% was achieved with a decryption time of approximately 0.27 seconds, which is a reasonable completion time. Altogether, these results highlight the efficiency and practicality of
our approach for decrypting short ciphertexts.
our approach for decrypting short ciphertexts.
목차
Abstract
Ⅰ. INTRODUCTION
Ⅱ. BACKGROUND
Ⅲ. RELATED WORK
Ⅳ. ANALYSIS OF BIGRAM STRATEGIES
Ⅴ. OUR APPROACH
Ⅵ. EVALUATION
Ⅶ. CONCLUSION
REFERENCES
참고문헌 (18)
참고문헌 신청
C. P. Pfleeger, S. L. Pfleeger, and J. Margulies, Security in Computing, 5th ed. Upper Saddle River, NJ: Prentice-Hall, 2015.
I. A. Al-Kadit, “Origins of cryptology: the Arab contributions,” Cryptologia, vol. 16, no. 2, pp. 97-126, 1992. https://doi.org/10.1080/0161-119291866801
B. Hauer, R. Hayward, and G. Kondrak, “Solving substitution ciphers with combined language models,” in Proceedings of the 25th International Conference on Computational Linguistics: Technical Papers (COLING), Dublin, Ireland, 2014, pp. 2314-2325.
B. Hauer and G. Kondrak, “Decoding anagrammed texts written in an unknown language and script,” Transactions of the Association for Computational Linguistics, vol. 4, pp. 75-86, 2016. https://doi.org/10.1162/tacl_a_00084
M. H. Ahmed, A. K. Shibeeb, and A. H. Mohammed, “Solve polyalphabetic cipher based on intelligent system,” in Proceedings of 2021 International Conference on Communication & Information Technology (ICICT), Basrah, Iraq, 2021, pp. 290-296. https://doi.org/10.1109/ICICT52195.2021.9568455
I. A. Al-Kadit, “Origins of cryptology: the Arab contributions,” Cryptologia, vol. 16, no. 2, pp. 97-126, 1992. https://doi.org/10.1080/0161-119291866801
B. Hauer, R. Hayward, and G. Kondrak, “Solving substitution ciphers with combined language models,” in Proceedings of the 25th International Conference on Computational Linguistics: Technical Papers (COLING), Dublin, Ireland, 2014, pp. 2314-2325.
B. Hauer and G. Kondrak, “Decoding anagrammed texts written in an unknown language and script,” Transactions of the Association for Computational Linguistics, vol. 4, pp. 75-86, 2016. https://doi.org/10.1162/tacl_a_00084
M. H. Ahmed, A. K. Shibeeb, and A. H. Mohammed, “Solve polyalphabetic cipher based on intelligent system,” in Proceedings of 2021 International Conference on Communication & Information Technology (ICICT), Basrah, Iraq, 2021, pp. 290-296. https://doi.org/10.1109/ICICT52195.2021.9568455
함께 읽어보면 좋을 논문
논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!
-
Constant-Size Ciphertext-Policy Attribute-Based Data Access and Outsourceable Decryption Scheme
Journal of KIISE
2016 .08
-
Reduction of Key and Ciphertext Sizes of Lattice-Based Cryptography
한국통신학회 학술대회논문집
2021 .02
-
Genetic Symmetric Key Generation for IDEA
JIPS(Journal of Information Processing Systems)
2015 .01
-
Encryption and Decryption using Elliptic Curve Cryptography for IoT Security
한국통신학회 학술대회논문집
2019 .06
-
HIGHT 암복호화 병렬 실행을 위한 Key Scheduler 설계
센서학회지
2015 .01
-
Natural Logarithm을 이용한 암호문간의 거듭제곱 동형연산 방법
한국통신학회 학술대회논문집
2024 .06
-
음성과 영상 데이터 Key 를 사용한 이중 암호화 및 실시간 지능형 복호화
디지털콘텐츠학회논문지
2019 .12
-
Channel-based Encryption for Identity-based Traceability for a Decentralized Network
한국차세대컴퓨팅학회 논문지
2023 .04
-
블록암호의 운영모드
한국정보통신학회 종합학술대회 논문집
2024 .10
-
SSB 암호 알고리즘에 대한 차분 오류 공격
한국항행학회논문지
2015 .01
-
TPM을 활용한 견고한 파일 시스템 암호화 및 안전한 데이터 저장 솔루션
대한전자공학회 학술대회
2024 .11
-
환자의 익명성이 보장되는 암호문 정책 속성중심 암호를 활용한 블록체인 기반 전자의무기록 공유 프레임워크
융합보안논문지
2019 .01
-
Camellia 블록 암호의 암·복호화기 코어 설계
한국정보통신학회논문지
2016 .04
-
랜덤 위상 마스크와 2-단계 위상 천이 디지털 홀로그래피를 이용한 이진 영상 이중 암호화
멀티미디어학회논문지
2016 .06
-
Elliptic Curve Cryptography for Data Security
한국통신학회 학술대회논문집
2019 .11
-
Implementation and Testing of XOR Encryption and Decryption in GNU Radio for VHF Cognitive Radio Communications
한국통신학회 학술대회논문집
2024 .11
-
Automotive Cyber Security Overview
한국자동차공학회 추계학술대회 및 전시회
2017 .11
-
공개 채널을 통한 상관 키 분산 암호화의 프라이버시 증폭
한국인터넷방송통신학회 논문지
2018 .01
-
High-performance Ring-LWE Cryptography Scheme for Biometric Data Security
IEIE Transactions on Smart Processing & Computing
2018 .04
-
스크래치 기반의 암호화 프로그램
한국컴퓨터정보학회 학술발표논문집
2018 .07
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-151-25-02-091192254