• Title/Summary/Keyword: Prime

Search Result 3,023, Processing Time 0.028 seconds

Key Recovery Algorithm from Randomly-Given Bits of Multi-Prime RSA and Prime Power RSA (비트 일부로부터 Multi-Prime RSA와 Prime Power RSA의 개인키를 복구하는 알고리즘)

  • Baek, Yoo-Jin
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.26 no.6
    • /
    • pp.1401-1411
    • /
    • 2016
  • The Multi-Prime RSA and the Prime Power RSA are the variants of the RSA cryptosystem, where the Multi-Prime RSA uses the modulus $N=p_1p_2{\cdots}p_r$ for distinct primes $p_1,p_2,{\cdots},p_r$ (r>2) and the Prime Power RSA uses the modulus $N=p^rq$ for two distinct primes p, q and a positive integer r(>1). This paper analyzes the security of these systems by using the technique given by Heninger and Shacham. More specifically, this paper shows that if the $2-2^{1/r}$ random portion of bits of $p_1,p_2,{\cdots},p_r$ is given, then $N=p_1p_2{\cdots}p_r$ can be factorized in the expected polynomial time and if the $2-{\sqrt{2}}$ random fraction of bits of p, q is given, then $N=p^rq$ can be factorized in the expected polynomial time. The analysis is then validated with experimental results for $N=p_1p_2p_3$, $N=p^2q$ and $N=p^3q$.

k-PRIME CORDIAL GRAPHS

  • PONRAJ, R.;SINGH, RAJPAL;KALA, R.;NARAYANAN, S. SATHISH
    • Journal of applied mathematics & informatics
    • /
    • v.34 no.3_4
    • /
    • pp.227-237
    • /
    • 2016
  • In this paper we introduce a new graph labeling called k-prime cordial labeling. Let G be a (p, q) graph and 2 ≤ p ≤ k. Let f : V (G) → {1, 2, . . . , k} be a map. For each edge uv, assign the label gcd (f(u), f(v)). f is called a k-prime cordial labeling of G if |vf (i) − vf (j)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labeled with x, ef (1) and ef (0) respectively denote the number of edges labeled with 1 and not labeled with 1. A graph with a k-prime cordial labeling is called a k-prime cordial graph. In this paper we investigate the k-prime cordial labeling behavior of a star and we have proved that every graph is a subgraph of a k-prime cordial graph. Also we investigate the 3-prime cordial labeling behavior of path, cycle, complete graph, wheel, comb and some more standard graphs.

A Study on the Precipitation Behavior of Disordered ${\gamma}$ Phase in an $L1_2$ Ordered ${\gamma}^{\prime}-Ni_3(Al,Ti)$ Phase ($L1_2$${\gamma}^{\prime}-Ni_3(Al,Ti)$ 규칙상 중에 불규칙 ${\gamma}$상의 석출거동에 관한 연구)

  • Han, Chang-Suk
    • Journal of the Korean Society for Heat Treatment
    • /
    • v.19 no.5
    • /
    • pp.249-256
    • /
    • 2006
  • Structural studies have been performed on precipitation hardening found in $L1_2$ ordered ${\gamma}^{\prime}-Ni_3(Al,Ti)$ alloys using transmission electron microscopy. A uniform solid solution of ${\gamma}^{\prime}-L1_2$ ordered phase supersaturated with Ni can be obtained by solution annealing in a suitable temperature range. The ${\gamma}^{\prime}$ phase hardens appreciably by the fine precipitation of disordered ${\gamma}$. The shape of ${\gamma}$ precipitates formed during aging is initially spherical or round-cubic and grow into platelets as aging proceeds. High resolution electron microscopy revealed that the ${\gamma}$ precipitates are perfectly coherent with the matrix ${\gamma}^{\prime}$ as long as the ${\gamma}$-precipitates are plates. The loss of coherency initiates by the introduction of dislocations at the ${\gamma}/{\gamma}^{\prime}$ interface followed by the step formation at the dislocations. The ${\gamma}$ precipitates become globular after the loss of coherency. The strength of ${\gamma}^{\prime}-Ni_3(Al,Ti)$ increases over the temperature range of experiment by the precipitation of fine ${\gamma}$ particles. The peak temperature where a maximum strength was obtained shifted to higher temperature.

