Abstract
For a polynomial \(f(X) \in \mathbb{Z}[X]\) we consider Boolean functions producing the second leftmost bit of ⌊f(x)⌋ p from the bit representation ofxand obtain a lower bound on their sensitivity. 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
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Basel AG
About this chapter
Cite this chapter
Shparlinski, I. (2003). Trade-off Between the Boolean and Arithmetic Depths of Modulo p Functions. In: Shparlinski, I. (eds) Cryptographic Applications of Analytic Number Theory. Progress in Computer Science and Applied Logic, vol 22. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-8037-4_30
Download citation
DOI: https://doi.org/10.1007/978-3-0348-8037-4_30
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-0348-9415-9
Online ISBN: 978-3-0348-8037-4
eBook Packages: Springer Book Archive