• Title/Summary/Keyword: 소수 생성

Search Result 274, Processing Time 0.021 seconds

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

Efficient Generation of Primes (소수의 효율적 생성)

  • 심상규;이은정;이필중
    • Proceedings of the Korea Institutes of Information Security and Cryptology Conference
    • /
    • 1997.11a
    • /
    • pp.173-182
    • /
    • 1997
  • 공개키 시스템에서는 소수들이 필요하고, 이 소수들을 효율적인 방법으로 빠르게 생성할 수 있는 것이 중요하다. 본 논문에서는 소수들을 간단하면서도 효과적으로 생성할 수 있는 방법을 제안한다.

  • PDF

A Study on the Key Generation of RSA Cryptosystem (RSA암호 키생성에 관한 연구)

  • 최용진;김재문;염흥열;이만영
    • Proceedings of the Korea Institutes of Information Security and Cryptology Conference
    • /
    • 1991.11a
    • /
    • pp.58-71
    • /
    • 1991
  • 본 논문에서는 RSA 암호시스팀의 안전한 암호화, 복호화키의 생성에 관하여 연구하였다. 공개키 암호시스팀인 RSA 암호시스팀은 일반적으로 암호화, 복호화에 요구되는 계산시간과, 안전한 키 생성문제가 중요한 해결과제이다. 안전한 키는 소인수분해 공격에 강한 조건을 만족하는 것이다. 따라서 본 논문에서는 (P$\pm$1) 소인수분해 공격에 강한 조건을 만족하면서, 키 생성시 필요한 $10^{75}$정도의 소수를 예비 소수판정과 소수판정 알고리듬을 사용하여 소수가 아닐 확률이 $10^{-8}$이하가 되도록 하였다. 그리고 생성된 키가 정확함을 입증하였다.

  • PDF

Probabilistic Analysis of JPV Prime Generation Algorithm and its Improvement (JPV 소수 생성 알고리즘의 확률적 분석 및 성능 개선)

  • Park, Hee-Jin;Jo, Ho-Sung
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.35 no.2
    • /
    • pp.75-83
    • /
    • 2008
  • Joye et al. introduced a new prime generation algorithm (JPV algorithm hereafter), by removing the trial division from the previous combined prime generation algorithm (combined algorithm hereafter) and claimed that JPV algorithm is $30{\sim}40%$ faster than the combined algorithm. However, they only compared the number of Fermat-test calls, instead of comparing the total running times of two algorithms. The reason why the total running times could not be compared is that there was no probabilistic analysis on the running time of the JPV algorithm even though there was a probabilistic analysis for the combined algorithm. In this paper, we present a probabilistic analysis on the running time of the JPV algorithm. With this analytic model, we compare the running times of the JPV algorithm and the combined algorithm. Our model predicts that JPV algorithm is slower than the combined algorithm when a 512-bit prime is generated on a Pentium 4 system. Although our prediction is contrary to the previous prediction from comparing Fermat-test calls, our prediction corresponds to the experimental results more exactly. In addition, we propose a method to improve the JPV algorithm. With this method, the JPV algorithm can be comparable to the combined algorithm with the same space requirement.

Partial Key Exposure Attack on Unbalanced RSA with small CRT exponent (작은 CRT 지수를 사용한 RSA에서의 일부 키 노출 공격)

  • 이희정
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.14 no.5
    • /
    • pp.135-140
    • /
    • 2004
  • In Crypto 2002 May analyzed the relation between the size of two primes and private key in unbalanced RSA with small CRT exponent. Also in Crypto 2003 he showed that if $N^{1}$4/ amount of most significant bits(least significant bits) of $d_{p}$ is exposed in balanced RSA with CRT, N can be factored. To prove this he used Howgrave-Graham's Theorem. In this paper we show that if $N^{1}$4/ amount of $d_{p}$ , p is smaller than q, and bigger than $N^{0.382}$ to avoid May's attack, is exposed in unbalanced RSA with small CRT exponent, it is enough to expose $d_{p}$ . We use Coppersmith's theorem with unbalanced primes.

