Abstract
Abstract Recently, Shparlinski proved several results on the interpolation of the discrete logarithm in finite prime fields by Boolean functions. In this extended abstract we present extensions to arbitrary finite fields of odd characteristic. More precisely, we sketch the proofs of some complexity lower bounds for Boolean functions representing the least significant bit of the discrete logarithm in a finite field.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
