• Title/Summary/Keyword: Brute Force Method

Search Result 61, Processing Time 0.025 seconds

Privacy-Preserving H.264 Video Encryption Scheme

  • Choi, Su-Gil;Han, Jong-Wook;Cho, Hyun-Sook
    • ETRI Journal
    • /
    • v.33 no.6
    • /
    • pp.935-944
    • /
    • 2011
  • As a growing number of individuals are exposed to surveillance cameras, the need to prevent captured videos from being used inappropriately has increased. Privacy-related information can be protected through video encryption during transmission or storage, and several algorithms have been proposed for such purposes. However, the simple way of evaluating the security by counting the number of brute-force trials is not proper for measuring the security of video encryption algorithms, considering that attackers can devise specially crafted attacks for specific purposes by exploiting the characteristics of the target video codec. In this paper, we introduce a new attack for recovering contour information from encrypted H.264 video. The attack can thus be used to extract face outlines for the purpose of personal identification. We analyze the security of previous video encryption schemes against the proposed attack and show that the security of these schemes is lower than expected in terms of privacy protection. To enhance security, an advanced block shuffling method is proposed, an analysis of which shows that it is more secure than the previous method and can be an improvement against the proposed attack.

Hyper Parameter Tuning Method based on Sampling for Optimal LSTM Model

  • Kim, Hyemee;Jeong, Ryeji;Bae, Hyerim
    • Journal of the Korea Society of Computer and Information
    • /
    • v.24 no.1
    • /
    • pp.137-143
    • /
    • 2019
  • As the performance of computers increases, the use of deep learning, which has faced technical limitations in the past, is becoming more diverse. In many fields, deep learning has contributed to the creation of added value and used on the bases of more data as the application become more divers. The process for obtaining a better performance model will require a longer time than before, and therefore it will be necessary to find an optimal model that shows the best performance more quickly. In the artificial neural network modeling a tuning process that changes various elements of the neural network model is used to improve the model performance. Except Gride Search and Manual Search, which are widely used as tuning methods, most methodologies have been developed focusing on heuristic algorithms. The heuristic algorithm can get the results in a short time, but the results are likely to be the local optimal solution. Obtaining a global optimal solution eliminates the possibility of a local optimal solution. Although the Brute Force Method is commonly used to find the global optimal solution, it is not applicable because of an infinite number of hyper parameter combinations. In this paper, we use a statistical technique to reduce the number of possible cases, so that we can find the global optimal solution.

Algorithm for Candidate Clue Decision based on Magic Rule in Kakuro Puzzle (가꾸로 퍼즐에 관한 마법 규칙 기반 실마리 후보 결정 알고리즘)

  • Sang-Un Lee
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.24 no.3
    • /
    • pp.103-108
    • /
    • 2024
  • Kakuro puzzles are NP-complete problems where no way to solve puzzles in polynomial time is known. Until now, a brute-force search method or a linear programming method has been applied to substitute all possible cases. This paper finds a magic rule, a rule for box sizes and unfilled numbers according to sum clues. Based on the magic rule, numbers that cannot enter empty cells were deleted from the box for row and column sum clues. Next, numbers that cannot enter the box were deleted based on the sum clue value. Finally, cells with only a single number were confirmed as clues. As a result of applying the proposed algorithm to seven benchmarking experimental data, it was shown that solutions could be obtained for all problems.

Feasibility study of a novel hash algorithm-based neutron activation analysis system for arms control treaty verification

  • Xiao-Suo He;Yao-Dong Dai;Xiao-Tao He;Qing-Hua He
    • Nuclear Engineering and Technology
    • /
    • v.56 no.4
    • /
    • pp.1330-1338
    • /
    • 2024
  • Information on isotopic composition and geometric structure is necessary for identifying a true warhead. Nevertheless, such classified information should be protected physically or electronically. With a novel Hash encryption algorithm, this paper presents a Monte Carlo-based design of a neutron activation analysis verification module. The verification module employs a thermal neutron source, a non-uniform mask (physically encrypting information about isotopic composition and geometric structure), a gamma detector array, and a Hash encryption algorithm (for electronic encryption). In the physical field, a non-uniform mask is designed to distort the characteristic gamma rays emitted by the inspected item. Furthermore, as part of the Hash algorithm, a key is introduced to encrypt the data and improve the system resolution through electronic design. In order to quantify the difference between items, Hamming distance is used, which allows data encryption and analysis simultaneously. Simulated inspections of simple objects are used to quantify system performance. It is demonstrated that the method retains superior resolution even with 1% noise level. And the performances of anti-statistical attack and anti-brute force cracking are evaluated and found to be very excellent. The verification method lays a solid foundation for nuclear disarmament verification in the upcoming era.

