• Title/Summary/Keyword: block data

Search Result 2,691, Processing Time 0.027 seconds

Safety Comparison Analysis Against Known/Chosen Plaintext Attack of RBF (Random Block Feedback) Mode to Other Block Cipher Modes of Operation (블록 암호 연산 모드 RBF(Random Block Feedback)의 알려진/선택 평문 공격에 대한 안전성 비교 분석)

  • Kim, Yoonjeong;Yi, Kang
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39B no.5
    • /
    • pp.317-322
    • /
    • 2014
  • Data security and integrity is a critical issue in data transmission over wired/wireless links. A large amount of data is encrypted before transmission, by block cipher using mode of operation. RBF mode is a block cipher mode of operation which uses random characteristics. In this paper, we analyze the safety against known plaintext attack and chosen plaintext attack of RBF mode compared to the traditional modes. According to the analysis, RBF mode is known to be secure while the traditional modes are not secure against them.

Mutual exclusion of shared memory access in the simulation software of the midclass commuter (중형항공기 시뮬레이션 소프트웨어의 작업간 공유메모리 사용의 상호배제)

  • 이인석;이해창;이상혁
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1996.10b
    • /
    • pp.207-209
    • /
    • 1996
  • The software of the midclass commuter flight simulation is running on multiprocessor/multitasking environments The software is consist of tasks which are periodically alive at a given interval. Each task communicates via shared memory. The data shared by tasks is divided by several block. Only one task, called producer, can produce data for a data block but several tasks, called consumers, can read data from the data block. Double buffer and conditional flag are used to implement a mutual exclusion which prevents the producer and consumers from accessing the same data block simultaneously.

  • PDF

Necessity of Safety Management System applying Big Data and Block Chain Technology (블록체인 기술과 빅데이터 기술을 적용한 안전 관리 시스템의 필요성)

  • Oh, Weon-Kyun;Kim, Ki-Hyuk;Lee, Donghoon
    • Proceedings of the Korean Institute of Building Construction Conference
    • /
    • 2019.11a
    • /
    • pp.197-198
    • /
    • 2019
  • In this study, the study was conducted to derive the utility of the safety management system applying block chain technology and big data technology to improve the problems of construction sites where concealment and operation of safety accidents occur. If block chain technology and big data technology are applied to construction safety management, transparent data can be collected, and based on the collected data, it is possible to predict accidents that can occur at the construction site and establish countermeasures. It can also be an opportunity to strengthen the safety awareness of construction workers and managers, and can clearly identify the responsibility in the event of a safety accident. This study suggests that the application of the 4th Industrial Revolution technology could be a great opportunity to innovate the construction industry which is less than other industries.

  • PDF

A Multimedia Data Prefetching Based on 2 Dimensional Block Structure (이차원 블록 구조에 근거한 선인출 기법)

  • Kim, Seok-Ju
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.8
    • /
    • pp.1086-1096
    • /
    • 2004
  • In case of a multimedia application which deals with streaming data, in terms of cache management, cache loses its efficiency due to weak temporal locality of the data. This means that when data have been brought into cache, much of the data are supposed to be replaced without being accessed again during its service. However, there is a good chance that such multimedia data has a commanding locality in it. In this paper, to take advantage of the memory reference regularity which typically innates even in the multimedia data showing up its weak temporal locality, a method is suggested. The suggested method with the feature of dynamic regular-stride reference prefetching can identify for 2-dimensional array format(block pattern). The suggested method is named as block-reference-prediction-technique (BRPT) since it identifies a block pattern and place an address to be prefetched by the regulation of the block format. BRPT proved to be reassuring to reduce memory reference time significantly for applications having abundant block patterns although new rule has complicated the prefetching system even further.

  • PDF

A Rapid Locating Protocol of Corrupted Data for Cloud Data Storage

  • Xu, Guangwei;Yang, Yanbin;Yan, Cairong;Gan, Yanglan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.10
    • /
    • pp.4703-4723
    • /
    • 2016
  • The verification of data integrity is an urgent topic in remote data storage environments with the wide deployment of cloud data storage services. Many traditional verification algorithms focus on the block-oriented verification to resolve the dispute of dynamic data integrity between the data owners and the storage service providers. However, these algorithms scarcely pay attention to the data verification charge and the users' verification experience. The users more concern about the availability of accessed files rather than data blocks. Moreover, the data verification charge limits the number of checked data in each verification. Therefore, we propose a mixed verification protocol to verify the data integrity, which rapidly locates the corrupted files by the file-oriented verification, and then identifies the corrupted blocks in these files by the block-oriented verification. Theoretical analysis and simulation results demonstrate that the protocol reduces the cost of the metadata computation and transmission relative to the traditional block-oriented verification at the expense of little cost of additional file-oriented metadata computation and storage at the data owner. Both the opportunity of data extracted and the scope of suspicious data are optimized to improve the verification efficiency under the same verification cost.