On Weakly Prime and Weakly 2-absorbing Modules over Noncommutative Rings

  • Groenewald, Nico J.
    • Kyungpook Mathematical Journal
    • /
    • v.61 no.1
    • /
    • pp.33-48
    • /
    • 2021
  • Most of the research on weakly prime and weakly 2-absorbing modules is for modules over commutative rings. Only scatterd results about these notions with regard to non-commutative rings are available. The motivation of this paper is to show that many results for the commutative case also hold in the non-commutative case. Let R be a non-commutative ring with identity. We define the notions of a weakly prime and a weakly 2-absorbing submodules of R and show that in the case that R commutative, the definition of a weakly 2-absorbing submodule coincides with the original definition of A. Darani and F. Soheilnia. We give an example to show that in general these two notions are different. The notion of a weakly m-system is introduced and the weakly prime radical is characterized interms of weakly m-systems. Many properties of weakly prime submodules and weakly 2-absorbing submodules are proved which are similar to the results for commutative rings. Amongst these results we show that for a proper submodule Ni of an Ri-module Mi, for i = 1, 2, if N1 × N2 is a weakly 2-absorbing submodule of M1 × M2, then Ni is a weakly 2-absorbing submodule of Mi for i = 1, 2

TWO POINTS DISTORTION ESTIMATES FOR CONVEX UNIVALENT FUNCTIONS

  • Okada, Mari;Yanagihara, Hiroshi
    • Bulletin of the Korean Mathematical Society
    • /
    • v.55 no.3
    • /
    • pp.957-965
    • /
    • 2018
  • We study the class $C{\mathcal{V}} ({\Omega})$ of analytic functions f in the unit disk ${\mathbb{D}}=\{z{\in}{\mathbb{C}}$ : ${\mid}z{\mid}$ < 1} of the form $f(z)=z+{\sum}_{n=2}^{\infty}a_nz^n$ satisfying $$1+\frac{zf^{{\prime}{\prime}}(z)}{f^{\prime}(z)}{\in}{\Omega},\;z{\in}{\mathbb{D}}$$, where ${\Omega}$ is a convex and proper subdomain of $\mathbb{C}$ with $1{\in}{\Omega}$. Let ${\phi}_{\Omega}$ be the unique conformal mapping of $\mathbb{D}$ onto ${\Omega}$ with ${\phi}_{\Omega}(0)=1$ and ${\phi}^{\prime}_{\Omega}(0)$ > 0 and $$k_{\Omega}(z)={\displaystyle\smashmargin{2}{\int\nolimits_{0}}^z}{\exp}\({\displaystyle\smashmargin{2}{\int\nolimits_{0}}^t}{\zeta}^{-1}({\phi}_{\Omega}({\zeta})-1)d{\zeta}\)dt$$. Let $z_0,z_1{\in}{\mathbb{D}}$ with $z_0{\neq}z_1$. As the first result in this paper we show that the region of variability $\{{\log}\;f^{\prime}(z_1)-{\log}\;f^{\prime}(z_0)\;:\;f{\in}C{\mathcal{V}}({\Omega})\}$ coincides wth the set $\{{\log}\;k^{\prime}_{\Omega}(z_1z)-{\log}\;k^{\prime}_{\Omega}(z_0z)\;:\;{\mid}z{\mid}{\leq}1\}$. The second result deals with the case when ${\Omega}$ is the right half plane ${\mathbb{H}}=\{{\omega}{\in}{\mathbb{C}}$ : Re ${\omega}$ > 0}. In this case $CV({\Omega})$ is identical with the usual normalized class of convex univalent functions on $\mathbb{D}$. And we derive the sharp upper bound for ${\mid}{\log}\;f^{\prime}(z_1)-{\log}\;f^{\prime}(z_0){\mid}$, $f{\in}C{\mathcal{V}}(\mathbb{H})$. The third result concerns how far two functions in $C{\mathcal{V}}({\Omega})$ are from each other. Furthermore we determine all extremal functions explicitly.

A Parallel Processing Model for Selecting Prime Implicants of a Logic Function for a Near Minimal Sum of Products Form (논리 함수를 최소의 Sum of Products와 가까운 형태로 나타내기 위한 프라임 임프리컨트 선택 별렬 처리 모델)

  • Kim, Won-Jun;Hwang, Hee-Yeung
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.39 no.12
    • /
    • pp.1288-1295
    • /
    • 1990
  • In this paper, we propose a parallel processing model for the efficient selection of Prime Implicants of Logic Functions. This model consists of simple parallel processing nodes, connections between them, Max Net (a part of Hamming Net) and quasi essential Prime Implicant selection standard in simplified cost form. Through these, this model selects essential Prime Implicants in a certain period of time regardless of the number of given Prime Implicants and minterms and also selects quasi essential Prime Implicants in short time.