Small Hydraulic Power Generation using the Discharging Seawater from LNG Receiving Terminal (LNG 인수기지의 방류해수를 이용한 소수력발전 개발방안)

  • Ha, Jongmann;Chae, Jeongmin;Son, Whaseong
    • 한국신재생에너지학회:학술대회논문집
    • /
    • 2010.06a
    • /
    • pp.192.2-192.2
    • /
    • 2010
  • 일반적 의미의 소수력발전은 계곡이나 저낙차의 하천에서 시도되었으나, 한국의 지형과 강수패턴등은 소수력발전을 활성화하기에 어려운 점들이 있었다. 이에 최근에는 정수장, 하수처리장등과 같은 인공구조물에 소수력발전을 설치 운영하는 방향으로 가고 있으며, 특히 화력발전소 냉각공정에 사용되는 해수를 이용한 소수력발전이 크게 성공하였고 확대설치 되어가고 있다. 해안에 위치하는 LNG인수기지에서는 LNG의 기화에 해수를 열원으로 사용하며, 기화공정에서 열교환 후 바다에 배출된다. 이 때 기화해수와 공기와의 접촉으로 생성된 거품은 해양미생물과의 복합작용으로 쉽게 깨어지지 않고 바다로 떠내려가게 된다. 이러한 거품은 시각적 거부감으로 인하여 인근어민들의 불편함을 야기하고 있으며, 또한 배출해수와 일반해수와의 온도차로 인한 인근 어장이나 양식장의 어획고에 미칠 수 있는 부작용의 가능성에 대한 우려는 더욱 방류해수의 적절한 처리를 필요로 하고 있다. 이러한 방류해수의 거품생성을 해결하는 데 있어 근본적인 해결방법은 심층배수법인데, 심층배수 구조물에 발전수차를 추가 설치만 하면 수력발전이 가능하다. 방류해수의 거품관련 환경문제를 해결하면서 동시에 청정전력을 생산할 수 있는 해양소수력발전에 대하여 KOGAS에서는 LNG 인수기지에의 적용가능성을 분석하고 있으며, 방류해수의 낙차와 조수간만의 차를 이용하는 해양소수력발전을 LNG 인수기지에의 적용하는 것으로는 세계최초의 시도이다. 주변지형에 따른 입지여건을 분석하고, 해수계통분석, 소수력발전방법, 수차종류, 수차용량, 수차개수, pond의 크기등을 결정하고, 수리해석 및 경제성분석을 수행할 것이며 소수력발전의 타당성여부에 대한 가늠을 잡고자 한다.

  • PDF

Deleuze and Guattari's Death, the Minor Literature and the Minor Philosophy of Education (소수자 문학과 문학교육의 과제)

  • Yoon, Seung Ri
    • Korean Educational Research Journal
    • /
    • v.40 no.3
    • /
    • pp.39-65
    • /
    • 2019
  • This essay examines the relationship between death and the minor literature and the minor philosophy of education. Deleuze and Guattari conceive death as the source of question and the problem. Death overcomes Freud's death-drive and is conceived as the universal event. Then, death is understood as the essential problem, the condition of thought about life, and the paradox of actuality. On the other hand, their minor literature is able to figure in Kafka's works, Metamorphosis and so on, excellently. Deleuze and Guattari argue that Kafka's works push ahead to the edge of the deterritorization. Their argument on the minor literature has the following three characteristics: first, the territorization of the language; second, the directional connection between the individual and the social; third, the collective arrangement of the statement. Death and the minor literature share the "intensity" as the theoretical tool and thus presuppose each other. From this, we are able to draw the possibility of the minor philosophy of education. It makes a crack on the major philosophy of education, exposing the limitation of the doctrines. In other words, the major philosophy of education enforces the reading of grand philosophers by the defined ways only. Instead, Deleuze and Guattari show the creative way through their research of the history of philosophy and extend the field of thought. In following this way, we can repeat the novel in the philosophy of education also. In this essay, we examine their "affect" for the possibility.

  • PDF

