"Lower bounds on the linear complexity of the discrete logarithm in finite ..."

Wilfried Meidl, Arne Winterhof (2001)

> Home

Details and statistics

DOI: 10.1109/18.959261

access: closed

type: Journal Article

metadata version: 2020-09-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tit/MeidlW01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tit/MeidlW01
Wilfried Meidl, Arne Winterhof:
Lower bounds on the linear complexity of the discrete logarithm in finite fields. IEEE Trans. Inf. Theory 47(7): 2807-2811 (2001)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.