• Journal of Korean Association for Spatial Structures
• /
• v.7 no.1 s.23
• /
• pp.45-53
• /
• 2007

Recently, high-rise base isolated building structures with shear keys are often constructed in Japan which frequently occurs earthquakes. High-rise buildings are less damaged because those buildings have longer natural period than md or low rise buildings. The shear key is device that prevents the base isolators operating by the wind loads not by the earthquake loads. In case of big base shear force acts on the shear keys by earthquake, this device is broken and base isolator is operated. Therefore, seismic intensities play a role in acting on the shear keys. If wind loads are hither than the earthquake loads, the shear keys designed by wind loads are not operated in earthquakes. So, the requirements of shear keys in high-rise base isolated building structures must be examined in Korea with moderate seismic legions. In this study shear keys are applied with 5 and 15 stories base isolated building structures and investigated their dynamic responses to original and 1/2 scale downed El Centre NS(1940) ground motions. The results show that the yield shear forces of the shear keys affect significantly the dynamic behavior of base isolated building structures

• Proceedings of the Earthquake Engineering Society of Korea Conference
• /
• 1998.10a
• /
• pp.120-127
• /
• 1998

This paper deals with the dynamic responses of the multi-span continuous bridge with longitudinal shear keys. It is motivated by a need to understand the effects of longitudinal shear keys which may be used for the reduction of the longitudinal seismic force in continuous bridges. The results show that (1) The force reduction of fixed pier is proportional to the ratio of gap size and elastic maximum displacement of the bridges without shear keys ; (2) The thermal movement has little effect on the response of the continuous bridges with shear keys. Also the simplified equation is proposed to calculate the maximum response of the continuous bridges with longitudinal shear keys. The equation requires only the elastic analysis results of the bridge and the gap size between superstructure and shear keys.

• Smart Structures and Systems
• /
• v.24 no.3
• /
• pp.345-360
• /
• 2019

The shear keys are set in a seismic isolation system to resist the long-term service loadings, and are cut off to isolate the earthquakes. This paper investigated the influence of shear keys on the seismic performance of a vertical spring-viscous damper-concave Coulomb friction isolation system by an incremental dynamic analysis (IDA) and a performance-based assessment. Results show that the cutting off process of shear keys should be simulated in a numerical analysis to accurately predict the seismic responses of isolation system. Ignoring the cutting off process of shear keys usually leads to untrue seismic responses in a numerical analysis, and many of them are unsafe for the design of isolated structure. And those errors will be increased by increasing the cutting off force of shear keys and decreasing the spring constant of shear keys, especially under a feeble earthquake. The viscous damping action postpones the cutting off time of shear keys during earthquakes, and reduces the seismic isolation efficiency. However, this point can be improved by increasing the spring constant of shear keys.

• Journal of Software Assessment and Valuation
• /
• v.16 no.1
• /
• pp.89-94
• /
• 2020

In this paper, we propose a software algorithm that can configure n-key roll-over that detects all keys without limitation on the number of pressed keys in the dynamic scanning detection of a keyboard composed of a matrix. The proposed algorithm uses the timer interrupt of the microcontroller for computer keyboard control, so that a constant and accurate detection interval can be obtained, and an accurate debounce time can be provided. In order to confirm the effectiveness of the proposed algorithm, a microcontroller was connected to a toy keyboard constructed in the form of a clavier and experiments were conducted. As a result of the experiment, it was confirmed that detection of all keys was performed accurately regardless of the number of keys pressed.

• Structural Engineering and Mechanics
• /
• v.64 no.2
• /
• pp.213-223
• /
• 2017

Bridges are lifeline and integral components of transportation system that are susceptible to seismic actions, their vulnerability assessment is essential for seismic risk assessment and mitigation. The vulnerability assessment of bridges common in Pakistan is very important as it is seismically very active region and the available code for the seismic design of bridges is obsolete. This research presents seismic vulnerability assessment of three real case simply supported multi-span reinforced concrete bridges commonly found in northern Pakistan, having one, two and three bents with circular piers. The vulnerability assessment is carried through the non-linear dynamic time history analyses for the derivation of fragility curves. Finite element based numerical models of the bridges were developed in MIDAS CIVIL (2015) and analyzed through with non-linear dynamic and incremental dynamic analyses, using a suite of bridge-specific natural spectrum compatible ground motion records. Seismic responses of shear key, bearing pad, expansion joint and pier components of each bridges were recorded during analysis and retrieved for performance based analysis. Fragility curves were developed for the bearing pads, shear key, expansion joint and pier of the bridges that first reach ultimate limit state. Dynamic analysis and the derived fragility curves show that ultimate limit state of bearing pads, shear keys and expansion joints of the bridges exceed first, followed by the piers ultimate limit state for all the three bridges. Mean collapse capacities computed for all the components indicated that bearing pads, expansion joints, and shear keys exceed the ultimate limit state at lowest seismic intensities.

