• Journal of the Chungcheong Mathematical Society
• /
• v.28 no.1
• /
• pp.97-102
• /
• 2015

In this work, we study some arithmetic properties of an intermediate modular curve $X_{\Delta}(21)$.

• Communications of the Korean Mathematical Society
• /
• v.12 no.1
• /
• pp.17-25
• /
• 1997

We estimate the genus g(N) of modular curve $X_0^0(N)$ and show that g(N) = 0 if and only if $1 \leq N \leq 5$.

• Journal of Korea Multimedia Society
• /
• v.20 no.2
• /
• pp.289-297
• /
• 2017

When implementing a hardware elliptic curve cryptosystem (ECC) module, the efficient design of Modular Inverse (MI) algorithm is especially important since it requires much more computation than other finite field operations in ECC. Among the MI algorithms, binary Right-Shift modular inverse (RS) algorithm has good performance when implemented in hardware, but Montgomery Modular Inverse (MMI) algorithm is not considered in [1, 2]. Since MMI has a similar structure to that of RS, we show that the area-improvement idea that is applied to RS is applicable to MMI, and that we can improve the speed of MMI. We designed area- and speed-improved MMI variants as hardware modules and analyzed their performance.

• Communications of the Korean Mathematical Society
• /
• v.23 no.3
• /
• pp.343-348
• /
• 2008

In this work, we determine all the modular curves $X_1$(M, N) which are tetragonal.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.6
• /
• pp.736-743
• /
• 2020

Modular multiplication is one of the most important arithmetic operations in public-key cryptography such as elliptic curve cryptography (ECC) and RSA, and the performance of modular multiplier is a key factor influencing the performance of public-key cryptographic hardware. An efficient hardware implementation of word-based Montgomery modular multiplication algorithm is described in this paper. Our modular multiplier was designed to support eleven field sizes for prime field GF(p) and binary field GF(2k) as defined by SEC2 standard for ECC, making it suitable for lightweight hardware implementations of ECC processors. The proposed architecture employs pipeline scheme between the partial product generation and addition operation and the modular reduction operation to reduce the clock cycles required to compute modular multiplication by 50%. The hardware operation of our modular multiplier was demonstrated by FPGA verification. When synthesized with a 65-nm CMOS cell library, it was realized with 33,635 gate equivalents, and the maximum operating clock frequency was estimated at 147 MHz.

• Communications of the Korean Mathematical Society
• /
• v.24 no.2
• /
• pp.181-185
• /
• 2009

The Drinfeld modular function ${\mu}$ is a generator of the function field of the Drinfeld modular curve $X_0(T)$ and has an t-expansion with the integral coefficients at infinity. In this paper, we show that the coefficients of ${\mu}$ has congruence properties modulo powers of T.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.29 no.3
• /
• pp.515-518
• /
• 2019

The performance of Elliptic Curves Cryptosystem(ECC) is dominated by the modular multiplication since the elliptic curve scalar multiplication consists of the modular multiplication in projective coordinates. In this paper, we propose a new method that combines the Karatsuba-Ofman multiplication method and a new modular reduction algorithm in order to improve the performance of the modular multiplication for NIST p224 in the FIPS 186-4 standard. The proposed method leads to a running time improvement for computing the modular multiplication about 25% faster than the previous methods. The results also show that the method can reduce the arithmetic complexity by half when compared with traditional implementations on the standpoint of the modular reduction.

• Bulletin of the Korean Mathematical Society
• /
• v.44 no.2
• /
• pp.379-383
• /
• 2007

We show that the modular equation ${\phi}^{T_n}_m$ (X, Y) for the Thompson series $T_n$ corresponding to ${\Gamma}_0$(n) gives an affine model of the modular curve $X_0$(mn) which has better properties than the one derived from the modular j invariant. Here, m and n are relative prime. As an application, we construct a ring class field over an imaginary quadratic field K by singular values of $T_n(z)\;and\;T_n$(mz).

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.12
• /
• pp.1882-1889
• /
• 2021

This paper describes a high-performance hardware implementation of modular multiplication used as a core operation in elliptic curve cryptography. A 521-bit high-performance modular multiplier for NIST P-521 curve was designed by adopting 3-way Toom-Cook integer multiplication and fast reduction algorithm. Considering the property of the 3-way Toom-Cook algorithm in which the result of integer multiplication is multiplied by 1/3, modular multiplication was implemented on the Toom-Cook domain where the operands were multiplied by 3. The modular multiplier was implemented in the xczu7ev FPGA device to verify its hardware operation, and hardware resources of 69,958 LUTs, 4,991 flip-flops, and 101 DSP blocks were used. The maximum operating frequency on the Zynq7 FPGA device was 50 MHz, and it was estimated that about 4.16 million modular multiplications per second could be achieved.

• Journal of the Chungcheong Mathematical Society
• /
• v.28 no.3
• /
• pp.443-449
• /
• 2015

In this paper we propose a method of computing the number of points on the reduction of non-hyperelliptic modular curves of genus greater than or equal to 3 over finite fields.