• Title/Summary/Keyword: All-One Polynomials

Search Result 24, Processing Time 0.017 seconds

Simple factor analysis of measured data

  • Kozar, Ivica;Kozar, Danila Lozzi;Malic, Neira Toric
    • Coupled systems mechanics
    • /
    • v.11 no.1
    • /
    • pp.33-41
    • /
    • 2022
  • Quite often we have a lot of measurement data and would like to find some relation between them. One common task is to see whether some measured data or a curve of known shape fit into the cumulative measured data. The problem can be visualized since data could generally be presented as curves or planes in Cartesian coordinates where each curve could be represented as a vector. In most cases we have measured the cumulative 'curve', we know shapes of other 'curves' and would like to determine unknown coefficients that multiply the known shapes in order to match the measured cumulative 'curve'. This problem could be presented in more complex variants, e.g., a constant could be added, some missing (unknown) data vector could be added to the measured summary vector, and instead of constant factors we could have polynomials, etc. All of them could be solved with slightly extended version of the procedure presented in the sequel. Solution procedure could be devised by reformulating the problem as a measurement problem and applying the generalized inverse of the measurement matrix. Measurement problem often has some errors involved in the measurement data but the least squares method that is comprised in the formulation quite successfully addresses the problem. Numerical examples illustrate the solution procedure.

A Study on the Parallel Multiplier over $GF(3^m)$ Using AOTP (AOTP를 적용한 $GF(3^m)$ 상의 병렬승산기 설계에 관한 연구)

  • Han, Sung-Il;Hwang, Jong-Hak
    • Journal of IKEEE
    • /
    • v.8 no.2 s.15
    • /
    • pp.172-180
    • /
    • 2004
  • In this paper, a parallel Input/Output modulo multiplier, which is applied to AOTP(All One or Two Polynomials) multiplicative algorithm over $GF(3^m)$, has been proposed using neuron-MOS Down-literal circuit on voltage mode. The three-valued input of the proposed multiplier is modulated by using neuron-MOS Down-literal circuit and the multiplication and Addition gates are implemented by the selecting of the three-valued input signals transformed by the module. The proposed circuits are simulated with the electrical parameter of a standard $0.35{\mu}m$CMOS N-well doubly-poly four-metal technology and a single +3V supply voltage. In the simulation result, the multiplier shows 4 uW power consumption and 3 MHzsampling rate and maintains output voltage level in ${\pm}0.1V$.

  • PDF

A Polynomial-based Study on the Protection of Consumer Privacy (소비자 프라이버시 보호에 관한 다항식 기반 연구)

  • Piao, Yanji;Kim, Minji
    • Journal of Information Technology Services
    • /
    • v.19 no.1
    • /
    • pp.145-158
    • /
    • 2020
  • With the development and widespread application of online shopping, the number of online consumers has increased. With one click of a mouse, people can buy anything they want without going out and have it sent right to the doors. As consumers benefit from online shopping, people are becoming more concerned about protecting their privacy. In the group buying scenario described in our paper, online shopping was regarded as intra-group communication. To protect the sensitive information of consumers, the polynomial-based encryption key sharing method (Piao et al., 2013; Piao and Kim, 2018) can be applied to online shopping communication. In this paper, we analyze security problems by using a polynomial-based scheme in the following ways : First, in Kamal's attack, they said it does not provide perfect forward and backward secrecy when the members leave or join the group because the secret key can be broken in polynomial time. Second, for simultaneous equations, the leaving node will compute the new secret key if it can be confirmed that the updated new polynomial is recomputed. Third, using Newton's method, attackers can successively find better approximations to the roots of a function. Fourth, the Berlekamp Algorithm can factor polynomials over finite fields and solve the root of the polynomial. Fifth, for a brute-force attack, if the key size is small, brute force can be used to find the root of the polynomial, we need to make a key with appropriately large size to prevent brute force attacks. According to these analyses, we finally recommend the use of a relatively reasonable hash-based mechanism that solves all of the possible security problems and is the most suitable mechanism for our application. The study of adequate and suitable protective methods of consumer security will have academic significance and provide the practical implications.

Confocal off-axis optical system with freeform mirror, application to Photon Simulator (PhoSim)

  • Kim, Dohoon;Lee, Sunwoo;Han, Jimin;Park, Woojin;Pak, Soojong;Yoo, Jaewon;Ko, Jongwan;Lee, Dae-Hee;Chang, Seunghyuk;Kim, Geon-Hee;Valls-Gabaud, David;Kim, Daewook
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.46 no.2
    • /
    • pp.75.2-76
    • /
    • 2021
  • MESSIER is a science satellite project to observe the Low Surface Brightness (LSB) sky at UV and optical wavelengths. The wide-field, optical system of MESSIER is optimized minimizing optical aberrations through the use of a Linear Astigmatism Free - Three Mirror System (LAF-TMS) combined with freeform mirrors. One of the key factors in observations of the LSB is the shape and spatial variability of the Point Spread Function (PSF) produced by scatterings and diffraction effects within the optical system and beyond (baffle). To assess the various factors affecting the PSF in this design, we use PhoSim, the Photon simulator, which is a fast photon Monte Carlo code designed to include all these effects, and also atmospheric effects (for ground-based telescopes) and phenomena occurring inside of the sensor. PhoSim provides very realistic simulations results and is suitable for simulations of very weak signals. Before the application to the MESSIER optics system, PhoSim had not been validated for confocal off-axis reflective optics (LAF-TMS). As a verification study for the LAF-TMS design, we apply Phosim sequentially. First, we use a single parabolic mirror system and compare the PSF results of the central field with the results from Zemax, CODE V, and the theoretical Airy pattern. We then test a confocal off-axis Cassegrain system and check PhoSim through cross-validation with CODE V. At the same time, we describe the shapes of the freeform mirrors with XY and Zernike polynomials. Finally, we will analyze the LAF-TMS design for the MESSIER optical system.

  • PDF