Design and Implementation of User Authentication System Using USIM Information (USIM 정보를 이용한 사용자 인증 방안 설계 및 구현)

  • Lee, Jin-Woo;Kim, Seon-Joo;Jo, In-June
    • The Journal of the Korea Contents Association
    • /
    • v.17 no.7
    • /
    • pp.571-578
    • /
    • 2017
  • In order to approach information system through smart device and pc, user has to authenticate him or herself via user authentication. At that time when user tries reaching the system, well-used user authentication technologies are ID/PW base, OTP, certificate, security card, fingerprint, etc. The ID/PWbased method is familiar to users, however, it is vulnerable to brute force cracking, keylogging, dictionary attack. so as to protect these attacks, user has to change the passwords periodically as per password combination instructions. In this paper, we designed and implemented a user authentication system using smartphone's USIM without using password while enhancing security than existing ID / PW based authentication technology.

CNN-based Fast Split Mode Decision Algorithm for Versatile Video Coding (VVC) Inter Prediction

  • Yeo, Woon-Ha;Kim, Byung-Gyu
    • Journal of Multimedia Information System
    • /
    • v.8 no.3
    • /
    • pp.147-158
    • /
    • 2021
  • Versatile Video Coding (VVC) is the latest video coding standard developed by Joint Video Exploration Team (JVET). In VVC, the quadtree plus multi-type tree (QT+MTT) structure of coding unit (CU) partition is adopted, and its computational complexity is considerably high due to the brute-force search for recursive rate-distortion (RD) optimization. In this paper, we aim to reduce the time complexity of inter-picture prediction mode since the inter prediction accounts for a large portion of the total encoding time. The problem can be defined as classifying the split mode of each CU. To classify the split mode effectively, a novel convolutional neural network (CNN) called multi-level tree (MLT-CNN) architecture is introduced. For boosting classification performance, we utilize additional information including inter-picture information while training the CNN. The overall algorithm including the MLT-CNN inference process is implemented on VVC Test Model (VTM) 11.0. The CUs of size 128×128 can be the inputs of the CNN. The sequences are encoded at the random access (RA) configuration with five QP values {22, 27, 32, 37, 42}. The experimental results show that the proposed algorithm can reduce the computational complexity by 11.53% on average, and 26.14% for the maximum with an average 1.01% of the increase in Bjøntegaard delta bit rate (BDBR). Especially, the proposed method shows higher performance on the sequences of the A and B classes, reducing 9.81%~26.14% of encoding time with 0.95%~3.28% of the BDBR increase.

A methodology for uncertainty quantification and sensitivity analysis for responses subject to Monte Carlo uncertainty with application to fuel plate characteristics in the ATRC

  • Price, Dean;Maile, Andrew;Peterson-Droogh, Joshua;Blight, Derreck
    • Nuclear Engineering and Technology
    • /
    • v.54 no.3
    • /
    • pp.790-802
    • /
    • 2022
  • Large-scale reactor simulation often requires the use of Monte Carlo calculation techniques to estimate important reactor parameters. One drawback of these Monte Carlo calculation techniques is they inevitably result in some uncertainty in calculated quantities. The present study includes parametric uncertainty quantification (UQ) and sensitivity analysis (SA) on the Advanced Test Reactor Critical (ATRC) facility housed at Idaho National Laboratory (INL) and addresses some complications due to Monte Carlo uncertainty when performing these analyses. This approach for UQ/SA includes consideration of Monte Carlo code uncertainty in computed sensitivities, consideration of uncertainty from directly measured parameters and a comparison of results obtained from brute-force Monte Carlo UQ versus UQ obtained from a surrogate model. These methodologies are applied to the uncertainty and sensitivity of keff for two sets of uncertain parameters involving fuel plate geometry and fuel plate composition. Results indicate that the less computationally-expensive method for uncertainty quantification involving a linear surrogate model provides accurate estimations for keff uncertainty and the Monte Carlo uncertainty in calculated keff values can have a large effect on computed linear model parameters for parameters with low influence on keff.

