Polynomial interpolation of the discrete logarithm

被引：20
|
作者：
Winterhof, A [1 ]
机构：
[1] Austrian Acad Sci, Inst Discrete Math, A-1010 Vienna, Austria
来源：
DESIGNS CODES AND CRYPTOGRAPHY | 2002年 / 25卷 / 01期
关键词：
discrete logarithm; finite fields; degree of polynomials; weight of polynomials;
D O I：
10.1023/A:1012556500517
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Recently, Coppersmith and Shparlinski proved several results on the interpolation of the discrete logarithm in the finite prime field F-p by polynomials modulo p and modulo p-1, respectively. In this paper most of these results are extended to arbitrary F-p(r).
引用
收藏
页码：63 / 72
页数：10
相关论文
共 50 条
  • [1] Polynomial Interpolation of the Discrete Logarithm
    Arne Winterhof
    [J]. Designs, Codes and Cryptography, 2002, 25 : 63 - 72
  • [2] Incomplete character sums and polynomial interpolation of the discrete logarithm
    Niederreiter, H
    Winterhof, A
    [J]. FINITE FIELDS AND THEIR APPLICATIONS, 2002, 8 (02) : 184 - 192
  • [3] Polynomial Interpolation of the k-th Root of the Discrete Logarithm
    Meletiou, Gerasimos C.
    [J]. ALGEBRAIC INFORMATICS, 2009, 5725 : 318 - 323
  • [4] Interpolation of the double discrete logarithm
    Meletiou, Gerasimos C.
    Winterhof, Arne
    [J]. ARITHMETIC OF FINITE FIELDS, PROCEEDINGS, 2008, 5130 : 1 - 10
  • [5] Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem
    Kiltz, E
    Winterhof, A
    [J]. DISCRETE APPLIED MATHEMATICS, 2006, 154 (02) : 326 - 336
  • [6] On Polynomial Approximation of the Discrete Logarithm and the Diffie—Hellman Mapping
    Don Coppersmith
    Igor Shparlinski
    [J]. Journal of Cryptology, 2000, 13 : 339 - 360
  • [7] On the hidden discrete logarithm for some polynomial stream ciphers
    Ustimenko, Vasyl
    [J]. 2008 INTERNATIONAL MULTICONFERENCE ON COMPUTER SCIENCE AND INFORMATION TECHNOLOGY (IMCSIT), VOLS 1 AND 2, 2008, : 274 - 278
  • [8] Efficient Noninteractive Polynomial Commitment Scheme in the Discrete Logarithm Setting
    Zhang, Peiheng
    Tang, Min
    Susilo, Willy
    Zhang, Mingwu
    [J]. IEEE INTERNET OF THINGS JOURNAL, 2024, 11 (05): : 8078 - 8089
  • [9] On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping
    Coppersmith, D
    Shparlinski, I
    [J]. JOURNAL OF CRYPTOLOGY, 2000, 13 (03) : 339 - 360
  • [10] Finding low-weight polynomial multiples using discrete logarithm
    Didier, Frederic
    Laigle-Chapuy, Yann
    [J]. 2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7, 2007, : 1036 - +
12345