Search Results 1-18 of 18

  • On superspecial abelian surfaces over finite fields II

    Xue Jiangwei , Yang Tse-Chung , Yu Chia-Fu

    … to appear, arXiv:1404.2978], we calculated explicitly the number of isomorphism classes of superspecial abelian surfaces over an arbitrary finite field of <i>odd</i> … degree over the prime field 𝔽<sub>𝑝</sub>. … A key step was to reduce the calculation to the prime field case, and we calculated the number of isomorphism classes in each isogeny class through a concrete lattice description. …

    Journal of the Mathematical Society of Japan 72(1), 303-331, 2020

    J-STAGE 

  • The Institutionalization of Civic Activities in Natural Resource Management:Selection of a Designated Administrator for Kamakura-Hiromachi-Ryokuchi Park  [in Japanese]

    HIRAHARA Suguru , TSUCHIYA Toshiyuki

    … The Civic Association for the Forest of Kamakura Hiromachi, a civic group that worked actively in this field, failed to be designated for the position in 2014 because of its organizational uncertainty and lack of management skills. … However, there is a disadvantage as well in the simplification of the relationship between people and nature(through factors such as"Institutional Isomorphism")and a decrease in the pleasure derived from the activities conducted. …

    Journal of Forest Economics 63(3), 53-64, 2017

    J-STAGE 

  • Comparison of Two Signature Schemes Based on the <i>MQ</i> Problem and Quartz

    TERADA Routo , ANDRADE Ewerton R.

    … <p>Patarin proposed a crytographic trapdoor called Hidden Field Equation (HFE), a trapdoor based on the <i>M</i>ultivariate <i>Q</i>uadratic (<i>MQ</i>) and the Isomorphism of Polynomials (IP) problems. … problem was proved by Patarin et al.'s to be NP-complete. …

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

    J-STAGE 

  • Analysis on isomorphism classes of elliptic curves subjected to GHS attack over prime degree extensions of finite fields with odd characteristic  [in Japanese]

    HOSOGAYA Takayuki , IIJIMA Tsutomu , SHIMURA Mahoro , CHAO Jinhui

    … The GHS attack is known to map the discrete logarithm problem (DLP) in the Jacobian of a curve C_0 defined over the d degree extension k_d of a finite field k to the DLP in the Jacobian of a new curve C over k which is a covering curve of C_0. … However, a such curve C_0 could be mapped by an k_d-isomorphism to another curve which also possesses a covering curve but with a different genus. …

    IEICE technical report. WBS, Wideband System 114(472), 89-95, 2015-03-02

  • Analysis on isomorphism classes of elliptic curves subjected to GHS attack over prime degree extensions of finite fields with odd characteristic  [in Japanese]

    HOSOGAYA Takayuki , IIJIMA Tsutomu , SHIMURA Mahoro , CHAO Jinhui

    … The GHS attack is known to map the discrete logarithm problem (DLP) in the Jacobian of a curve C_0 defined over the d degree extension k_d of a finite field k to the DLP in the Jacobian of a new curve C over k which is a covering curve of C_0. … However, a such curve C_0 could be mapped by an k_d-isomorphism to another curve which also possesses a covering curve but with a different genus. …

    Technical report of IEICE. ISEC 114(471), 89-95, 2015-03-02

  • Analysis on isomorphism classes of elliptic curves subjected to GHS attack over prime degree extensions of finite fields with odd characteristic  [in Japanese]

    HOSOGAYA Takayuki , IIJIMA Tsutomu , SHIMURA Mahoro , CHAO Jinhui

    … The GHS attack is known to map the discrete logarithm problem (DLP) in the Jacobian of a curve C_0 defined over the d degree extension k_d of a finite field k to the DLP in the Jacobian of a new curve C over k which is a covering curve of C_0. … However, a such curve C_0 could be mapped by an k_d-isomorphism to another curve which also possesses a covering curve but with a different genus. …

    IEICE technical report. Information theory 114(470), 89-95, 2015-03-02

  • Public-Key Identification Schemes Based on Multivariate Quadratic Polynomials  [in Japanese]

    SAKUMOTO Koichi , SHIRAI Taizo , HIWATARI Harunaga

    … A problem of solving a system of multivariate quadratic polynomials over a finite field, which is called an MQ problem, is a promising problem in cryptography. … However, the security of the existing multivariate public-key schemes relies not only on the MQ problem but also on an Isomorphism of Polynomials (IP) problem. …

    Technical report of IEICE. ISEC 111(337), 39, 2011-12-07

  • 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> … over the field of rational numbers with the specialization of the parameter <I>s</I> …

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

    IR  J-STAGE 

  • MODA : An efficient algorithm for network motif discovery in biological networks

    OMIDI Saeed , SCHREIBER Falk , MASOUDI-NEJAD Ali

    … proposed their random graph model about 50 years ago, many researchers have investigated and shaped this field. … Unfortunately, network motif discovery is a computationally hard problem and finding rather large motifs (larger than 8 nodes) by means of current algorithms is impractical as it demands too much computational effort. …

    Genes & Genetic Systems 84(5), 385-395, 2009-10-25

    J-STAGE  References (38)

  • COMMUTATIVE GROUP ALGEBRAS OF ABELIAN GROUPS WITH UNCOUNTABLE POWERS AND LENGTHS

    Danchev Peter

    … <p>Let F be a field of char(F) = p > … The main affirmation on the Direct Factor Problem is that S(FG)/G<sub>p</sub> … As applications to the Isomorphism Problem, suppose that for any group H the F-isomorphism FH ≅ … This partially solves a problem posed by May (Proc. … The same isomorphism H ≅ …

    Mathematical Journal of Okayama University 51(1), 2009-01

    IR 

  • The construction of the institutionalization model of the organization  [in Japanese]

    SAKURADA Takanori

    … The new institutionalism is interested in the institutional isomorphism of the organization in the organization field, and they clarify the institutionalization of an organization caused by environment. … The new institutionalism has a problem that an organization is passive excessively. …

    Social and Economic Systems Studies: The Journal of the Japan Association for Social and Economic Systems Studies 30(0), 71-79, 2009

    J-STAGE  References (21)

  • Tschirnhausen transformation of a cubic generic polynomial and a 2-dimensional involutive Cremona transformation

    Hoshi Akinari , Miyake Katsuya

    Proceedings of the Japan Academy Ser. A Mathematical Sciences 83(3), 21-26, 2007-03

  • Data Dependent Circuit for Subgraph Isomorphism Problem

    ICHIKAWA Shuichi , YAMAMOTO Shoji

    … Although the subgraph isomorphism problem has various important applications, it is generally NP-complete and difficult to solve. … this paper examines the feasibility of data dependent designs, which are particularly suitable to a Field programmable Gate Array (FPGA). …

    IEICE Transaction on Information and Systems, D 86(5), 796-802, 2003-05-01

    References (14) Cited by (4)

  • A Discrete Log Cryptosystem Using Graph Isomorphism  [in Japanese]

    KAWADA Yutaka , CHIDA Eikoh , MAMBO Masahiro , SHIZUYA Hiroki

    … The ElGamal cryptosystem is a cryptosystem based on the discrete logarithm problem over a finite field. … In terms of the class of computational complexity, the discrete logarithm problem belongs to NP∩co-NP. … One of problems belonging to a higher class NP∩co-AM is the graph isomorphism problem. …

    Technical report of IEICE. ISEC 99(701), 89-94, 2000-03-16

    References (10)

  • A Discrete Log Cryptosystem Using Graph Isomorphism  [in Japanese]

    KAWADA Yutaka , CHIDA Eikoh , MAMBO Masahiro , SHIZUYA Hiroki

    … The ElGamal cryptosystem is a cryptosystem based on the discrete logarithm problem over a finite field. … In terms of the class of comoputational complexity, the discrete logarithm problem belongs to NP∩co-NP. … One of problems belonging to a higher class NP∩co-AM is the graph isomorphism problem. …

    Technical report of IEICE. SST 99(703), 89-94, 2000-03-16

  • A Discrete Log Cryptosystem Using Graph Isomorphism  [in Japanese]

    KAWADA Yutaka , CHIDA Eikoh , MAMBO Masahiro , SHIZUYA Hiroki

    … The ElGamal cryptosystem is a cryptosystem based on the discrete logarithm problem over a finite field. … In terms of the class of computational complexity, the discrete logarithm problem belongs to NP∩co-NP. … One of problems belonging to a higher class NP∩co-AM is the graph isomorphism problem. …

    IEICE technical report. Information theory 99(699), 89-94, 2000-03-16

    References (10)

  • An Efficient Algorithm for Point Pattern Matching Using Ordered Lists

    ZHANG HONGBIN , MINOH MICHIHIKO , IKEDA KATSUO

    … Matching two-dimensional point patterns is an important problem in the field of pattern recognition and computer vision. … Mathematically it is a graph or subgraph isomorphism problem and belongs to the class of NP problems. …

    Journal of Information Processing 15(1), 108-115, 1992-03-31

    IPSJ 

  • On arithmetic subgroups with isomorphic finite quotients

    Niwa Masahiko

    … Let F(G)denote the set of isomorphism classes of finite homomorphic images of a group G. … The purpose of this paper is to study the analoguous problem for S-arithmetic subgroups of a certain semi-simple algebraic group defined over aglobal field. …

    Memoirs of the Faculty of Education,Shiga University Natural science (23), 5-11, 1974-03

    IR 

Page Top