素数p在Q（6√u）中的素理想分解问题

利用局部域的方法,研究素数p在有理数域的6次根扩张中的素理想分解问题,并完全确定了素数p在Q（6√u）中分解所可能有的形式（pα︱︱u）.为进一步研究素数p在Q（2l√u）中（l为素数）的分解提供了途径.     

Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method

In this paper, we describe many improvements to the number field sieve. Our main contribution consists of a new way to compute individual logarithms with the number field sieve without solving a very large linear system for each logarithm. We show that, with these improvements, the number field sieve outperforms the gaussian integer method in the hundred digit range. We also illustrate our results by successfully computing discrete logarithms with GNFS in a large prime field.

     

An upper bound on the covering radius of the logarithmic lattice for cyclotomic number fields

Recently, in coding theory and cryptography, it has been important the diversified use of lattices. One use of them is to cover a space. Each lattice has a covering radius, a number corresponding to the radius of a ball whose translations by all the points of the lattice cover efficiently the space generated by a basis of it. A way to obtain lattices algebraically is from subgroups of the multiplicative group of units of a number field via the logarithm embedding. This includes the logarithm lattice. In this work, it is presented an upper bound on the covering radius of the logarithm lattice obtained from the units of general cyclotomic number fields via the logarithm embedding, which generalizes an upper bound present in a previous work for cyclotomic number fields of prime-power indices.     

Decision Problems in Quadratic Function Fields of High Genus

This paper provides verification procedures for a number of decision problems in quadratic function fields of odd characteristic, thereby establishing membership of these problems in both NP and co-NP. The problems include determining the ideal and divisor class numbers of the field, the regulator of the field (in the real case), a generating system of the ideal class group, a basis of the ideal class group, the pricipality of an ideal, the equivalence of two ideals, the discrete logarithm of an ideal class with respect to another ideal class, and the order of a class in the ideal class group. While several of these problems belong to the aforementioned complexity classes unconditionally, others require a certain assumption to ensure that the verification procedures can be done in polynomial time; so far, this assumption has only been verified for fields of high genus.     

整体函数域素数次循环扩域的类群

设K/F是整体函数域的素数l次循环扩张,F是有理函数域F_q(T)上的有限可分扩域.利用函数域的Conner-Hurrelbrink正合六边形与源于短正合列的正合六边形,本文在l整除与不整除基域F的理想类数的情形下,分别研究函数域K理想类群的Sylow l-子群的结构.同时,利用得到的结果,本文给出了基域F的单位为K中元素norm的若干条件.     

New Series of Rational Approximations and Some of Their Applications

We consider the well-known discrete logarithm problem in a finite simple field GF( $p$ ), where $p$ is a prime number, which has several application in problems of information protection. In Sec. 1, we introduce and study some number sequences arising in the continued fraction expansion of a real number. The results obtained are used in Sec. 2, where we introduce a new algorithm based on rational approximations for solving the problem of representing the discrete logarithm of a given number as the sum of logarithms of small primes; this problem is an important part of the discrete logarithm problem. We obtain several results necessary to construct and justify the representation algorithm. This algorithm is stated exactly in Sec. 3. We present several experimental results illustrating the work of the algorithm for prime numbers of the order of 10¹⁶10³¹.     

On the 2-class field tower of some imaginary biquadratic number fields

Let be an imaginary biquadratic number field with Cl_k,2, the 2-class group of k, isomorphic to Z/2Z × Z/2^mZ, m > 1, with q a prime congruent to 3 mod 4 and d a square-free positive integer relatively prime to q. For a number of fields k of the above type we determine if the 2-class field tower of k has length greater than or equal to 2. To establish these results we utilize capitulation of ideal classes in the three unramified quadratic extensions of k, ambiguous class number formulas, results concerning the fundamental units of real biquadratic number fields, and criteria for imaginary quadratic number fields to have 2-class field tower length 1. 2000 Mathematics Subject Classification Primary—11R29     

素数p在数域Q(u~(1/2),v~(1/2))上的素理想分解

运用局部域理论给出了奇素数p在数域K=Q(u~(1/2),v~(1/2))上的素理想分解形式,其中l是奇素数,u,v∈z~*,且u/vQ~l.     

Über die Verteilung von primen primitiven Wurzeln in algebraischen Zahlkörpern

Generalizing a method introduced by Elliott in the rational case to number fields in an appropriate way, asymptotic estimates are given for the number of algebraic primes in certain parallelotopes which are primitive roots for almost all (in a certain sense) prime ideal moduli. The proofs depend upon a fundamental lemma of Selberg's rational sieve method and make use of the large sieve in the setting of an algebraic number field.     

關於素性環

