# Search Results 1-20 of 65

• 1 / 4
• Pseudo Random Binary Sequence Based on Cyclic Difference Set

Al Mamun Md. Selim , Akhter Fatema

… Proposed sequence is generated by primitive polynomial, cyclic difference set in elements of the field and binarized by quadratic residue (QR) and quadratic nonresidue (QNR). …

Symmetry 12(8), 1202, 2020-07-22

• The Shift-and-Add Property of m-Sequences

ZENG Fanxin , GE Lijia , HE Xiping , XUAN Guixin , LI Guojun , ZHANG Zhenyu , PENG Yanni , QIAN Linjie , LU Sheng

… Our calculation only depends on the reciprocal polynomial of the primitive polynomial which produces the given m-sequence {<i>a<sub>k</sub></i>}, and the cyclotomic cosets mod <i>p<sup>n</sup></i>-1.</p> …

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E102.A(4), 685-690, 2019

• Exact Learning of Primitive Formal Systems Defining Labeled Ordered Tree Languages via Queries

UCHIDA Tomoyuki , MATSUMOTO Satoshi , SHOUDAI Takayoshi , SUZUKI Yusuke , MIYAHARA Tetsuhiro

… In this paper, based on an FGS, we introduce a primitive formal ordered tree system (pFOTS) as a formal system defining labeled ordered tree languages. … In this learning model, we show the exact learnability of a pFOTS program consisting of one graph rewriting rule and background knowledge defined by a pFOTS program using a polynomial number of queries.</p> …

IEICE Transactions on Information and Systems E102.D(3), 470-482, 2019

• An algebraic interpretation of the XOR-based Secret Sharing Schemes

Yuji Suga

IEICE Proceeding Series (55), 228-231, 2018

• On Searching Linear Transformations for the Register <i>R</i> of MICKEY-Family Ciphers

WANG Lin , GAO Ying , ZHOU Yu , DU Xiaoni

… can be found in probabilistic polynomial time.</p> …

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E101.A(9), 1546-1547, 2018

• CHARACTERIZING DELAUNAY GRAPHS VIA FIXED POINT THEOREM: A SIMPLE PROOF

Matsui Tomomi , Miyamoto Yuichiro

… There exist theorems which characterize Delaunay graphs and yield polynomial time algorithms for the problem only by solving some linear inequality systems. … A polynomial time algorithm proposed by Hodgson, Rivin and Smith solves a linear inequality system given by Rivin, which is based on sophisticated arguments about hyperbolic geometry. … Independently, Hiroshima, Miyamoto and Sugihara gave another linear inequality system and a polynomial time algorithm. …

Journal of the Operations Research Society of Japan 61(1), 151-162, 2018

• Development of a Many-Block Solver for Geometrically Flexible and High-order Accurate CFD  [in Japanese]

松山 新吾 , Matsuyama Shingo

第49回流体力学講演会/第35回航空宇宙数値シミュレーション技術シンポジウム (2017年6月28日-30日. 国立オリンピック記念青少年総合センター), 渋谷区, 東京形態: カラー図版あり資料番号: AA1730011024レポート番号: JAXA-SP-17-004

宇宙航空研究開発機構特別資料: 第49回流体力学講演会/第35回航空宇宙数値シミュレーション技術シンポジウム論文集 = JAXA Special Publication: Proceedings of the 49th Fluid Dynamics Conference / the 35th Aerospace Numerical Simulation Symposium (JAXA-SP-17-004), 153-158, 2017-12-27

• Multi-Valued Sequences Generated by Power Residue Symbols over Odd Characteristic Fields

NASIMA Begum , NOGAMI Yasuyuki , UEHARA Satoshi , H. MOLEROS-ZARAGOZA Robert

… The approach uses a primitive polynomial over an odd characteristic prime field $\f{p}$, where <i>p</i> … Then, for the maximum length sequence of vectors generated by the primitive polynomial, the trace function is used for mapping these vectors to scalars as elements in the prime field. …

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E100.A(4), 922-929, 2017

• Pseudo Random Binary Sequence Generated by Trace and Legendre Symbol with Non Primitive Element in $\mathbb{F}_{p^2}$

Chiaki Ogawa , Ali M. Arshad , Yasuyuki Nogami , Satoshi Uehara , Kazuyoshi Tsuchiya , Robert Morelos Zaragoza

IEICE Proceeding Series (48), A4L-C-4, 2016

• A Multi-Value Sequence Generated by Power Residue Symbol and Trace Function over Odd Characteristic Field

NOGAMI Yasuyuki , UEHARA Satoshi , TSUCHIYA Kazuyoshi , BEGUM Nasima , INO Hiroto , MOLEROS-ZARAGOZA Robert H.

… <p>This paper proposes a new multi-value sequence generated by utilizing primitive element, trace, and power residue symbol over odd characteristic finite field. … | <i>t<sub>i</sub></i>=<i>f<sub>k</sub></i>(Tr(ω<i><sup>i</sup></i>)+<i>A</i>)}, where ω is a primitive element in the extension field $\F{p}{m}$, Tr(⋅) is the trace function that maps $\F{p}{m} \rightarrow \f{p}$, <i>A</i> …

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E99.A(12), 2226-2237, 2016

