• Title/Summary/Keyword: multiplication map

Search Result 31, Processing Time 0.024 seconds

A Scalar Multiplication Algorithm Secure against Side-Channel Attacks for Koblitz Curve Cryptosystems (암호공격에 안전한 Koblitz 타원곡선 암호시스템의 스칼라 곱셈 알고리즘)

  • Jang, Yong-Hee;Takagi, Naofumi;Takagi, Kazuyoshi;Kwon, Yong-Jin
    • Proceedings of the Korea Institutes of Information Security and Cryptology Conference
    • /
    • 2006.06a
    • /
    • pp.356-360
    • /
    • 2006
  • Recently, many power analysis attacks have been proposed. Since the attacks are powerful, it is very important to implement cryptosystems securely against the attacks. We propose countermeasures against power analysis attacks for elliptic curve cryptosystems based on Koblitz curves (KCs), which are a special class of elliptic curves. That is, we make our countermeasures be secure against SPA, DPA, and new DPA attacks, specially RPA, ZPA, using a random point at each execution of elliptic curve scalar multiplication. And since our countermeasures are designed to use the Frobenius map of KC, those are very fast.

  • PDF

An Improved Scalar Multiplication on Elliptic Curves over Optimal Extension Fields (최적확장체에서 정의되는 타원곡선 상에서 효율적인 스칼라 곱셈 알고리즘)

  • 정병천;이재원;홍성민;김환준;김영수;황인호;윤현수
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2000.10a
    • /
    • pp.593-595
    • /
    • 2000
  • 본 논문에서는 최적확장체(Optimal Extension Field; OEF)에서 정의되는 타원곡선 상에서 효율적인 스칼라 곱셈 알고리즘을 제안한다. 이 스칼라 곱셈 알고리즘은 프로비니어스 사상(Frobenius map)을 이용하여 스칼라 값을 Horner의 방법으로 Base-Ф 전개하고, 이 전개된 수식을 일괄처리 기법(batch-processing technique)을 사용하여 연산한다. 이 알고리즘을 적용할 경우, Kobayashi 등이 제안한 스칼라 곱셈 알고리즘보다 40% 정도의 성능향상을 보인다.

  • PDF

FOOTNOTE TO A MANUSCRIPT BY GWENA AND TEIXIDOR I BIGAS

  • Ballico, Edoardo;Fontanari, Claudio
    • Bulletin of the Korean Mathematical Society
    • /
    • v.46 no.1
    • /
    • pp.67-69
    • /
    • 2009
  • Recent work by Gwena and Teixidor i Bigas provides a characteristic-free proof of a part of a previous theorem by one of us, under a stronger numerical assumption. By using an intermediate result from the mentioned manuscript, here we present a simpler, characteristic-free proof of the whole original statement.

AVERAGE VALUES ON THE JACOBIAN VARIETY OF A HYPERELLIPTIC CURVE

  • Chung, Jiman;Im, Bo-Hae
    • Bulletin of the Korean Mathematical Society
    • /
    • v.56 no.2
    • /
    • pp.333-349
    • /
    • 2019
  • We give explicitly an average value formula under the multiplication-by-2 map for the x-coordinates of the 2-division points D on the Jacobian variety J(C) of a hyperelliptic curve C with genus g if $2D{\equiv}2P-2{\infty}$ (mod Pic(C)) for $P=(x_P,y_P){\in}C$ with $y_P{\neq}0$. Moreover, if g = 2, we give a more explicit formula for D such that $2D{\equiv}P-{\infty}$ (mod Pic(C)).