<正> §1.本文的目的是在對於所謂素性環(Primal Ring)作一些探討.這裹的環都是指着有么元無零因子的可換環.我們以R表這樣一個環,1就是R的么元,大寫字母A,B,C,P,……表R的真理想子環,小寫字母a,b,c,x,y等表R的元.符號Ax~(-1)表示R中一切能使xy∈A的y所組成的集.容易證明Ax~(-1)是一個理想子環,並且Ax~(-1)A.如果Ax~(-1)A,則說x不素於A,否則說x素於A.這樣一來,A是素理想子環的充要條件就是R中凡不屬A的元都素於A.     

Application of the large sieve to the solution of additive problems of mixed type

A variant of the large-sieve: method, using a combination of results obtained by Lavrik, Montgomery, and Eombieri, is employed to derive asymptotic properties of the number of solutions of the equationNp+Na=n wherep is a prime ideal of some ideal class of a field K of degree n4, anda is a prime ideal of a class of an imaginary quadratic field.Translated from Matematicheskie Zametki, Vol. 10, No. 1, pp. 73–81, July, 1971.The author wishes to thank A. I. Vinogradov for his help and advice in this work.     

The decision of prime and primary ideal

We give more efficient criteria to characterise prime ideal or primary ideal. Further, we obtain the necessary and sufficient conditions that an ideal is prime or primary in real field from the Gröbner bases directly.     

Lifting of solutions of an exponential congruence

In the present paper, a polynomial algorithm is suggested for reducing the problem of taking the discrete logarithm in the ring of algebraic integers modulo a power of a prime ideal to a similar problem with the power equal to one. Explicit formulas are obtained; instead of the Fermat quotients, in the case of residues in the ring of rational integers, these formulas use other polynomially computable logarithmic functions, like the $\mathfrak{p}$ -adic logarithm.     

The nonexistence of nonsolvable octic number fields ramified only at one small prime

We prove that there is no primitive octic number field ramified only at one small prime, and so no such number field with a nonsolvable Galois group.

     

Radically perfect prime ideals in polynomial rings

We call an ideal I of a commutative ring R radically perfect if among the ideals of R whose radical is equal to the radical of I the one with the least number of generators has this number of generators equal to the height of I. Let R be a Noetherian integral domain of Krull dimension one containing a field of characteristic zero. Then each prime ideal of the polynomial ring R[X] is radically perfect if and only if R is a Dedekind domain with torsion ideal class group. We also show that over a finite dimensional Bézout domain R, the polynomial ring R[X] has the property that each prime ideal of it is radically perfect if and only if R is of dimension one and each prime ideal of R is the radical of a principal ideal.     

一种几何定理机器证明的零维化方法

本文对一类初等几何定理的证明给出了一种机械化方法，利用这种方法，可计算出一个由有限个素理想组成的集合，所有属于假设部分对应的某一扩域上的理想的素理想都在这个集合中出现并且可以挑选出来．因而一个几何定理一般真确，当且仅当终结多项式属于全部的这种素理想，即对其不可约特征列的余式为零．     

Circular distributions and a result of Solomon

In his paper (Invent. Math. 109 (1992) 329-350), Solomon finds an information on the prime factorization of an element coming from a circular unit 1-ζ over the ideal class group of a real abelian number field L, where ζ denotes a root of unity. Using this he obtains an annihilator of the p-Sylow subgroup of the subgroup of the ideal class group of L generated by the classes of prime ideals lying above p. We generalize this result to the circular distributions which has the axiomatic definition of Euler systems as its defining property.     

Computation of differential Chow forms for ordinary prime differential ideals

In this paper, we propose algorithms for computing differential Chow forms for ordinary prime differential ideals which are given by characteristic sets. The algorithms are based on an optimal bound for the order of a prime differential ideal in terms of a characteristic set under an arbitrary ranking, which shows the Jacobi bound conjecture holds in this case. Apart from the order bound, we also give a degree bound for the differential Chow form. In addition, for a prime differential ideal given by a characteristic set under an orderly ranking, a much simpler algorithm is given to compute its differential Chow form. The computational complexity of the algorithms is single exponential in terms of the Jacobi number, the maximal degree of the differential polynomials in a characteristic set, and the number of variables.     

关于一种相对域的素理想分解

主要讨论了代数域的扩张平稳之前与扩张平移之后的分解各间的关系问题,以及素理想分解问题,改进了文「３」的结果。     

Algorithms for finding the minimal polynomials and inverses of resultant matrices

In this paper, algorithms for computing the minimal polynomial and the common minimal polynomial of resultant matrices over any field are presented by means of the approach for the Gröbner basis of the ideal in the polynomial ring, respectively, and two algorithms for finding the inverses of such matrices are also presented. Finally, an algorithm for the inverse of partitioned matrix with resultant blocks over any field is given, which can be realized by CoCoA 4.0, an algebraic system over the field of rational numbers or the field of residue classes of modulo prime number. We get examples showing the effectiveness of the algorithms.