• PRIME, MAXIMAL AND PRIMITIVE IDEALS IN SOME SUBRINGS OF POLYNOMIAL RINGS

Ferrero Miguel , Miranda Edilson Soares

… In this paper we describe prime, maximal and primitiveideals in some graded subrings of polynomial rings. …

Mathematical Journal of Okayama University 56(1), 65-74, 2014-01

• A Geometric Sequence Binarized with Legendre Symbol over Odd Characteristic Field and Its Properties

NOGAMI Yasuyuki , TADA Kazuki , UEHARA Satoshi

… be the degree of a primitive polynomial <i>f</i>(<i>x</i>) over the prime field F<i>p</i>. …

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E97.A(12), 2336-2342, 2014

• Linear Complexity of Pseudorandom Sequences Derived from Polynomial Quotients: General Cases

DU Xiaoni , ZHANG Ji , WU Chenhuang

… We determine the linear complexity of binary sequences derived from the polynomial quotient modulo <i>p</i> …

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E97.A(4), 970-974, 2014

• A Binary Sequence Generated by Legendre Symbol and Primitive Polynomial over Odd Characteristic

NOGAMI Yasuyuki , UEHARA Satoshi , TADA Kazuki

pを奇標数,素体F_p上のm次原始多項式をf(x),その零点をωとして,Tr(w^i),i=0,1,2,…は周期p^m-1の多値M系列を構成する.これに対して本稿では,Legendreシンボルを用いて二値化することを考える.そしてこの二値系列が,周期L=2(p^m-1)/(p-1)をもつことを示し,またその自己相関の周期的な特性について考察する.幾らかの小さな具体例と今後の研究方針についても述べる …

IEICE technical report. Information theory 113(58), 5-8, 2013-05-24

• Characterizing Delaunay Graphs via Fixed Point Theorem

Tomomi Matsui , Yuichiro Miyamoto

… There exists a theorem which characterizes Delaunay graphs and yields a polynomial time algorithm for the problem only by solving a certain linear inequality system. … Independently, Hiroshima, Miyamoto and Sugihara gave another proof of the theorem based on primitive arguments on Euclidean geometry. … There exists a theorem which characterizes Delaunay graphs and yields a polynomial time algorithm for the problem only by solving a certain linear inequality system. …

研究報告アルゴリズム（AL） 2012-AL-142(1), 1-6, 2012-10-26

• An Approach for Constructing Primitive Polynomials of Degree 2^i over Odd Characteristic Prime Field  [in Japanese]

NOGAMI Yasuyuki , TAKAI Yusuke , KOBAYASHI Shigeki , SUGIMURA Tatsuo , UEHARA Satoshi

本稿では、奇標数pの素体F_p上の2^i次原始多項式を構成するための一手法を示す。具体的には、j<iとして適当なF^*_<p^<2^j>>の元αを用いて、自己α相反変換と呼ぶ変数変換x↦x+αx^<-1>により、2^i次の既約多項式を生成し、これに対してその原始性を判定する。これが原始多項式でない場合には、これを効率よく原始化するための一つのアプロ …

Technical report of IEICE. ISEC 112(39), 19-24, 2012-05-11

References (4)

• Basic examination for CMOS pseudo random pulse generators though the logic circuit simulation and trial fabrication  [in Japanese]

Ohkawa Norio , Honda Shun , Nakagawa Takahiro

Pseudo-random bit sequence (PRBS) generators which can simulate the generation of the actual information signal, are installed in the transmitter side, as well as bit error rate detectors are installe …

Research reports of Tokyo Metropolitan College of Industrial Technology (6), 29-33, 2012-03

• A Constructive Method of Algebraic Attack with Less Keystream Bits

ZHANG Xiaoyan , WANG Qichun , WANG Bin , KAN Haibin

… On the basis of it, we present a constructive method that can solve an overdefined system of multivariate equations with less keystream bits by extending the primitive polynomial. …

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 94(10), 2059-2062, 2011-10-01

J-STAGE  References (23)

• Key-Generation Algorithms for Linear Piece In Hand Matrix Method

… In this paper we prove the equivalence between the plus method and the primitive linear PH matrix method, which is introduced by our previous work to explain the notion of the PH matrix method in general in an illustrative manner and not for a practical use to enhance the security of any given MPKC. … In this paper, we clarify how to generate these matrices and thus present two probabilistic polynomial-time algorithms to generate these matrices. …

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 93(6), 1102-1110, 2010-06-01

J-STAGE  References (10)

• A Note on the Field Isomorphism Problem of X3+sX+s and Related Cubic Thue Equations

HOSHI Akinari , MIYAKE Katsuya

… We study the field isomorphism problem of cubic generic polynomial <I>X</I><SUP>3</SUP>+<I>sX</I>+<I>s</I> … via primitive solutions to the family of cubic Thue equations <I>x</I><SUP>3</SUP>−2<I>mx</I><SUP>2</SUP><I>y</I>−9<I>mxy</I><SUP>2</SUP>−<I>m</I>(2<I>m</I>+27)<I>y</I><SUP>3</SUP>=λ …

Interdisciplinary Information Sciences 16(1), 45-54, 2010

• 1 / 4
Page Top