Optimal Implementation of Lightweight Block Cipher PIPO on CUDA GPGPU (CUDA GPGPU 상에서 경량 블록 암호 PIPO의 최적 구현)

  • Kim, Hyun-Jun;Eum, Si-Woo;Seo, Hwa-Jeong
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.32 no.6
    • /
    • pp.1035-1043
    • /
    • 2022
  • With the spread of the Internet of Things (IoT), cloud computing, and big data, the need for high-speed encryption for applications is emerging. GPU optimization can be used to validate cryptographic analysis results or reduced versions theoretically obtained by the GPU in a reasonable time. In this paper, PIPO lightweight encryption implemented in various environments was implemented on GPU. Optimally implemented considering the brute force attack on PIPO. In particular, the optimization implementation applying the bit slicing technique and the GPU elements were used as much as possible. As a result, the implementation of the proposed method showed a throughput of about 19.5 billion per second in the RTX 3060 environment, achieving a throughput of about 122 times higher than that of the previous study.

On-the-fly Estimation Strategy for Uncertainty Propagation in Two-Step Monte Carlo Calculation for Residual Radiation Analysis

  • Han, Gi Young;Kim, Do Hyun;Shin, Chang Ho;Kim, Song Hyun;Seo, Bo Kyun;Sun, Gwang Min
    • Nuclear Engineering and Technology
    • /
    • v.48 no.3
    • /
    • pp.765-772
    • /
    • 2016
  • In analyzing residual radiation, researchers generally use a two-step Monte Carlo (MC) simulation. The first step (MC1) simulates neutron transport, and the second step (MC2) transports the decay photons emitted from the activated materials. In this process, the stochastic uncertainty estimated by the MC2 appears only as a final result, but it is underestimated because the stochastic error generated in MC1 cannot be directly included in MC2. Hence, estimating the true stochastic uncertainty requires quantifying the propagation degree of the stochastic error in MC1. The brute force technique is a straightforward method to estimate the true uncertainty. However, it is a costly method to obtain reliable results. Another method, called the adjoint-based method, can reduce the computational time needed to evaluate the true uncertainty; however, there are limitations. To address those limitations, we propose a new strategy to estimate uncertainty propagation without any additional calculations in two-step MC simulations. To verify the proposed method, we applied it to activation benchmark problems and compared the results with those of previous methods. The results show that the proposed method increases the applicability and user-friendliness preserving accuracy in quantifying uncertainty propagation. We expect that the proposed strategy will contribute to efficient and accurate two-step MC calculations.

An Improved Method for Phenology Model Parameterization Using Sequential Optimization (순차적인 최적화 기법에 의한 생물계절모형 모수추정 방식 개선)

  • Yun, Kyungdahm;Kim, Soo-Hyung
    • Korean Journal of Agricultural and Forest Meteorology
    • /
    • v.16 no.4
    • /
    • pp.304-308
    • /
    • 2014
  • Accurate prediction of peak bloom dates (PBD) of flowering cherry trees is critical for organizing local cherry festivals and other associated cultural and economic activities. A two-step phenology model is commonly used for predicting flowering time depending on local temperatures as a result of two consecutive steps followed by chill and heat accumulations. However, an extensive computation requirement for parameter estimation has been a limitation for its practical use. We propose a sequential parameterization method by exploiting previously unused records of development stages. With an extra constraint formed by heat accumulation between two intervening stages, each parameter can then be solved sequentially in much shorter time than the brute-force method. The result was found to be almost identical to the previous solution known for cherry trees (Prunus ${\times}$ yedoensis) in the Tidal Basin, Washington D.C.