Microstructure and Strength Characteristic of Hydropobic Cement Mortar with Silan Admixture (실란계 혼화제가 혼입된 소수성 시멘트 모르타르의 미세구조 및 강도특성)

  • Kim, Younghwan;Oh, Hongseob
    • Journal of the Korean Recycled Construction Resources Institute
    • /
    • v.9 no.2
    • /
    • pp.127-134
    • /
    • 2021
  • A hydrophobic emulsion consisting of PMHS and PVA was mixed into a cement mortar to observe changes in cement hydrate and microstructure, and to experimentally evaluate compressive strength and flexural strength. The hydrophobic emulsion was added with metakaolin and PVA fibers, and the stirring speed and sequence were adjusted to prepare a shell-concept hydrophobic emulsion. It was then mixed when mixing mortar to enhance filling of the internal pores and change of the hydrates. It was observed that the mortar mixed with a hydrophobic emulsion was filled with micropores and a coating film was formed on the surface of the hydrates by the emulsion. It was analyzed that the total pore area and porosity of the mortar mixed with the emulsion decreased from 30% to 60% compared to OPC, excluding the 50MK variable, which was extremely reduced and the median pore diameter decreased in some variables. It was also found that the compressive strength of the mortar mixed with emulsion 1% was increased up to 20%, but the strength of the mortar specimen mixed with 2% decreased to 50%.

Effect of an Aqueous Chlorine Dioxide Generator and Effect on Disinfection of Fresh Fruits and Vegetables by Immersion Washing (이산화염소수 생성기의 생성효율 및 과.채류에 대한 침지 세정 살균효과)

  • Park, Kee-Jai;Jeong, Jin-Woong;Lim, Jeong-Ho;Jang, Jae-Hee;Park, Hee-Joo
    • Food Science and Preservation
    • /
    • v.15 no.2
    • /
    • pp.236-242
    • /
    • 2008
  • We investigated the optimum concentration of a $NaClO_2$ solution and the amount of gaseous $Cl_2$ for production of high yield and purity of aqueous $ClO_2$ by use of a gaseous chlorine-chlorite $ClO_2$ generator. This system produced lower concentrations of chlorine dioxide and is applicable for direct-use in food processing as a cleaner and sanitizer. The concentration of $NaClO_2$ solution and the amount of gaseous $Cl_2$ was varied from 0.01-0.1% and 100-1,000 g/hr, respectively. The concentrations of chlorite, chlorate, FAC (free available chlorine), and chlorine dioxide that were produced increased with increasing concentration of $NaClO_2$ solution and with the amount of gaseous $Cl_2$. The optimum concentration of $NaClO_2$ solution and amount of gaseous $Cl_2$ were 0.1% and 900 g/hr respectively. $ClO_2$ and FAC produced at these concentrations were 882.0 ppm and 8.0 ppm, with no detection of chlorite and chlorate. The yield and purity of $ClO_2$ were 97.0% and 96.0% respectively. Immersion-cleaning experiments showed that this protocol decreased the level of CFU/g by $10^3$- to $10^4$-fold, with a similar effect on fruit.

Analysis and Optimization of the Combined Primality Test Using gcd Operation (gcd 연산을 이용한 조합 소수 검사 알고리즘의 분석 및 최적화)

  • Seo, Dong-Woo;Jo, Ho-Sung;Park, Hee-Jin
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2007.06b
    • /
    • pp.476-481
    • /
    • 2007
  • 큰 소수를 빠르게 생성하기 위한 다양한 소수 검사 방법이 개발되었으며, 가장 많이 쓰이는 소수 검사 방법은 trial division과 Fermat (또는 Miller-Rabin) 검사를 조합한 방법과 gcd 연산과 Fermat (또는 Miller-Rabin) 검사를 조합한 방법이다. 이 중 trial division과 조합한 방법에 대해서는 확률적 분석을 이용하여 수행시간을 예측하고 수행시간을 최적화 하는 방법이 개발되었다. 하지만, gcd 연산과 조합한 방법에 대해서는 아무런 연구결과도 제시되어 있지 않다. 본 논문에서는 gcd 연산을 이용한 조합 소수 검사 방법에 대해 확률적 분석을 이용하여 수행시간을 예측하고 수행시간을 최적화 하는 방법을 제안한다.

  • PDF