default search action
"Lower bounds on the linear complexity of the discrete logarithm in finite ..."
Wilfried Meidl, Arne Winterhof (2001)
- 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.