• Title/Summary/Keyword: key-code

Search Result 662, Processing Time 0.027 seconds

A tamper resistance software mechanism using MAC function and dynamic link key (MAC함수와 동적 링크키를 이용한 소프트웨어 변조 방지 기법)

  • Park, Jae-Hong;Kim, Sung-Hoon;Lee, Dong-Hoon
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.23 no.1
    • /
    • pp.11-18
    • /
    • 2013
  • In order to prevent tampering and reverse engineering of executive code, this paper propose a new tamper resistant software mechanism. This paper presents a cryptographic MAC function and a relationship which has its security level derived by the importance of code block instead of by merely getting the encryption and decryption key from the previous block. In this paper, we propose a cryptographic MAC function which generates a dynamic MAC function key instead of the hash function as written in many other papers. In addition, we also propose a relationships having high, medium and low security levels. If any block is determined to have a high security level then that block will be encrypted by the key generated by the related medium security level block. The low security block will be untouched due to efficiency considerations. The MAC function having this dynamic key and block relationship will make analyzing executive code more difficult.

An Analysis Code and a Planning Tool Based on a Key Element Index for Controlled Explosive Demolition

  • Isobe, Daigoro
    • International Journal of High-Rise Buildings
    • /
    • v.3 no.4
    • /
    • pp.243-254
    • /
    • 2014
  • In this study, a demolition analysis code using the adaptively shifted integration (ASI)-Gauss technique, which describes structural member fracture by shifting the numerical integration point to an appropriate position and simultaneously releasing the sectional forces in the element, is developed. The code was verified and validated by comparing the predicted results with those of several experiments. A demolition planning tool utilizing the concept of a key element index, which explicitly indicates the contribution of each structural column to the vertical load capacity of the structure, is also develped. Two methods of selecting specific columns to efficiently demolish the whole structure are demonstrated: selecting the columns from the largest index value and from the smallest index value. The demolition results are confirmed numerically by conducting collapse analyses using the ASI-Gauss technique. The numerical results suggest that to achieve a successful demolition, a group of columns with the largest key element index values should be selected when explosives are ignited in a simultaneous blast, whereas those with the smallest should be selected when explosives are ignited in a sequence, with a final blast set on a column with large index value.

Development and validation of FRAT code for coated particle fuel failure analysis

  • Jian Li;Ding She;Lei Shi;Jun Sun
    • Nuclear Engineering and Technology
    • /
    • v.54 no.11
    • /
    • pp.4049-4061
    • /
    • 2022
  • TRISO-coated particle fuel is widely used in high temperature gas cooled reactors and other advanced reactors. The performance of coated fuel particle is one of the fundamental bases of reactor safety. The failure probability of coated fuel particle should be evaluated and determined through suitable fuel performance models and methods during normal and accident condition. In order to better facilitate the design of coated particle fuel, a new TRISO fuel performance code named FRAT (Fission product Release Analysis Tool) was developed. FRAT is designed to calculate internal gas pressure, mechanical stress and failure probability of a coated fuel particle. In this paper, FRAT was introduced and benchmarked against IAEA CRP-6 benchmark cases for coated particle failure analysis. FRAT's results agree well with benchmark values, showing the correctness and satisfactory applicability. This work helps to provide a foundation for the credible application of FRAT.

PROMISE: A QR Code PROjection Matrix Based Framework for Information Hiding Using Image SEgmentation

  • Yixiang Fang;Kai Tu;Kai Wu;Yi Peng;Yunqing Shi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.2
    • /
    • pp.471-485
    • /
    • 2023
  • As data sharing increases explosively, such information encoded in QR code is completely public as private messages are not securely protected. This paper proposes a new 'PROMISE' framework for hiding information based on the QR code projection matrix by using image segmentation without modifying the essential QR code characteristics. Projection matrix mapping, matrix scrambling, fusion image segmentation and steganography with SEL(secret embedding logic) are part of the PROMISE framework. The QR code could be mapped to determine the segmentation site of the fusion image as a binary information matrix. To further protect the site information, matrix scrambling could be adopted after the mapping phase. Image segmentation is then performed on the fusion image and the SEL module is applied to embed the secret message into the fusion image. Matrix transformation and SEL parameters should be uploaded to the server as the secret key for authorized users to decode the private message. And it was possible to further obtain the private message hidden by the framework we proposed. Experimental findings show that when compared to some traditional information hiding methods, better anti-detection performance, greater secret key space and lower complexity could be obtained in our work.