Game-based Learning Content Development for Learning Principles of Finding Prime Numbers (소수를 찾는 원리 학습을 위한 게임 기반 학습 콘텐츠 개발)

  • Kim, Han-Tae;Hong, Myoung-Pyo;Choi, Yong-Suk
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2011.06b
    • /
    • pp.272-275
    • /
    • 2011
  • 본 논문에서는 수학에서 사용하는 소수(Prime number)를 찾는 원리에 대한 학습을 위한 게임 기반 학습(Game based learning) 콘텐츠인 Prime Miner라는 게임을 제안한다. Prime Miner는 게임이 가지고 있는 장점과 소수의 원리를 결합하여 게임을 통해 학습자의 흥미를 이끌어 학습에 몰입할 수 있도록 도우며, 학습자가 게임 규칙을 통해 소수의 원리를 합리적으로 배울 수 있도록 유도한다. 본 논문에서는 Prime Miner의 게임 원리와 학습자가 Prime Miner를 통해 소수 학습을 하는 방법을 설명한다. 또한 퍼즐게임에서 종종 발생하는 더 이상 게임을 진행할 수 없는 상태인 교착상태(Deadlock)를 피하기 위한 숫자 타일의 배치에 관한 방법도 제시한다.

A Deterministic Method of Large Prime Number Generation (결정론적인 소수 생성에 관한 연구)

  • Park, Jung-Gil;Park, Bong-Joo;Baek, Ki-Young;Chun, Wang-Sung;Ryou, Jae-Cheol
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.9
    • /
    • pp.2913-2919
    • /
    • 2000
  • It is essential to get large prime numbers in the design of asymmetric encryption algorithm. However, the pseudoprime numbers with high possibility to be primes have been generally used in the asymmetric encryption algorithms, because it is very difficult to find large deterministic prime numbers. In this paper, we propose a new method of deterministic prime number generation. The prime numbers generated by the proposed method have a 100% precise prime characteristic. They are also guaranteed reliability, security strength, and an ability of primitive element generation.

  • PDF

A Newly Recorded Sea Star of the Genus Marginaster (Asteroidea: Valvatida: Poraniidae) from the Korea Strait, Korea

  • Lee, Taekjun;Bae, Sungjun;Kim, Dae-Jin;Shin, Sook
    • Animal Systematics, Evolution and Diversity
    • /
    • v.33 no.4
    • /
    • pp.274-277
    • /
    • 2017
  • A sea star was collected from the Korea Strait in the waters adjacent to eastern Jeju Island, Korea ($33^{\circ}39^{\prime}86^{{\prime}{\prime}}N$, $127^{\circ}33^{\prime}12^{{\prime}{\prime}}E$) at a depth of 92 m on November 5, 2016. This specimen was identified as Marginaster paucispinus Fisher, 1913, from the family Poraniidae of the order Valvatida, based on morphological characteristics. The genus Marginaster Perrier, 1881 and M. paucispinus, which were first reported in the South China Sea, are new to the Korean fauna. Partial sequences of mitochondrial COI and 16S ribosomal RNA of M. paucispinus were have been determined for the first time and were deposited in GenBank. They are the first molecular records for the genus Marginaster.

IMPROVED MULTIPLICITY RESULTS FOR FULLY NONLINEAR PARABOLIC SYSTEMS

  • Jung, Tacksun;Choi, Q-Heung
    • Korean Journal of Mathematics
    • /
    • v.17 no.3
    • /
    • pp.283-291
    • /
    • 2009
  • We investigate the existence of multiple solutions (${\xi},{\eta}$) for perturbations of the parabolic system with Dirichlet boundary condition $$(0.1)\;\begin{array}{lcr}{\xi}_t=-L{\xi}+g_1(3{\xi}+{\eta})-s{\phi}_1-h_1(x,t)\;in\;{\Omega}{\times}(0,\;2{\pi}),\\{\eta}_t=-L{\eta}+g_2(3{\xi}+{\eta})-s{\phi}_1-h_2(x,t)\;in\;{\Omega}{\times}(0,\;2{\pi}).\end{array}$$ We show the existence of multiple solutions (${\xi},{\eta}$) for perturbations of the parabolic system when the nonlinearity $g^{\prime}_1,\;g^{\prime}_2$ are bounded and $3g^{\prime}_1(-{\infty})+g^{\prime}_2(-{\infty})<{\lambda}_1,\;{\lambda}_n<3g^{\prime}_1(+{\infty})+g^{\prime}_2(+{\infty})<{\lambda}_{n+1}$.

  • PDF