• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 1992.11a
• /
• pp.3-12
• /
• 1992

본고는 1992년 5월 25일부터 5월 28일 까지 구 동구권 국가 중 헝거리에서 개최된 Eurocrypt'92에서 88편의 신청 논문 중 발표된 35편의 연구 논문을 중심으로 암호학의 최근 연구 결과와 동향을 요약정리하고 회의 기간 중에 있었던 "Trapdoor Primes and Moduli"를 주제로 한 패널 토론 내용을 소개하였다.

• Journal for History of Mathematics
• /
• v.15 no.2
• /
• pp.169-174
• /
• 2002

In this paper we prove that tile property of product irreducible characters is, if $\Phi$$\in$$\textit{Irr(H)}$ and $\Theta$$\in$$\textit{Irr(K)}$ are faithful, then $\Phi$$\times\theta$ is faithful if and only if │$\textit{Z(H)}$│ and │$\textit{Z(K)}$│ are relative primes where G=$\textit{H}\times\textit{K}$.

• Bulletin of the Korean Mathematical Society
• /
• v.49 no.1
• /
• pp.155-163
• /
• 2012

Let E be an elliptic curve over $\mathbb{Q}$. Using Iwasawa theory, we give what seems to be the first general upper bound for the order of vanishing of the p-adic L-function at s = 0, and the $\mathbb{Z}_p$-corank of the Tate-Shafarevich group for all sufficiently large good ordinary primes p.

• Bulletin of the Korean Mathematical Society
• /
• v.58 no.6
• /
• pp.1463-1481
• /
• 2021

Divisibility properties of harmonic numbers by a prime number p have been a recurrent topic. However, finding the exact p-adic orders of them is not easy. Using class numbers of number fields and Bernoulli numbers, we compute the exact p-adic orders of harmonic type sums. Moreover, we obtain an asymptotic formula for generalized harmonic numbers whose p-adic orders are exactly one.

• Kyungpook Mathematical Journal
• /
• v.62 no.4
• /
• pp.769-772
• /
• 2022

Given a prime number p and a natural number m not divisible by p, we propose the problem of finding the smallest number r₀ such that for r ≥ r₀, every group G of order p^rm has a non-trivial normal p-subgroup. We prove that we can explicitly calculate the number r₀ in the case where every group of order p^rm is solvable for all r, and we obtain the value of r₀ for a case where m is a product of two primes.

• Bulletin of the Korean Mathematical Society
• /
• v.60 no.1
• /
• pp.149-160
• /
• 2023

Let 𝖆 and 𝖇 be ideals of a commutative Noetherian ring R and M a finitely generated R-module of finite dimension d > 0. In this paper, we obtain some results about the annihilators and attached primes of top local cohomology and top formal local cohomology modules. In particular, we determine Ann(𝖇 H^d_𝖆(M)), Att(𝖇 H^d_𝖆(M)), Ann(𝖇𝔉^d_𝖆(M)) and Att(𝖇𝔉^d_𝖆(M)).

• Korean Journal of Cognitive Science
• /
• v.14 no.2
• /
• pp.37-46
• /
• 2003

Two experiments were conducted to explore the implicit representation of gender-stereotype using primed naming task for prime-target pairs. In Experiment 1, Participants were presented gender's attributes as primes at SOA 250ms and were asked to pronounce person's names which differed in typicality and preference of gender's attributes. The results showed that gender congruent effects was not found, but typicality effects and interactions were found. In Experiment 2, Participants were presented gender's attributes as primes at SOA 250ms and were asked to pronounce gender's attributes which differed in typicality of gender's attributes. The results showed that woman's attributes superiority effects were found, but typicality effects were not. These results were discussed from a point of view of graded representation of gender stereotype and asymmetrical processing of gender stereotype to priming conditions in the implicit level.

• Korean Journal of Cognitive Science
• /
• v.28 no.1
• /
• pp.43-64
• /
• 2017

The purpose of the current study is to investigate how task-irrelevant affective priming affects higher cognitive function. In the study, we selected prime stimuli from International Affective Picture System(IAPS) and examined if they influence participants' performance of syllogistic reasoning task when they are task-irrelevant. In Experiment 1, arousal of IAPS stimuli was controlled while valence of the stimuli was manipulated. In Experiment 2, valence of IAPS stimuli was controlled while arousal of stimuli was manipulated. In both experiments, task-irrelevant affective primes were followed by syllogistic reasoning tasks consisting of three sentences and measured accuracies of task performance. The results showed that valence of affective prime affected logical validity of reasoning and belief-bias whereas arousal of affective primes did not yield any difference. That is, positive valence facilitated logical and analytic processing by reducing belief-bias while arousal did not affect reasoning task performance. These results suggest that dimensions of valence and arousal independently influence higher cognitive function.

• 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.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.15 no.6
• /
• pp.81-92
• /
• 2005

A novel public key cryptosystem that provides a double decryption mechanism is proposed at Asiacrypt '03 by Bresson, Catalano and Pointcheval based on the scheme proposed by Clamor and Shoup at Eurocrypt '02. Previous double decryrtion scheme is designed based on $Z_n^2$ where n=pq for two primes p,q. In this paper, we propose an efficient public key scheme with double decryption mechanism based on $Z_p^2_q$ for two primes p,q. Our scheme is more efficient an the previous schemes. Moreover, we review the previous schemes in a privacy point of view and propose a privacy enhanced double decryption scheme.