A linear systolic array based architecture for full-search block matching motion estimator (선형 시스토릭 어레이를 이용한 완전탐색 블럭정합 이동 예측기의 구조)

  • 김기현;이기철
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.2
    • /
    • pp.313-325
    • /
    • 1996
  • This paper presents a new architecture for full-search block-matching motion estimation. The architecture is based on linear systolic arrays. High speed operation is obtained by feeding reference data, search data, and control signals into the linear systolic array in a pipelined fashion. Input data are fed into the linear systolic array at a half of the processor speed, reducing the required data bandwidth to half. The proposed architecture has a good scalability with respect to the number of processors and input bandwidth when the size of reference block and search range change.

  • PDF

An efficient parallel solution algorithm on the linear second-order partial differential equations with large sparse matrix being based on the block cyclic reduction technique (Block Cyclic Reduction 기법에 의한 대형 Sparse Matrix 선형 2계편미분방정식의 효율적인 병렬 해 알고리즘)

  • 이병홍;김정선
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.15 no.7
    • /
    • pp.553-564
    • /
    • 1990
  • The co-efficient matrix of linear second-order partial differential equations in the general form is partitioned with (n-1)x(n-1) submartices and is transformed into the block tridiagonal system. Then the cyclic odd-even reduction technique is applied to this system with the large-grain data granularity and the block cyclic reduction algorithm to solve unknown vectors of this system is created. But this block cyclic reduction technique is not suitable for the parallel processing system because of its parallelism chanigng at every computing stages. So a new algorithm for solving linear second-order partical differential equations is presentes by the block cyclic reduction technique which is modified in order to keep its parallelism constant, and to reduce gteatly its execution time. Both of these algoriths are compared and studied.

  • PDF

Impact of Building Blocks on Inundation Level in Urban Drainage Area (지표 건물이 도시유역의 침수특성에 미치는 영향)

  • Lee, Jeong-Young;Ha, Sung-Ryong
    • Journal of Environmental Impact Assessment
    • /
    • v.22 no.1
    • /
    • pp.99-107
    • /
    • 2013
  • This study is an impact assessment of building blocks on urban inundation depth and area. LiDAR data is used to generate two original data set in terms of DEM with $5{\times}5$ meter and building block elevation layer of the study drainage area in Cheongju and then the building block elevation layer is modified again to the mesh data with same size to DEM. Two-dimensional inundation analysis is carried out by applying 2D SWMM model. The inundation depth calculated by using the building block elevation layer shows higher reliability than the DEM. This is resulted from the building block interference to surface flow. In addition, the maximum flooded area by DEM is two times wider than the area by building block layer. In the case of the surface velocity, the difference of velocity is negligible in either DEM or building block case in the low building impact zone. However, If the impact of building on the surface velocity was increase, the gap of velocity was significant.

Design of Personal Career Records Management and Duistribution using Block Chain (블록체인을 활용한 개인 경력 관리 및 유통 시스템 설계)

  • Bae, Su-Hwan;Shin, Yong-Tae
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.13 no.3
    • /
    • pp.235-242
    • /
    • 2020
  • This paper proposes a system that can manage and verify personal career information through a block chain to solve the problem of getting a job by forging an individual's career when hiring employees. Blockchain network uses private network, and inside the block, the user's academic and career information is kept. The functions of the block chain perform the functions of block creation, block internal data retrieval, career and academic verification, which works through chain code. As a result of the performance evaluation of the proposed system, the processing time per transaction was measured at approximately 110 ms and the search time was measured at 10 ms, and it was applied to the actual system to confirm that it was available.

모바일 오피스 서비스 지원을 위한 ADSRC 패킷 통신 시스템

  • Lee, Hyun;An, Dong-Hyun;Shin, Chang-Sub;Im, Chun-Sik;Park, Se-Ho;Cho, Kyung-Rok
    • Information and Communications Magazine
    • /
    • v.19 no.9
    • /
    • pp.77-85
    • /
    • 2002
  • In this paper, we introduce an ADSRC(hdvanced DSRC) OFDM packet communication system which has been developed by ETRI. The ADSRC system is targeted to provide high terminal mobility, high data rate and seamless service in roadside environment for mobile office services. We discuss the requirements of the ADSRC communication system for mobile office services, and the system design specification to meet them with regard to air interface. The ADSRC packet communication systems consist of the MAC processor block, the OFDM packet modem block and the RF block. The MAC processor block handles medium access control and the test. The OFDM packet modem transmits data packets at up to 24Mbps adaptively and recovers the data from RF block. We describe the ADSRC packet communication system architecture and the ADSRC system protocol.