• Convergence Security Journal
• /
• v.16 no.7
• /
• pp.85-91
• /
• 2016

Block cipher is one of the prominent and important elements in cryptographic systems and study on the minimal construction is a major theme in the cryptographic research. Even and Mansour motivated by the study suggested a kind of block cipher called the Even-Mansour scheme in the early 1990s. It is a very simple cipher with one permutation and two secret keys. There have been many studies on the Even-Mansour scheme and security analysis of the scheme. We explain the Even-Mansour scheme and simplify those attacks on the Even-Mansour scheme with mathematical language. Additionally, we show that Pollard's rho attack to the discrete logarithm problem can be used to attack the Even-Mansour scheme with the same complexity of the Pollard's rho attack.

• Language and Information
• /
• v.18 no.2
• /
• pp.123-140
• /
• 2014

The aim of this paper is twofold: to identify two types of even if concessive conditionals, standing-ifs and introduced-ifs (Bennett 1982) in terms of whether the truth of the consequent is 'entailed' (the consequent-entailment problem in terms of Lycan 2001); and to analyze these two types of concessive conditionals in a compositional way. Here we argue that, following Guerzoni and Lim (2007), even if conditionals can be analyzed as the cases where even gets its focus in conditionals. We also argue that the consequent-entailment problem can be accounted for in a compositional way if we identify the focus as well as the scope of even in conditionals correctly. We further argue that the analysis presented in this paper supports the scope theory of even, among two theories of even previously proposed in various works. We also consider the possibility where concessive conditionals without even can be analyzed as an extension of the analysis proposed in this paper.

• Journal of the Korean Mathematical Society
• /
• v.58 no.4
• /
• pp.849-871
• /
• 2021

A (positive definite integral) quadratic form is called even 2-universal if it represents all even quadratic forms of rank 2. In this article, we prove that there are at most 55 even 2-universal even quadratic forms of rank 5. The proofs of even 2-universalities of some candidates will be given so that exactly 20 candidates remain unproven.

• Korean Journal of English Language and Linguistics
• /
• v.2 no.3
• /
• pp.403-430
• /
• 2002

With a view to providing a unitary interpretation of a lexical item, even, this paper proposes that even be understood as a quantifier. To countenance this idea, the quantifier theories will be evaluated against the implicature accounts on the basis of conceptual and empirical evidence. With the help of Bach (1999), the quantifier theories of even are regarded as most viable and plausible. On the other hand, from among different quantifier approaches even will be viewed as a quasi-universal quantifier, which means that even is similar to the universal quantifier but still it is different from it. That is, even introduces a comparison set that is context-dependent and only the salient members of this comparison set will be taken into account when an even-sentence is to be uttered. This observation is based on the formal representation for a universal quantifier in general on the one hand and the truth-conditional contribution of even to the sentence containing it.

• Bulletin of the Korean Mathematical Society
• /
• v.60 no.4
• /
• pp.1017-1024
• /
• 2023

A celebrated result in the study of integer partitions is the identity due to Lehmer whereby the number of partitions of n with an even number of even parts minus the number of partitions of n with an odd number of even parts equals the number of partitions of n into distinct odd parts. Inspired by Lehmer's identity, we prove explicit formulas for evaluating generating functions for sequences that enumerate integer partitions of fixed width with an even/odd number of even parts. We introduce a technique for decomposing the even entries of a partition in such a way so as to evaluate, using a finite sum over q-binomial coefficients, the generating function for the sequence of partitions with an even number of even parts of fixed, odd width, and similarly for the other families of fixed-width partitions that we introduce.

• Convergence Security Journal
• /
• v.20 no.1
• /
• pp.9-14
• /
• 2020

There have been many papers on minimalism of cryptography. Secure minimal block cipher is one of these topics and Even and Mansour suggested a simple block cipher. The Even-Mansour scheme is a block cipher with one permutation and two whitening keys. Studying related to the Even-Mansour scheme gives great insight into the security and design of block cipher. There have been suggested many trials to analyze the security of the Even-Mansour scheme and variants of the Even-Mansour scheme. We present a new variant of the Even-Mansour scheme and introduce a variant of the Even-Mansour scheme. We focus on the security of these variants of the Even-Mansour scheme and present variation of the security according to key size. We prove the security of a variant of the Even-Mansour scheme and show that a generalized Even-Mansour scheme is not proper for a minimal block cipher.

• Cross-Cultural Studies
• /
• v.39
• /
• pp.191-218
• /
• 2015

The purpose of this paper is the analysis of the origin meaning of Tungus, Evenki, Even. This is related with a close examination of origin of the Tungus, Evenki, Even. Etymology of Tungus is realited with the ancient peoples Dongho of China, a etymology of Evenki is realited with the ancient peoples Ohwan of China. Even is made by omitting the suffix -ki in Evenki. In addition, in Evenki and Even have variety names for themselves. There are reflect the difference in a residential area and lifestyle. The Evenki's endonyms are birary, manegry, kilen, hamnigan, solon, ongkory, dunkan, ljamter, donki, ojvenki, orochon, ile, mata, hundysal. The Even's endonyms are yvyn, even, evun, lamut, oroch, mene, dondydkil, dudke.

• Journal of Industrial Convergence
• /
• v.19 no.4
• /
• pp.23-28
• /
• 2021

This paper finds the regular pattern of n = [3, ∞] for Euler square game related with n = 6(6×6=36) thirty-six officer problem that is still unsolved problem. The solution of this problem is exists for n = [3, 10] without n = 6. Also, previous researchers finds the random assigned solution for specific number using computer programming. Therefore, the solution of n = [11, ∞] Euler squares are unsolved problem because of anything but easy. This paper attempts to find generalized patterns for domains that have been extended to n = [3, ∞], while existing studies have been limited to n = [3, 10]. This paper classify the n = [3, ∞] into n = odd, 4k even, 4k+2 even of three classes. Then we find the simple regular pattern solution for n = odd and 4k even(n/2 = even). But we can't find the regular pattern for 4k+2 even(n/2 = odd).

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.17 no.3
• /
• pp.35-42
• /
• 2007

We describe the problem of reducing the key material in the Even-Mansour cipher without security degradation. Even and Mansour proposed a block cipher based on XORing secret key material just prior to and after applying random oracle permutation P such that $C=k_2\bigoplus P(M\bigoplus k_1)$. Recently, Gentry and Ramzan showed that this scheme in the random permutation oracle can be replaced by the four-round Feistel network construction in the random function oracle and also proved that their scheme is super-pseudorandom. In this paper we reduce the key size from 2n to n, which is the optimal key size of Even-Mansour cipher in the random function oracle model and also give almost the same level of security.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.2
• /
• pp.514-525
• /
• 1996

In this paper, Push-push Osciplier(Oscillator + Multiplier) has been analyzed by even-odd mode analysis method. A 10GHz DRO, an Osciplier using 10GHz DRO design method and an Osciplier using even-odd mode analysis method were designed, fabricated and tested to verify this method. The measured results verified the validity of the analysis method using even-odd mode analysis.