netfri25 / israeli-id-validation Goto Github PK

Scripts to verify an Israeli ID in different languages | קטעי קוד לאימות תעודת זהות ישראלית בשפות תכנות שונות

• The Luhn Algorithm
• Why was this project started
• Contributing
• License
• Authors

The Luhn algorithm, also known as the "modulus 10" or "mod 10" algorithm, 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 US, Canadian Social Insurance Numbers, and more. It was created by IBM scientist Hans Peter Luhn in the late 1950s.

The algorithm is used to validate the Israeli ID number. The ID number is a 9 digit number, the last digit is a check digit. The check digit is calculated using the Luhn algorithm.

This repository was created by Itamar Itzhaki as a resource to help developers implement the Luhn algorithm to check and validate Israeli IDs in different programming languages. It currently includes examples in JavaScript, Go, Java, C, C++, Ruby, Swift, and more.

If you would like to contribute examples in other languages, please fork the repository and submit a pull request with your changes. Make sure to include a brief explanation of the language and any specific nuances of the implementation.

1. Fork the Project
2. Create your Feature Branch (git checkout -b feature/NewLanguage)
3. Commit your Changes (git commit -m 'Add some NewLanguage')
4. Push to the Branch (git push origin feature/NewLanguage)
5. Open a Pull Request

This repository is licensed under the GPLv2 license, which means that it is free to use, distribute, and modify as long as any derivative works are also released under the GPLv2 license. This promotes collaboration and sharing of knowledge among developers and ensures that the code remains open and accessible to all.

• Itamar Itzhaki - Full Stack Developer - Itamar Itzhaki - Started the project