• Title/Summary/Keyword: A Boolean function

Search Result 76, Processing Time 0.031 seconds

ON SINGLE CYCLE T-FUNCTIONS GENERATED BY SOME ELEMENTS

  • Rhee, Min Surp
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.28 no.2
    • /
    • pp.331-343
    • /
    • 2015
  • Invertible transformations over n-bit words are essential ingredients in many cryptographic constructions. When n is large such invertible transformations are usually represented as a composition of simpler operations such as linear functions, S-P networks, Feistel structures and T-functions. Among them we study T-functions which are probably invertible transformations and are very useful in stream ciphers. In this paper we study the number of single cycle T-functions satisfying some conditions and characterize single cycle T-functions on $(\mathbb{Z}_2)^n$ generated by some elements in $(\mathbb{Z}_2)^{n-1}$.

GLOBAL AVALANCHE CRITREION FOR THE S-BOXES OF SEED

  • Rhee, Min-Surp;Kim, Wan-Soon;Kim, Yang-Su
    • Journal of applied mathematics & informatics
    • /
    • v.9 no.1
    • /
    • pp.303-310
    • /
    • 2002
  • The cyryptographic strength of a Feistel cipher depends strongly on the properties of its S-boxes, which are the strict avalanche criterion(SAC), the propagation criterion(PC) and GAC(the global avalanche criterion). In this paper global avalanche characteristics of S-boxes of the SEED are in-vestigated and compared to global avalanche characteristics of S-boxes of S-boxes of the Data Encryption Standard(DES).

A Test Algorithm for Data Processing Function of MC68000 ${\mu}$ P (MC68000 ${\mu}$ P의 데이터 처리기능에 관한 시험 알고리즘)

  • Kim, Jong Hoon;Ahn, Gwang Seon
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.23 no.2
    • /
    • pp.197-205
    • /
    • 1986
  • In this paper, we present an efficient test algorithm for data processing function of MC68000 \ulcorner. The test vector for functional testing is determined by stuck-at, coupling and transition fault for data storage and transfer. But for data manipulation it is determined by a boolean function of micro-operation. This test algorithm is composed of 3 parts, choosing optimum test instructions for maximizing fault coverage and minimizing test process time, deciding the test order for minimizing test ambiguity, and processing the actual test.

  • PDF

GLOBAL AVALANCHE CRITERION FOR THE S-BOXES OF DES

  • Kim, Wan-Soon;Kim, Yang-Su;Rhee, Min-Surp
    • The Pure and Applied Mathematics
    • /
    • v.8 no.2
    • /
    • pp.163-174
    • /
    • 2001
  • In this paper we modify two indicators related to the global avalanche criterion (GAC) and discuss their properties. Also, we apply the modified indicators to measure the GAC of S-boxes of DES.

  • PDF

Content Development by Combining Intelligent Tutoring and Game-based Learning (지능형 튜토링과 게임 기반 학습을 결합한 콘텐츠 개발)

  • Hong, Myoung-Pyo;Han, Ki-Tae;Lee, Eui-Hyeock;Choi, Yong-Suk
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.5
    • /
    • pp.601-605
    • /
    • 2010
  • In this paper, we propose a GBL(Game Based Learning) content of intelligent tutoring capability. The objective of our GBL content is to learn the Karnaugh Map which is generally used to simplify boolean functions. Our GBL content well-motivates learners with interesting game-based scenarios and also, through an intelligent tutoring module, gives learners adaptive feedbacks such as hints and explanations while maintaining learners' contextual immersion. Additionally, we identified significant improvement in terms of learning effectiveness by analyzing the test results of two (experimental and controlled) student groups learning the Karnaugh Map.

The design of digital circuit for chaotic composition map (혼돈합성맵의 디지털회로설계)

  • Park, Kwang-Hyeon;Seo, Yong-Won
    • Journal of Advanced Navigation Technology
    • /
    • v.17 no.6
    • /
    • pp.652-657
    • /
    • 2013
  • In this paper the design methode of a separated composition state machine based on the compositive map with two chaotic maps together and the result of that is proposed. The digital circuits of chaotic composition map for the use of chaotic binary stream generator are designed in this work. The discretized truth table of chaotic composition function which is composed of two chaotic functions - the saw tooth function and skewed logistic function - is made out, and also simplefied Boolean algebras of digital circuits are obtained as a mathematical model. Consequently, the digital circuits of the map for chaotic composition function are presented in this paper.