An Approach to Estimation of Radiological Source Term for a Severe Nuclear Accident using MELCOR code (MELCOR 코드를 이용한 원자력발전소 중대사고 방사선원항 평가 방법)

  • Han, Seok-Jung;Kim, Tae-Woon;Ahn, Kwang-Il
    • Journal of the Korean Society of Safety
    • /
    • v.27 no.6
    • /
    • pp.192-204
    • /
    • 2012
  • For a severe accident of nuclear power plant, an approach to estimation of the radiological source term using a severe accident code(MELCOR) has been proposed. Although the MELCOR code has a capability to estimate the radiological source term, it has been hardly utilized for the radiological consequence analysis mainly due to a lack of understanding on the relevant function employed in MELCOR and severe accident phenomena. In order to estimate the severe accident source term to be linked with the radiological consequence analysis, this study proposes 4-step procedure: (1) selection of plant condition leading to a severe accident(i.e., accident sequence), (2) analysis of the relevant severe accident code, (3) investigation of the code analysis results and post-processing, and (4) generation of radiological source term information for the consequence analysis. The feasibility study of the present approach to an early containment failure sequence caused by a fast station blackout(SBO) of a reference plant (OPR-1000), showed that while the MELCOR code has an integrated capability for severe accident and source term analysis, it has a large degree of uncertainty in quantifying the radiological source term. Key insights obtained from the present study were: (1) key parameters employed in a typical code for the consequence analysis(i.e., MACCS) could be generated by MELCOR code; (2) the MELOCR code simulation for an assessment of the selected accident sequence has a large degree of uncertainty in determining the accident scenario and severe accident phenomena; and (3) the generation of source term information for the consequence analysis relies on an expert opinion in both areas of severe accident analysis and consequence analysis. Nevertheless, the MELCOR code had a great advantage in estimating the radiological source term such as reflection of the current state of art in the area of severe accident and radiological source term.

A BLOCK CRYPTOGRAPHIC ALGORITHM BASED ON A PRIME CODE (소수 코드를 이용한 블록 암호화 알고리즘)

  • 송문빈;오재곤;정연모
    • Proceedings of the IEEK Conference
    • /
    • 2000.11b
    • /
    • pp.136-139
    • /
    • 2000
  • In this paper, we propose a prime code and a new cryptographic algorithm for encryption and decryption as its application. The characteristics of prime numbers with irregular distribution and uniqueness are used to generate the prime code. Based on the prime code, an encryption algorithm for secret key is presented. Since the algorithm requires simpler operations than existing encryption such as DES, the burden for hardware implementation of the encryption and decryption process is alleviated.

  • PDF

New Byzantine Resilient Multi-Path Key Establishment Scheme for Wireless Sensor Networks (무선 센서 네트워크를 위한 비잔틴 공격에 강인한 새로운 다중 패스 키 설정 방법)

  • Kim, Young-Sik;Jang, Ji-Woong;Lim, Dae-Woon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.9C
    • /
    • pp.855-862
    • /
    • 2009
  • The path key establishment phase in the wireless sensor network is vulnerable to Byzantine attack. Huang and Hedhi proposed a Byzantine resilient multi-key establishment scheme using a systematic RS code, which has shortcomings of exposing a part of message symbols and inefficient transmission. In this paper, we propose a new Byzantine resilient multi-path key establishment scheme in which direct message symbols are not exposed to an adversary and are more efficiently transmitted the RS-encoded symbols to the destination node. In the Proposed scheme, a non-systematic RS code is used to transmit a generated indirect secret key and each encoded symbol is relayed through available paths between two sensor nodes. If enough symbols are collected at the destination node, it is possible to reconstruct the secret message through RS decoding.

