Abstract
For a polynomial f(X) ∈ ℤ[X] we consider Boolean functions producing the second leftmost bit of the smallest non-negative residues of f(x) modulo p from the bit representation of x and obtain a lower bound on their sensitivity (see Chapter 6 for the definition of this notion). Then a similar but a weaker bound is obtained for the sensitivity of Boolean functions producing the second leftmost bit of rational functions modulo p.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Basel AG
About this chapter
Cite this chapter
Shparlinski, I. (1999). Trade-off between the Boolean and Arithmetic Depths of Modulo p Functions. In: Number Theoretic Methods in Cryptography. Progress in Computer Science and Applied Logic, vol 17. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-8664-2_10
Download citation
DOI: https://doi.org/10.1007/978-3-0348-8664-2_10
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-0348-9723-5
Online ISBN: 978-3-0348-8664-2
eBook Packages: Springer Book Archive