• Title/Summary/Keyword: discrete group

Search Result 244, Processing Time 0.025 seconds

On the Security of Cryptosystems Based on Imaginary Quadratic Class Semigroups (복소 이차 류 반군위에서의 암호계의 안전성에 관한 소고)

  • Kim, Yong-Tae
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.6 no.1
    • /
    • pp.90-96
    • /
    • 2011
  • In this paper, we propose a new discrete logarithm problem(DLP) based on the class semigroups of imaginary quadratic non-maximal orders using the special character of non-invertible ideal and analysis its security. To do this, we first explain the mathematical background explicitly and prove some properties of Cls (O) which relate to constructing the DLP and guaranteeing the security. To test the security of the proposed DLP, we compare the class number of the maximal order with that of the non-maximal order and investigate the unique factorization problems of ideals between class groups of the maximal orders and class semigroups of non-maximal orders to ensure the security of the cryptosystem.

ZERO-KNOWLEDGE GROUP IDENTIFICATION AND HIDDEN GROUP SIGNATURE FOR SMART CARDS USING BILINEAR PAIRINGS

  • Lee, Young Whan;Choi, Byung Mun
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.20 no.4
    • /
    • pp.355-366
    • /
    • 2007
  • In this paper, we propose a new blind group identification protocol and a hidden group signature protocol as its application. These protocols involve many provers and one verifier such that (1) the statement of all the provers are proved simultaneously, (2) and also all the provers using computationally limited devices (e.g. smart cards) have no need of computing the bilinear pairings, (3) but only the verifier uses the bilinear pairings. A. Saxena et al. proposed a two-round blind (group) identification protocol in 2005 using the bilinear pairings. But it reveals weakness in the active-intruder attack, and all the provers as well as the verifier must have devices computing bilinear pairings. Comparing their results, our protocol is secure from the active-intruder attack and has more fit for smart cards. In particular, it is secure under only the assumption of the hardness of the Discrete-Logarithm Problem in bilinear groups.

  • PDF

STRONG k-DEFORMATION RETRACT AND ITS APPLICATIONS

  • Han, Sang-Eon
    • Journal of the Korean Mathematical Society
    • /
    • v.44 no.6
    • /
    • pp.1479-1503
    • /
    • 2007
  • In this paper, we study a strong k-deformation retract derived from a relative k-homotopy and investigate its properties in relation to both a k-homotopic thinning and the k-fundamental group. Moreover, we show that the k-fundamental group of a wedge product of closed k-curves not k-contractible is a free group by the use of some properties of both a strong k-deformation retract and a digital covering. Finally, we write an algorithm for calculating the k-fundamental group of a dosed k-curve by the use of a k-homotopic thinning.