Analysis of 74181 Arithmetic Logic Units (74184 Arithmetic Logic Units의 분석)

  • Lee, Jae-Seok;Chung, Tae-Sang
    • Proceedings of the KIEE Conference
    • /
    • 2000.11d
    • /
    • pp.778-780
    • /
    • 2000
  • The 74181 is arithmetic logic units(ALU)/function generator. This circuit performs 16 binary arithmetic operations on two 4-bit words. And a full carry look-ahead scheme is made available in this device. The 74181 can also be utilized as a comparator. This circuit has been also designed to provide 16 possible functions of two Boolean variables without the use of external circuitry. This paper analyzes the function of the logic and the implementation adopted in the design of 74181. The understanding of the logic characteristics of this chip enables us to improve future applications.

  • PDF

Analysis of hash functions based on cellular automata (셀룰러 오토마타 기반 해쉬 함수 분석)

  • Jeong Kitae;Lee Jesang;Chang Donghoon;Sung Jaechul;Lee Sangjin
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.14 no.6
    • /
    • pp.111-123
    • /
    • 2004
  • A hash function is a function that takes bit strings of arbitrary length to bit string of fixed length. A cellular automata is a finite state machine and has the property of generating pseudorandom numbers efficiently by combinational logics of neighbour cells. In [1] and [7], hash functions based on cellular automata which can be implemented efficiently in hardware were proposed. In this paper, we show that we can find collisions of these hash functions with probability 0.46875 and 0.5 respectively.

온라인 목록 검색 행태에 관한 연구-LINNET 시스템의 Transaction log 분석을 중심으로-

  • 윤구호;심병규
    • Journal of Korean Library and Information Science Society
    • /
    • v.21
    • /
    • pp.253-289
    • /
    • 1994
  • The purpose of this study is about the search pattern of LINNET (Library Information Network System) OPAC users by transaction log, maintained by POSTECH(Pohang University of Science and Technology) Central Library, to provide feedback information of OPAC system design. The results of this study are as follows. First, for the period of this analysis, there were totally 11, 218 log-ins, 40, 627 transaction logs and 3.62 retrievals per a log-in. Title keyword was the most frequently used, but accession number, bibliographic control number or call number was very infrequently used. Second, 47.02% of OPAC, searches resulted in zero retrievals. Bibliographic control number was the least successful search. User displayed 2.01% full information and 64.27% local information per full information. Third, special or advanced retrieval features are very infrequently used. Only 22.67% of the searches used right truncation and 0.71% used the qualifier. Only 1 boolean operator was used in every 22 retrievals. The most frequently used operator is 'and (&)' with title keywords. But 'bibliographical control number (N) and accessionnumber (R) are not used at all with any operators. The causes of search failure are as follows. 1. The item was not used in the database. (15, 764 times : 79.42%). 2. The wrong search key was used. (3, 761 times : 18.95%) 3. The senseless string (garbage) was entered. (324 times : 1.63%) On the basis of these results, some recommendations are suggested to improve the search success rate as follows. First, a n.0, ppropriate user education and online help function let users retrieve LINNET OPAC more efficiently. Second, several corrections of retrieval software will decrease the search failure rate. Third, system offers right truncation by default to every search term. This methods will increase success rate but should considered carefully. By a n.0, pplying this method, the number of hit can be overnumbered, and system overhead can be occurred. Fourth, system offers special boolean operator by default to every keyword retrieval when user enters more than two words at a time. Fifth, system assists searchers to overcome the wrong typing of selecting key by automatic korean/english mode change.

  • PDF

Image Encryption using the chaos function and elementary matrix operations (혼돈함수와 기본 행렬 연산을 이용한 영상의 암호화)

  • Kim Tae-Sik
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.11 no.1
    • /
    • pp.29-37
    • /
    • 2006
  • Due to the spread of mobile communication with the development of computer network, nowadays various types of multimedia data play an important role in many areas such as entertainments, culture contents, e-commerce or medical science. But for the real application of these data, the security in the course of saving or transferring them through the public network should be assured. In this sense, many encryption algorithm have been developed and utilized. Nonetheless, most of them have focused on the text data. So they may not be suitable to the multimedia application because of their large size and real time constraint. In this paper, a chaotic map has been employed to create a symmetric stream type of encryption scheme which may be applied to the digital images with a large amounts of data. Then an efficient algebraic encryption algorithm based on the elementary operations of the Boolean matrix and image data characteristics.

  • PDF