Luhn algorithm
The Luhn algorithm or Luhn formula, also known as the "modulus 10" or "mod 10" algorithm, named after its creator, IBM scientist Hans Peter Luhn, is a simple checksum formula used to validate a variety of identification numbers, such as credit card numbers, IMEI numbers, National Provider Identifier numbers in the United States, Canadian Social Insurance Numbers, Israeli ID Numbers, South African ID Numbers, Swedish National identification numbers, Swedish Corporate Identity Numbers (OrgNr), Greek Social Security Numbers (ΑΜΚΑ), SIM card numbers, European patent application number and survey codes appearing on McDonald's, Taco Bell, and Tractor Supply Co. receipts. It is described in U.S. Patent No. 2,950,048, granted on August 23, 1960.
- Ability105616246
- Abstraction100002137
- Act100030358
- Activity100407535
- Agent
- Algorithm105847438
- Cognition100023271
- Event100029378
- Know-how105616786
- Method105660268
- Procedure101023820
- PsychologicalFeature100023100
- Rule105846932
- WikicatAlgorithms
- WikicatAuthenticationMethods
- WikicatChecksumAlgorithms
- WikicatNumberTheoreticAlgorithms
- YagoPermanentlyLocatedEntity
- Comment
- enThe Luhn algorithm or Luhn formula, also known as the "modulus 10" or "mod 10" algorithm, named after its creator, IBM scientist Hans Peter Luhn, is a simple checksum formula used to validate a variety of identification numbers, such as credit card numbers, IMEI numbers, National Provider Identifier numbers in the United States, Canadian Social Insurance Numbers, Israeli ID Numbers, South African ID Numbers, Swedish National identification numbers, Swedish Corporate Identity Numbers (OrgNr), Greek Social Security Numbers (ΑΜΚΑ), SIM card numbers, European patent application number and survey codes appearing on McDonald's, Taco Bell, and Tractor Supply Co. receipts. It is described in U.S. Patent No. 2,950,048, granted on August 23, 1960.
- Depiction
- Has abstract
- enThe Luhn algorithm or Luhn formula, also known as the "modulus 10" or "mod 10" algorithm, named after its creator, IBM scientist Hans Peter Luhn, is a simple checksum formula used to validate a variety of identification numbers, such as credit card numbers, IMEI numbers, National Provider Identifier numbers in the United States, Canadian Social Insurance Numbers, Israeli ID Numbers, South African ID Numbers, Swedish National identification numbers, Swedish Corporate Identity Numbers (OrgNr), Greek Social Security Numbers (ΑΜΚΑ), SIM card numbers, European patent application number and survey codes appearing on McDonald's, Taco Bell, and Tractor Supply Co. receipts. It is described in U.S. Patent No. 2,950,048, granted on August 23, 1960. The algorithm is in the public domain and is in wide use today. It is specified in ISO/IEC 7812-1. It is not intended to be a cryptographically secure hash function; it was designed to protect against accidental errors, not malicious attacks. Most credit cards and many government identification numbers use the algorithm as a simple method of distinguishing valid numbers from mistyped or otherwise incorrect numbers.
- Hypernym
- Formula
- Is primary topic of
- Luhn algorithm
- Label
- enLuhn algorithm
- Link from a Wikipage to an external page
- rosettacode.org/wiki/Luhn_test_of_credit_card_numbers
- Link from a Wikipage to another Wikipage
- Algorithm
- Canada
- Category:1954 introductions
- Category:Articles with example pseudocode
- Category:Articles with example Python (programming language) code
- Category:Checksum algorithms
- Category:Error detection and correction
- Category:Modular arithmetic
- Checksum
- Cryptographic hash function
- Damm algorithm
- File:McDonalds Receipt Luhn Algorithm.png
- File:Taco Bell Receipt Luhn Algorithm.png
- File:Tractor Supply Receipt Luhn Algorithm.png
- Greece
- Hans Peter Luhn
- IBM
- IEC 7812-1
- International Mobile Equipment Identity
- Israeli identity card
- Luhn mod N algorithm
- Modular arithmetic
- National identification number
- National Provider Identifier
- Payment card number
- Public domain
- Social Insurance Number
- South Africa
- Sweden
- Verhoeff algorithm
- SameAs
- 53hPB
- Algoritma Luhn
- Algoritme de Luhn
- Algoritmo de Luhn
- Algoritmo de Luhn
- Algorytm Luhna
- Formula di Luhn
- Formule de Luhn
- Luhn algorithm
- Luhn-Algorithmus
- Luhn-algoritmen
- Luhn alqoritmi
- Luhn-formula
- Luhnin algoritmi
- Luhnův algoritmus
- Luhnアルゴリズム
- Lūna algoritms
- Luno formulė
- Lunov algoritam
- m.02s9q9
- MOD10
- Q915402
- Thuật toán Luhn
- Αλγόριθμος του Λουν
- Алгарытм Луна
- Алгоритм Луна
- Алгоритм Луна
- Լունայի ալգորիթմ
- الگوریتم لان
- خوارزمية لوهن
- 卢恩算法
- 룬 알고리즘
- Subject
- Category:1954 introductions
- Category:Articles with example pseudocode
- Category:Articles with example Python (programming language) code
- Category:Checksum algorithms
- Category:Error detection and correction
- Category:Modular arithmetic
- Thumbnail
- WasDerivedFrom
- Luhn algorithm?oldid=1122466100&ns=0
- WikiPageLength
- 7199
- Wikipage page ID
- 582440
- Wikipage revision ID
- 1122466100
- WikiPageUsesTemplate
- Template:Short description
