Using C_<ab> Curves in the Function Field Sieve
スポンサーリンク
概要
- 論文の詳細を見る
In Adleman's Function Field Sieve algorithm solving the discrete logarithm problem in a finite field, it is assumed that a random bivariate polynomial in the certain class is absolutely irreducible with high probability. In this letter we point out that if we use C_<ab> type random polynomials then we always get absolutely irreducible polynomials. We can also simplify the calculation of a product of many rational functions on a curve that belongs to the field of definition by the use of a C_<ab> curve.
- 社団法人電子情報通信学会の論文
- 1999-03-25
著者
-
Matsumoto Ryutaroh
Department Of Communications And Integrated Systems Tokyo Institute Of Technology
関連論文
- Key Rate Available from Mismatched Measurements in the BB84 Protocol and the Uncertainty Principle
- Secret Key Agreement by Soft-Decision of Signals in Gaussian Maurer's Model
- An Improved Bound for the Dimension of Subfield Subcodes
- Decodability of Network Coding with Time-Varying Delay and No Buffering
- Strongly Secure Privacy Amplification Cannot Be Obtained by Encoder of Slepian-Wolf Code
- Two Methods for Decreasing the Computational Complexity of the MIMO ML Decoder(Communication Theory)(Information Theory and Its Applications)
- On the Feng-Rao Bound for the L-construction of Algebraic Geometry Codes
- Using C_ Curves in the Function Field Sieve
- Construction Algorithm for Network Error-Correcting Codes Attaining the Singleton Bound(Information Theory and Its Applications)
- Linear Codes on Nonsingular Curves are Better than Those on Singular Curves
- Secret Sharing Schemes Based on Linear Codes Can Be Precisely Characterized by the Relative Generalized Hamming Weight