i want implement algorithm / function (a kind of license algorithm), let's call f1, returns fixed key full range of input values, mac addresses. , implement inverse function (say f2), should return true if 2 inputs are: - generated key f1 - valid input mac address belongs address range provided f1
to more specific why want do: i'm implementing sw code bt (bluetooth) platforms (chips / modules) should work on specific range of bt mac addresses. user should provide range of bt addresses (i.e. start address - end address), using f1 should provide him license key (with fixed value bt addresses).
then during mp (mass production) of bt modules, module manufacturer shall store key in eeprom on module.
at module power-up, function f2 should read value of key in eeprom (as input 1), & read bt mac address of module (as input 2), should return true if address belongs bt address range used generating key f1.
- any ideas?
- where should start reading? keywords?
hmm, let's have 2 different overlapping ranges, r1 , r2, 2 different keys provided f1 function, k1 , k2. then, f2 should return true if reads either k1 or k2 mac address in overlap, right? in case, need f1 reverse-encryptable algorithm takes start&end or start&mask (if approppriate) , turns "passphrase" key, f2 use either same key or private key decrypt stored value, parse output vs mac , return if it's inside range. so, think 1 of solutions encryption/decryption via asymmethric keys, 1 use private , encrypting ranges, other provide public (as it'll stored explicitly somewhere used in f2) manufacturer decrypt encrypted range.
Comments
Post a Comment