Study on the mixing performance of mixing vane grids and mixing coefficient by CFD and subchannel analysis code in a 5×5 rod bundle

  • Bin Han ;Xiaoliang Zhu;Bao-Wen Yang;Aiguo Liu;Yanyan Xi ;Lei Liu ;Shenghui Liu;Junlin Huang
    • Nuclear Engineering and Technology
    • /
    • v.55 no.10
    • /
    • pp.3775-3786
    • /
    • 2023
  • Mixing Vane Grid (MVG) is one of the most important structures in fuel assembly due to its high performance in mixing the coolant and ultimately increasing Critical Heat Flux (CHF), which avoids the temperature rising suddenly of fuel rods. To evaluate the mixing performance of the MVG, a Total Diffusion Coefficient (TDC) mixing coefficient is defined in the subchannel analysis code. Conventionally, the TDC of the spacer grid is obtained from the combination of experiments and subchannel analysis. However, the processing of obtaining and determine a reasonable TDC is much challenging, it is affected by boundary conditions and MVG geometries. In is difficult to perform all the large and costing rod bundle tests. In this paper, the CFD method was applied in TDC analysis. A typical 5 × 5 MVG was simulated and validated to estimate the mixing performance of the MVG. The subchannel code was used to calculate the TDC. Firstly, the CFD method was validated from the aspect of pressure drop and lateral temperature distribution in the subchannels. Then the effect of boundary conditions including the inlet temperature, inlet velocities, heat flux ratio between hot and cold rods and the arrangement of hot and cold rods on MVG mixing and TDC were studied. The geometric effects on mixing are also carried out in this paper. The effect of vane pattern on mixing was investigated to determine which one is the best to represent the grid's mixing performance.

Flow blockage analysis for fuel assembly in a lead-based fast reactor

  • Wang, Chenglong;Wu, Di;Gui, Minyang;Cai, Rong;Zhu, Dahuan;Zhang, Dalin;Tian, Wenxi;Qiu, Suizheng;Su, G.H.
    • Nuclear Engineering and Technology
    • /
    • v.53 no.10
    • /
    • pp.3217-3228
    • /
    • 2021
  • Flow blockage of the fuel assembly in the lead-based fast reactor (LFR) may produce critical local spots, which will result in cladding failure and threaten reactor safety. In this study, the flow blockage characteristics were analyzed with the sub-channel analysis method, and the circumferentially-varied method was employed for considering the non-uniform distribution of circumferential temperature. The developed sub-channel analysis code SACOS-PB was validated by a heat transfer experiment in a blocked 19-rod bundle cooled by lead-bismuth eutectic. The deviations between the predicted coolant temperature and experimental values are within ±5%, including small and large flow blockage scenarios. And the temperature distributions of the fuel rod could be better simulated by the circumferentially-varied method for the small blockage scenario. Based on the validated code, the analysis of blockage characteristics was conducted. It could be seen from the temperature and flow distributions that a large blockage accident is more destructive compared with a small one. The sensitivity analysis shows that the closer the blockage location is to the exit, the more dangerous the accident is. Similarly, a larger blockage length will lead to a more serious case. And a higher exit temperature will be generated resulting from a higher peak coolant temperature of the blocked region. This work could provide a reference for the future design and development of the LFR.

EPfuzzer: Improving Hybrid Fuzzing with Hardest-to-reach Branch Prioritization

  • Wang, Yunchao;Wu, Zehui;Wei, Qiang;Wang, Qingxian
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.9
    • /
    • pp.3885-3906
    • /
    • 2020
  • Hybrid fuzzing which combines fuzzing and concolic execution, has proved its ability to achieve higher code coverage and therefore find more bugs. However, current hybrid fuzzers usually suffer from inefficiency and poor scalability when applied to complex, real-world program testing. We observed that the performance bottleneck is the inefficient cooperation between the fuzzer and concolic executor and the slow symbolic emulation. In this paper, we propose a novel solution named EPfuzzer to improve hybrid fuzzing. EPfuzzer implements two key ideas: 1) only the hardest-to-reach branch will be prioritized for concolic execution to avoid generating uninteresting inputs; and 2) only input bytes relevant to the target branch to be flipped will be symbolized to reduce the overhead of the symbolic emulation. With these optimizations, EPfuzzer can be efficiently targeted to the hardest-to-reach branch. We evaluated EPfuzzer with three sets of programs: five real-world applications and two popular benchmarks (LAVA-M and the Google Fuzzer Test Suite). The evaluation results showed that EPfuzzer was much more efficient and scalable than the state-of-the-art concolic execution engine (QSYM). EPfuzzer was able to find more bugs and achieve better code coverage. In addition, we discovered seven previously unknown security bugs in five real-world programs and reported them to the vendors.