Related Concepts
Background
The Legendre symbol was introduced by A.M. Legendre in 1798.
Definition
The Legendre symbol of an integer x modulo a prime p is 0 if x is divisible by p, and otherwise + 1 if x has a square root modulo p, and − 1 if not.
Theory
Let p be an odd prime number and let x be an integer. If x is a quadratic residue, i.e., if x is relatively prime to p and the equation (Modular arithmetic)
has an integer solution y, then the Jacobi symbol of x modulo p, written as (x ∕ p) or \(\left (\frac{x} {p}\right )\), is + 1. If x is a quadratic nonresidue – i.e., x is relatively prime to p and has no square roots – then its Legendre symbol is − 1. If x is not relatively prime to p then \(\left (\frac{x} {p}\right ) = 0\).
The Legendre symbol may be efficiently computed using the Quadratic Reciprocity Theorem or by modular exponentiation (Exponentiation Algorithms) as
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this entry
Cite this entry
Kaliski, B. (2011). Legendre Symbol. In: van Tilborg, H.C.A., Jajodia, S. (eds) Encyclopedia of Cryptography and Security. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-5906-5_418
Download citation
DOI: https://doi.org/10.1007/978-1-4419-5906-5_418
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5905-8
Online ISBN: 978-1-4419-5906-5
eBook Packages: Computer ScienceReference Module Computer Science and Engineering