• Journal of Information Processing Systems
• /
• v.6 no.3
• /
• pp.335-346
• /
• 2010

The present study investigates the difficulty of solving the mathematical problem, namely the DLP (Discrete Logarithm Problem) for ephemeral keys. The DLP is the basis for many public key cryptosystems. The ephemeral keys are used in such systems to ensure security. The DLP defined on a prime field $Z^*_p of random prime is considered in the present study. The most effective method to solve the DLP is the ICM (Index Calculus Method). In the present study, an efficient way of computing the DLP for ephemeral keys by using a new variant of the ICM when the factors of p-1 are known and small is proposed. The ICM has two steps, a pre-computation and an individual logarithm computation. The pre-computation step is to compute the logarithms of a subset of a group and the individual logarithm step is to find the DLP using the precomputed logarithms. Since the ephemeral keys are dynamic and change for every session, once the logarithms of a subset of a group are known, the DLP for the ephemeral key can be obtained using the individual logarithm step. Therefore, an efficient way of solving the individual logarithm step based on the newly proposed precomputation method is presented and the performance is analyzed using a comprehensive set of experiments. The ephemeral keys are also solved by using other methods, which are efficient on random primes, such as the Pohlig-Hellman method, the Van Oorschot method and the traditional individual logarithm step. The results are compared with the newly proposed individual logarithm step of the ICM. Also, the DLP of ephemeral keys used in a popular password key exchange protocol known as Chang and Chang are computed and reported to launch key recovery attack.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10c
• /
• pp.285-287
• /
• 1999

블록 암호알고리즘에 대한 기존의 연산 모드들(ECB 또는 CBC 등)은, 각 블록에 대하여 동일한 키로 암호화를 수행한다. 이것은 침입자가 한번의 암호 요청만을 수행하여 많은 수의 평문/암호문 쌍을 얻을 수 있게 함으로써 차분해독법 등의 공격에는 안전성을 제공하지 않는다. 본 논문에서는 블록 암호 알고리즘을 위한 새로운 모드를 제안하는데, 이 모드에서는 암호화되는 각각의 블록이 서로 다른 키로 암호화되도록 함으로써 블록의 개수가 많아짐에 따라 안전성 면에서 상당한 이득을 얻게 된다. 각 블록을 위한 서로 다른 키를 생성하는 것이 추가 연산을 필요로 하지만, 제안하는 모드를 DES에 적용한 TDK(a mode for DEA with unTraceable Dynamic Keys)의 수행 시간을 pentium과 sun sparc 상에서 측정해 본 결과 ECB 모드와 거의 유사함을 알 수 있었다.

• Proceedings of the SAREK Conference
• /
• 2008.06a
• /
• pp.177-183
• /
• 2008

For 10 kW-class Stirling engine using scroll expander and scroll compressor, considerations on thermal expansion of the fixed and orbiting scroll members of the scroll expander due to high gas temperature at the expander inlet has resulted in adopting of the keys between the fixed scroll and main frame for the fixed scroll side and spring type insertion between the orbiting scroll base plate and supporting holders for orbiting scroll side. Dynamic analysis on the fixed and orbiting scroll members and the shafts of the scroll expander showed that using of these devices for complying thermal expansion caused large variations of the forces acting on the fixed scroll keys and on the power transmitting shafts and also on the shaft bearings.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.7
• /
• pp.3608-3628
• /
• 2017

Several block cipher modes of operation have been proposed in the literature to protect sensitive information. However, different security analysis models have been presented for attacking them. The analysis indicated that most of the current modes of operation are vulnerable to several attacks such as known plaintext and chosen plaintext/cipher-text attacks. Therefore, this paper proposes a secure block cipher mode of operation to thwart such attacks. In general, the proposed mode combines one-time chain keys with each plaintext before its encryption. The challenge of the proposed mode is the generation of the chain keys. The proposed mode employs the logistic map together with a nonce to dynamically generate a unique set of chain keys for every plaintext. Utilizing the logistic map assures the dynamic behavior while employing the nonce guarantees the uniqueness of the chain keys even if the same message is encrypted again. In this way, the proposed mode called SPCBC can resist the most powerful attacks including the known plaintext and chosen plaintext/cipher-text attacks. In addition, the SPCBC mode improves encryption time performance through supporting parallelized implementation. Finally, the security analysis and experimental results demonstrate that the proposed mode is robust compared to the current modes of operation.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.11 no.4
• /
• pp.77-89
• /
• 2001

Recently, with the explosive growth of communication technologies, group oriented services such as teleconference and multi-player game are increasing. Access control to information is handled by secret communications with group keys shared among members, and efficient updating of group keys is vital to such secret communications of large and dynamic groups. In this paper, we employ (2,4)-tree as a key tree, which is one of height balanced trees, to reduce the number of key updates caused by join or leave of members. Especially, we use CBT(Core Based Tree) to gather network configurations of group members and reflect this information to key tree structure to update group keys efficiently when splitting or merging of subgroups occurs by network failure or recovery.