Low-complexity de-mapping algorithms for 64-APSK signals

  • Bao, Junwei;Xu, Dazhuan;Zhang, Xiaofei;Luo, Hao
    • ETRI Journal
    • /
    • v.41 no.3
    • /
    • pp.308-315
    • /
    • 2019
  • Due to its high spectrum efficiency, 64-amplitude phase-shift keying (64-APSK) is one of the primary technologies used in deep space communications and digital video broadcasting through satellite-second generation. However, 64-APSK suffers from considerable computational complexity because of the de-mapping method that it employs. In this study, a low-complexity de-mapping method for (4 + 12 + 20 + 28) 64-APSK is proposed in which we take full advantage of the symmetric characteristics of each symbol mapping. Moreover, we map the detected symbol to the first quadrant and then divide the region in this first quadrant into several partitions to simplify the formula. Theoretical analysis shows that the proposed method requires no operation of exponents and logarithms and involves only multiplication, addition, subtraction, and judgment. Simulation results validate that the time consumption is dramatically decreased with limited degradation of bit error rate performance.

AN EFFICIENT AND SECURE STRONG DESIGNATED VERIFIER SIGNATURE SCHEME WITHOUT BILINEAR PAIRINGS

  • Islam, Sk Hafizul;Biswas, G.P.
    • Journal of applied mathematics & informatics
    • /
    • v.31 no.3_4
    • /
    • pp.425-441
    • /
    • 2013
  • In literature, several strong designated verifier signature (SDVS) schemes have been devised using elliptic curve bilinear pairing and map-topoint (MTP) hash function. The bilinear pairing requires a super-singular elliptic curve group having large number of elements and the relative computation cost of it is approximately two to three times higher than that of elliptic curve point multiplication, which indicates that bilinear pairing is an expensive operation. Moreover, the MTP function, which maps a user identity into an elliptic curve point, is more expensive than an elliptic curve scalar point multiplication. Hence, the SDVS schemes from bilinear pairing and MTP hash function are not efficient in real environments. Thus, a cost-efficient SDVS scheme using elliptic curve cryptography with pairingfree operation is proposed in this paper that instead of MTP hash function uses a general cryptographic hash function. The security analysis shows that our scheme is secure in the random oracle model with the hardness assumption of CDH problem. In addition, the formal security validation of the proposed scheme is done using AVISPA tool (Automated Validation of Internet Security Protocols and Applications) that demonstrated that our scheme is unforgeable against passive and active attacks. Our scheme also satisfies the different properties of an SDVS scheme including strongness, source hiding, non-transferability and unforgeability. The comparison of our scheme with others are given, which shows that it outperforms in terms of security, computation cost and bandwidth requirement.

Implementation of Strength Pareto Evolutionary Algorithm II in the Multiobjective Burnable Poison Placement Optimization of KWU Pressurized Water Reactor

  • Gharari, Rahman;Poursalehi, Navid;Abbasi, Mohammadreza;Aghaie, Mahdi
    • Nuclear Engineering and Technology
    • /
    • v.48 no.5
    • /
    • pp.1126-1139
    • /
    • 2016
  • In this research, for the first time, a new optimization method, i.e., strength Pareto evolutionary algorithm II (SPEA-II), is developed for the burnable poison placement (BPP) optimization of a nuclear reactor core. In the BPP problem, an optimized placement map of fuel assemblies with burnable poison is searched for a given core loading pattern according to defined objectives. In this work, SPEA-II coupled with a nodal expansion code is used for solving the BPP problem of Kraftwerk Union AG (KWU) pressurized water reactor. Our optimization goal for the BPP is to achieve a greater multiplication factor ($K_{eff}$) for gaining possible longer operation cycles along with more flattening of fuel assembly relative power distribution, considering a safety constraint on the radial power peaking factor. For appraising the proposed methodology, the basic approach, i.e., SPEA, is also developed in order to compare obtained results. In general, results reveal the acceptance performance and high strength of SPEA, particularly its new version, i.e., SPEA-II, in achieving a semioptimized loading pattern for the BPP optimization of KWU pressurized water reactor.

