Hello Gents,
I am working on a project that requires me to scan codes in and determine if they are valid. This is similar to a software license key, although I will not have access to the internet for validation.
For this project I may have several hundred thousand codes that get scanned. Originally I wanted to use an SD card to store a master list of valid codes. This will work, but the read/write times are enormous for my controller (Atmel328p).
Instead I wish to create algorithm that checks a security code and determines if it is valid. I believe this is much faster.
It could be as simple as having four 5 digit groups like this: abcde-fghij-klmno-pqrst. Then look for relationships like f + k + p should equal "a". This means 8xxxx-2xxxx-4xxxx-2xxxx is accepted as well as 8xxxx-1xxxx-0xxxx-7xxxx. This just just a simple example. I am looking for something that is more robust, maybe something that checks prime numbers in various positions.
So far I haven't found too many resources on this. Any help would be much appreciated.