Re: Is there any COBOL program for verify the SSN?

HeyBub wrote:
Kellie Fitton wrote:

Hi HeyBub,

I think you are hallucinating. :-)

Modulus 11 is NOT the same as Modulo 11. Modulus 11 is one
of the most efficient systems for detecting transcription errors
and transpositions. The following weblinks will explain the main
differences and why Modulo 11 has the "X" alpha character:

http://www.activebarcode.com/codes/checkdigit/modulo11.html

http://www.eclectica.ca/howto/modulus-11-self-check.php

http://docs.hp.com/en/32209-90024/apds02.html

Kellie.

The links you provide show HOW to calculate a modulo-11 check-digit, not whether it's worth anything.

A modulo-11 check-digit is NOT the most efficient of the varying schemes, nor is it the most robust at detecting common errors. The standard modulo-10 with weighting factors of 1-3-1-3-1... has been demonstrated to detect more errors than the modulo-11 with weights of 0-9-8-7... as is found in the ISBN.

Consequently, the latter is almost universally used: in the UPC, EAN, credit cards, my recipe file, etc.

I can't give you a reference, but I recall reading such in either the Journal of the American Mathematical Society or the Journal of the Association of Computing Machinery (or similar) many years ago.



http://en.wikipedia.org/wiki/Luhn_algorithm

***begin quote ***
The Luhn algorithm or Luhn formula, 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 and Canadian Social Insurance Numbers. It was created by IBM scientist Hans Peter Luhn and described in U.S. Patent 2,950,048 , filed on January 6, 1954, and granted on August 23, 1960.

The algorithm is in the public domain and is in wide use today. 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 collections of random digits.

The Luhn algorithm will detect any single-digit error, as well as almost all transpositions of adjacent digits. It will not, however, detect transposition of the two-digit sequence 09 to 90 (or vice versa). Other, more complex check-digit algorithms (such as the Verhoeff algorithm) can detect more transcription errors.

***end quote***

--
http://arnold.trembley.home.att.net/
.

Relevant Pages

  • Re: Rabin vs. RSA/ElGamal
    ... roots for me modulo your modulus, ... But then, so is "raw RSA". ... permutation into a full-blown public-key encryption scheme. ... or cubing modulo N -- a building block, not something it makes sense to ...
    (sci.crypt)
  • Re: [QUIZ] Modular Arithmetic (#179)
    ... one less than the modulus. ... we must use the appropriate congruent value modulo 24. ... While most operations will be straightforward, modular division is a ... def coerce ...
    (comp.lang.ruby)
  • Re: RSA Private Key representation
    ... Use the secret exponent to factor the modulus. ... factor the modulus if we have the public key and the private key ... Modulo n, we have four square roots of one, 1, -1, and two ... if we can find a non-trivial square root of one modulo n, ...
    (sci.crypt)
  • Re: Summation, modulo and decimal
    ... >I'm trying to use the modulo (modulus, mod, %) to do the following: ... >The problem is that modulo is only def. ... It not worked because before it shift the ... >digit to the left the number is added to the previous value, so, I used ...
    (sci.math)
  • Re: How do I do this problem without a calculator?
    ... in response to what Chip Eastham wrote: ... You might want Euler's generalization of Fermat's Little Thm. ... to find the reduced nonnegative residue mod 22), the modulus ... would be to consider the computation modulo 2 and again ...
    (sci.math)