Real-Time Image-Based Relighting for Tangible Video Teleconference (실감화상통신을 위한 실시간 재조명 기술)

  • Ryu, Sae-Woon;Parka, Jong-Il
    • Journal of Broadcast Engineering
    • /
    • v.14 no.6
    • /
    • pp.807-810
    • /
    • 2009
  • This paper deals with a real-time image based relighting system for tangible video teleconference. The proposed image based relighting system renders the extracted human object using the virtual environmental images. The proposed system can homogenize virtually the lighting environments of remote users on the video teleconference, or render the humans like they are in the virtual places. To realize the video teleconference, the paper obtains the 3D object models of users in real-time using the controlled lighting system. In this paper, we use single color camera and synchronized two directional flash lights. Proposed system generates pure shading images using on and off flash images subtraction. One pure shading reflectance map generates a directional normal map from multiplication of each reflectance map and basic normal vector map. Each directional basic normal map is generated by inner vector calculation of incident light vector and camera viewing vector. And the basic normal vector means a basis component of real surface normal vector. The proposed system enables the users to immerse video teleconference just as they are in the virtual environments.

A complete 3D map of Bell Glasstone spatial correction factors for BRAHMMA subcritical core

  • Shukla, Shefali;Roy, Tushar;Kashyap, Yogesh;Shukla, Mayank;Singh, Prashant
    • Nuclear Engineering and Technology
    • /
    • v.54 no.9
    • /
    • pp.3488-3493
    • /
    • 2022
  • Accelerator driven subcritical systems have long been discussed as facilities which can be used for solving the nuclear waste problem. The physics of these systems is very different from conventional reactors and new techniques had to be developed for reactivity monitoring. One such technique is the Area Ratio Method which studies the response of a subcritical system upon insertion of a large number of neutron pulses. An issue associated with this technique is the spatial dependence of measured reactivity which is intrinsic to the sub criticality of the system since the reactor does not operate on the fundamental mode and measured reactivity depends on the detector position. This is generally addressed by defining Bell-Glasstone spatial correction factor. This factor upon multiplication with measured reactivity gives the correct reactivity which is independent of detector location. Monte Carlo Methods are used for evaluating these factors. This paper presents a complete three dimensional map of spatial correction factors for BRAHMMA subcritical system. In addition, the dataset obtained also helps in identifying detector locations where the correction factor is close to unity, thereby implying no correction if the detector is used at those locations.

Higher Order Shimming for Ultra-fast Spiral-Scan Imaging at 3 Tesla MRI System (3 Tesla MRI 시스템에서 초고속 나선주사영상을 위한 고차 shimming)

  • Kim, P.K.;Lim, J.W.;Ahn, C.B.
    • Investigative Magnetic Resonance Imaging
    • /
    • v.11 no.2
    • /
    • pp.95-102
    • /
    • 2007
  • Purpose: To acquire high-resolution spiral-scan images at higher magnetic field, high homogeneous magnetic field is needed. Field inhomogeneity mapping and in-vivo shimming are important for rapid imaging such as spiral-scan imaging. The rapid scanning sequences are very susceptible to inhomogeneity. In this paper, we proposed a higher-order shimming method to obtain homogeneous magnetic field. Materials and Methods: To reduce measurement time for field inhomogeneity mapping, simultaneous axial/ sagittal, and coronal acquisitions are done using multi-slice based Fast Spin echo sequence. Acquired field inhomogeneity map is analyzed using the spherical harmonic functions, and shim currents are obtained by the multiplication of the pseudo-inverse of the field pattern with the inhomogeneity map. Results: Since the field inhomogeneity is increasing in proportion to the magnetic field, higher order shimming to reduce the inhomogeneity becomes more important in high field imaging. The shimming technique in which axial, sagittal, and coronal section inhomogeneity maps are obtained in one scan is developed, and the shimming method based on the analysis of spherical harmonics of the imhomogenity map is applied. The proposed technique is applicable to a localized shimming as well. High resolution spiral-scan imaging was successfully obtained with the proposed higher order shimming. Conclusion: Proposed pulse sequence for rapid measurement of inhomogeneity map and higher order shimming based on the inhomogeneity map work very well at 3 Tesla MRI system. With the proposed higher order shimming and localized higher order shimming techniques, high resolution spiral-scan images are successfully obtained at 3 T MRI system.

  • PDF