• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.2
• /
• pp.591-608
• /
• 2023

With the emergence of advanced encryption technologies such as Quantum Cryptography and Full Disk Encryption, an era of strengthening information security has begun. Users respond positively to the advancement of privacy-enhancing technology, on the other hand, investigative agencies have difficulty unveiling the actual truth as they fail to decrypt devices. In particular, unlike past ciphers, encryption methods using biometric information such as fingerprints, iris, and faces have become common and have faced technical limitations in collecting digital evidence. Accordingly, normative solutions have emerged as a major issue. The United States enacted the CLOUD Act with the legal mechanism of 'Contempt of court' and in 2016, the United Kingdom substantiated the Compelled Decryption through the Investigatory Powers Act (IPA). However, it is difficult to enforce Compelled Decryption on individuals in Korea because Korean is highly sensitive to personal information. Therefore, in this paper, we sought a method of introducing a Compelled Decryption that does not contradict the people's legal sentiment through a perception survey of 95 people on the Compelled Decryption. We tried to compare and review the Budapest Convention with major overseas laws such as the United States and the United Kingdom, and to suggest a direction of legislation acceptable to the people in ways to minimize infringement of privacy. We hope that this study will be an effective legal response plan for law enforcement agencies that can normatively overcome the technical limitations of decoding.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.33 no.3
• /
• pp.375-381
• /
• 2023

Fully homomorphic encryption enables algebraic operations on encrypted data, and recently, methods for approximating non-algebraic operations such as the maximum function have been studied. However, precise approximation of max-pooling operations for four or more numbers have not been researched yet. In this study, we propose a precise max-pooling approximation method using the composition of approximate polynomials of the maximum function and theoretically analyze its precision. Experimental results show that the proposed approximate max-pooling has a small amortized runtime of less than 1ms and high precision that matches the theoretical analysis.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2024.05a
• /
• pp.374-376
• /
• 2024

최근 차세대 암호로 불리는 양자내성암호(PQC, Post Quantum Cryptography)는 양자 컴퓨터와 현재 사용하는 일반 컴퓨터 모두에서 내성을 갖는 암호이다. 그 중 FALCON 전자 서명 알고리즘은 표준화로 선정되며 초안 문서를 작성하는 중으로 차세대 암호로 주목받고 있다. 하지만 FALCON 알고리즘은 실수 연산을 사용하는 등 임베디드 환경에서 효율적인 성능을 보이지 못하고 있다. 이에 따라 임베디드 하드웨어 가속 연구들이 있으며, 그 중 HLS(High Level Synthesis)를 통한 FPGA 가속 연구들이 있다. 본 논문에서는 FALCON 전자서명 알고리즘에서 HLS 로 구현하는데 어려움이 있었던 서명 생성 함수에 대해 분석하고, 이를 소프트웨어/하드웨어 통합설계를 통해 HLS로 구현하였다. 이는 기존 소프트웨어 대비 약 10배 빠른 연산 속도를 보여주고 있다.