GALOIS CORRESPONDENCES FOR SUBFACTORS RELATED TO NORMAL SUBGROUPS

  • Lee, Jung-Rye
    • Communications of the Korean Mathematical Society
    • /
    • v.17 no.2
    • /
    • pp.253-260
    • /
    • 2002
  • For an outer action $\alpha$ of a finite group G on a factor M, it was proved that H is a, normal subgroup of G if and only if there exists a finite group F and an outer action $\beta$ of F on the crossed product algebra M $\times$$_{\alpha}$ G = (M $\times$$_{\alpha}$ F. We generalize this to infinite group actions. For an outer action $\alpha$ of a discrete group, we obtain a Galois correspondence for crossed product algebras related to normal subgroups. When $\alpha$ satisfies a certain condition, we also obtain a Galois correspondence for fixed point algebras. Furthermore, for a minimal action $\alpha$ of a compact group G and a closed normal subgroup H, we prove $M^{G}$ = ( $M^{H}$)$^{{beta}(G/H)}$for a minimal action $\beta$ of G/H on $M^{H}$.f G/H on $M^{H}$.TEX> H/.

Aggregate shape influence on the fracture behaviour of concrete

  • Azevedo, N.Monteiro;Lemos, J.V.
    • Structural Engineering and Mechanics
    • /
    • v.24 no.4
    • /
    • pp.411-427
    • /
    • 2006
  • The Discrete Element Method, DEM, is increasingly used in fracture studies of non-homogeneous continuous media, such as rock and concrete. A 2D circular rigid DEM formulation, developed to model concrete, has been adopted. A procedure developed to generate aggregate particles with a given aspect ratio and shape is presented. The aggregate particles are modelled with macroparticles formed by a group of circular particles that behave as a rigid body. Uniaxial tensile and compression tests performed with circular and non-circular aggregates, with a given aspect ratio, have shown similar values of fracture toughness when adopting uniform strength and elastic properties for all the contacts. Non-circular aggregate assemblies are shown to have higher fracture toughness when different strength and elastic properties are set for the matrix and for the aggregate/matrix contacts.

Kinetics and Mechanism of the Pyridinolysis of Diethyl Isothiocyanophosphate in Acetonitrile

  • Adhikary, Keshab Kumar;Lee, Hai-Whang
    • Bulletin of the Korean Chemical Society
    • /
    • v.33 no.3
    • /
    • pp.1042-1046
    • /
    • 2012
  • The kinetics and mechanism of the pyridinolysis ($XC_5H_4N$) of diethyl isothiocyanophosphate are investigated in acetonitrile at $55.0^{\circ}C$. The Hammett and Bronsted plots for substituent X variations in the nucleophiles exhibit the two discrete slopes with a break region between X = 3-Ac and 4-Ac. These are interpreted to indicate a mechanistic change at the break region from a concerted to a stepwise mechanism with rate-limiting expulsion of the isothiocyanate leaving group from a trigonal bipyramidal pentacoordinated intermediate. The relatively large ${\beta}_x$ values with more basic and less basic pyridines imply much greater fraction of frontside nucleophilic attack TSf than that of backside attack TSb.

Implementation of Visual Data Compressor for Vision Sensor of Mobile Robot (이동로봇의 시각센서를 위한 동영상 압축기 구현)

  • Kim Hyung O;Cho Kyoung Su;Baek Moon Yeal;Kee Chang Doo
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.22 no.9 s.174
    • /
    • pp.99-106
    • /
    • 2005
  • In recent years, vision sensors are widely used to mobile robot for navigation or exploration. The analog signal transmission of visual data being used in this area, however, has some disadvantages including noise weakness in view of the data storage. A large amount of data also makes it difficult to use this method for a mobile robot. In this paper, a digital data compressing technology based on MPEG4 which substitutes for analog technology is proposed to overcome the disadvantages by using DWT(Discreate Wavelet Transform) instead of DCT(Discreate Cosine Transform). The TI Company's DSP chip, TMS320C6711, is used for the image encoder, and the performance of the proposed method is evaluated by PSNR(Peake Signal to Noise Rates), QP(Quantization Parameter) and bitrate.

A Heuristic Derivation of the Waiting Time Distribution of a GI/G/1 Queue (GI/G/1 대기행렬 대기시간 분포의 새로운 유도방법)

  • Lim, Dae Eun;Kim, Bokeun;Kim, Nam K.;Chae, Kyung C.
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.40 no.1
    • /
    • pp.1-4
    • /
    • 2015
  • This paper presents a heuristic approach to derive the Laplace-Stieltjes transform (LST) and the probability generating function (PGF) of the waiting time distributions of a continuous- and a discrete-time GI/G/1 queue, respectively. This is a new idea to derive the well-known results, the waiting time distribution of GI/G/1 queue, in a different way.

Robust Algorithm using SVD for Data Hiding in the Color Image against Various Attacks (특이값 분해를 이용한 다양한 이미지 변화에 강인한 정보 은닉 알고리즘)

  • Lee, Donghoon;Heo, Jun
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2011.07a
    • /
    • pp.28-30
    • /
    • 2011
  • 본 논문에서는 특이값 분해(Singular Value Decomposition)을 이용하여 이미지의 주파수 영역 내에 정보를 은닉하는 방법을 제시한다. 이미지를 주파수 영역으로 변환하기 위하여 블록 단위로 이산 코사인 변환(Discrete Cosine Transform)을 수행한다. 이후 인접한 네 블록의 DC 값들로 구성된 행렬의 특이값을 은닉하고자 하는 정보에 따라 변환한다. 원래의 DC 값은 정보에 따라 변환된 DC 값으로 대체되고 역 이산 코사인 변환(Inverse Discrete Cosine Transform)을 수행하여 정보가 은닉된 이미지를 얻는다. 제안하는 알고리즘의 성능을 분석하기 위해 JPEG(Joint Photographic Coding Experts Group), 선명화(Sharpening), 히스토그램 등화(Histogram Equalization)와 같이 다양한 이미지 변화를 거친 후, 은닉된 정보의 신뢰도를 비교한다.

  • PDF

GEOMETRIC CHARACTERIZATIONS OF CONCENTRATION POINTS FOR M$\"{O}$BIUS GROUPS

  • Sung Bok Hong;Jung Sook Sakong
    • Communications of the Korean Mathematical Society
    • /
    • v.9 no.4
    • /
    • pp.945-950
    • /
    • 1994
  • Although the study of the limit points of discrete groups of M$\ddot{o}$bius transformations has been a fertile area for many decades, there are some very natural topological properties of the limit points which appear not to have been previously examined. Let $\Gamma$ be a nonelementary discrete group of hyperbolic isometries acting on the Poincare disc $B^m, m \geq 2$, and let $p \in \partial B^m$ be a limit point of $\Gamma$. By a neighborhood of p, we will always mean an open neighborhood of p in $\partial B^m$.

  • PDF