Take the 2-minute tour ×
Cryptography Stack Exchange is a question and answer site for software developers, mathematicians and others interested in cryptography. It's 100% free, no registration required.

I'm designing an id obfuscation system. My system includes:

  1. Embedded chips, each chip has a unique 32-bit address (id).
  2. Server
  3. Insecure low-bandwidth unstable one-way channels from the chips to the server.

The chips send messages to the server over the insecure channel. The messages are simple "I'm alive" notifications. There is no meaning to forging messages (no benefit to the attacker). The server should be able to recover which chip sent which message. However, I don't want attackers to be able to trace specific chips for long period of times, i.e., the messages should not contain the chip's id, but an obfuscated id, which should change once in a while (in my case every ~5 minutes on average). In my case, $2^{16}$ different obfuscated ids per chip are enough (the obfuscated ids will repeat every ~227 days).

One way to obfuscate the id is to encrypt the id together with a counter. For example, use a 48-bit block cipher to encrypt the concatenation of the 32-bit id with a 16-bit counter, that increases every ~5 minutes. I don't know of any 48-bit block cipher, but 64-bit block-ciphers, such as Blowfish and Skipjack, can also be used: by encrypting the concatenation of the 32-bit id with a 16-bit counter and some fixed 16-bit value (could be zeros).

However, there are two more requirements:

  1. The encryption secret key must not be saved on the chips - Some of them may fall into the wrong hands and be reverse-engineered.
  2. Asymmetric encryption cannot be used ... They take too much time and create too large outputs (over 64-bit).

This means that all the obfuscated ids must be pre-calculated and saved on the chip. It also means that using a 64-bit block-cipher will consume 33% more space on the chip than a 48-bit block-cipher.

Since I don't know of any commonly used 48-bit block cipher, I had the following idea. For each each, encrypt all concatenations of the 32-bit id with any 32-bit value. Save on each chip only the results that end with 16 zero bits (obviously, without last 16 zero bits of each obfuscated id). There should be around ${2^{32}}/{2^{16}}$ such obfuscated ids for each chip, which is exactly the amount I need.

The server will receive the 48 bit obfuscated id, pad it with 16 zero bits, decrypt, and slice the first 32-bits of the result to recover the chip's real id.

The only flaw is that the pre-calculation of the obfuscated ids for each chip is time consuming.

Can you see any flaws in my algorithm, besides that? Do you have any suggestions to improve it?

Another approach was to use 32-bit block ciphers (skip32), and call them several times so all the 48-bits are used. However, from what I learned, 32-bit block ciphers are considered obsolete.

Furthermore, if you have any suggestion that includes a stream cipher, please notice that the channels are unstable and messages may drop - CBC mode will not be recoverable on the server side. CTR mode that includes sending the counter is also problematic, because an attacker can trace a chip merely by watching the counter in the messages - if a message's counter is 123, and 5 minutes later I see a message with a counter of 124, it probably originated from the same chip (syncing all chips is not practical).

share|improve this question
Nice! I can pick as many keys and round functions (hardware aes128 first bit) as I want. How many rounds would be "enough" for my 48bit case? I saw in iacr.org/conferences/crypto2012/slides/1-1-Morris.pdf that for a $10^16$ space they used 500 rounds. $2^48$ is slightly below that. Would 500 rounds be enough? –  Ozo Aug 17 '14 at 2:21
You can obviously store a unique ID on each chip. Why not store a unique per-chip encryption key using the same mechanism? –  Stephen Touset Aug 17 '14 at 3:01
Also, you may want to take a second look at asymmetric encryption. Modern ECC like Curve25519 is much faster than RSA, and can be used to derive a shared symmetric secret. –  Stephen Touset Aug 17 '14 at 3:02
@Ozo : $\:$ That depends mainly on how many encryptions and decryptions you might do. $\;\;\;\;$ –  Ricky Demer Aug 17 '14 at 4:30

2 Answers 2

You are over-thinking about cryptography. It's not supposed to be that complex.
I started with the idea "let make 1 chip have multiple id".
And I come up with something relatively simple than what you mentioned so far. (I'm not sure if this usable in your situation or not. It's just based on the info you described.)

Prepare: I will make every chip have unique id and a counter like you mentioned.
Setup: When a chip is registered to the server I will make the server generate keyed hash using unique id as key and counter as message but instead of generate just 1 hash from the current value of counter let say I generate 5,000 consecutive hash start from the current value of counter and store generated hashes in the database.
Identify(chip): Instead of directly send the unique id to the server just send keyed hash with the same algorithm as hashes generated on the server then increase the counter in the chip.
Identify(server): The server can determine the chip id just by querying the database with received hash. (This operation should be very fast since hash value can be indexed.) From this querying the server should know the counter value inside the chip too not just the unique id. The server can now delete current and older hash from the database. If hashes in the database for a chip fall below (say) 2,000 the server will generate consecutive hash to fill 5,000 hash pool.

That's the overview. It's seem like I missed 64-bit communication chunk constrain. (Thanks to Ricky Demer for pointing it out.)
To address that issue: the hash used should no longer than 64-bit.
Just allow hash collision happen in the database we can simply don't use hash as the primary key.
When the chip send collision hash just ignore that and wait for the next sample. If the missing sample is significant in some way we can assume that next hash will have the same chip as the owner hence we can pin point which chip send the previous hash. (If it still undecidable just wait for next one.)
Or we can also assumed that the chip that just appear with the collision hash is not the one who send the hash.

This idea is derived from what you mentioned about the counter that leak chip identity in some way but now we use it on the server.
And that's it I will do it this way if no one point out any flaw in this approach (which I myself cant see).

share|improve this answer
Your way runs into the birthday problem. $\;$ –  Ricky Demer Aug 18 '14 at 4:01
@RickyDemer Which mean I'll find secure hash collision? That still so cool in a way. no? –  Curious Sam Aug 18 '14 at 8:28
No, it means you'll find a secure short-output PRF collision, which is not impressive. $\hspace{1.32 in}$ –  Ricky Demer Aug 18 '14 at 8:36
@RickyDemer Why it is short-output PRF? There is no hash length constrain in his specification. –  Curious Sam Aug 18 '14 at 8:44
Mainly because he doesn't give a specification. $\:$ On the other hand, his system includes "Insecure low-bandwidth unstable one-way channels", and one of his requirements refers to "create too large outputs (over 64-bit)". $\;\;\;\;$ –  Ricky Demer Aug 18 '14 at 8:57
up vote 0 down vote accepted

OK, here's the node.js module that I wrote based on the swap-or-not algorithm in the papers of the first comment (by Ricky Demer). It requires the Long module. It supports inputs up to 63 bits (there are plenty of algorithms for 64 bits and above). Inputs and outputs should be Long objects.

The $K_i$'s are chosen using an aes-256-ctr pseudo-random stream. The $F_i$ round functions take the first bit of an sha-256 of the input with a prefix (each $F_i$ gets its own prefix from the same aes-256-ctr pseudo-random stream). Using sha-256 just for a single bit may be an overkill (if you have other suggestions, please post in the comments).

DISCLAIMER: I don't know about any legal issues regarding the copyrights of the algorithm and the papers. Verifying that you have the rights is on your own responsibility. I'm also not accountable for any security bug in the code.

var crypto = require('crypto');
var Long = require('long');

function pseudoRandomStream(key, iv) {
  var cipher;
  if (typeof iv === 'undefined') {
    cipher = crypto.createCipher('aes-256-ctr', key);
  } else {
    cipher = crypto.createCipheriv('aes-256-ctr', key, iv);
  var totalLength = 0;

  return function(length) {
    if (totalLength + length > 1000000) {
      throw new Error("This pseudo-random stream is unsafe after 1 MB");
    totalLength += length;
    cipher.write(new Buffer(new Array(length)));
    return cipher.read(length);

function createRoundFunction(padding) {
  if (!Buffer.isBuffer(padding)) {
    padding = new Buffer(padding);
  var writeOffset = padding.length;
  var buf = new Buffer(writeOffset + 8);

  return function(x) {
    buf.writeInt32LE(x.low, writeOffset);
    buf.writeInt32LE(x.high, writeOffset + 4);
    var hash = crypto.createHash('sha256');
    return ((hash.digest()[0] & 1) == 1);

// iv is optional - treats key as password in createCipher
function SwapOrNot(bits, rounds, key, iv) {
  if (bits > 63) {
    throw new Error("This module supports up to 63 bits");
  var randomBuffer = pseudoRandomStream(key, iv);
  var mask = Long.UONE.shiftLeft(bits).subtract(Long.UONE);
  var K_F_pairs = [];

  for (var i = 0; i < rounds; i++) {
      "K": (new Long(randomBuffer(4).readInt32LE(0), randomBuffer(4).readInt32LE(0), true)).and(mask),
      "F": createRoundFunction(randomBuffer(24))

  this.run = function(val, reverse) {
    var reduce = ((reverse)?Array.prototype.reduceRight:Array.prototype.reduce);
    return reduce.call(K_F_pairs, function(x, pair) {
      var xTag = x.xor(pair.K);
      var xHat = ((x.greaterThan(xTag))?x:xTag);
      return ((pair.F(xHat))?xTag:x);
    }, mask.and(val));

// high is optional
SwapOrNot.prototype.encrypt = function(val, high) {
  if (typeof high !== 'undefined') {
    val = new Long(val, high, true);
  return this.run(val, false);

// high is optional
SwapOrNot.prototype.decrypt = function(val, high) {
  if (typeof high !== 'undefined') {
    val = new Long(val, high, true);
  return this.run(val, true);

module.exports = SwapOrNot;


var SwapOrNot = require('./swap-or-not');
var cipher = new SwapOrNot(48, 500, 'secret');
console.log('Encrypting 7: ' + cipher.encrypt(7)); 
// Encrypting 7: 4744786956382
console.log('Decrypting 4744786956382: ' + cipher.decrypt(4744786956382)); 
// Decrypting 4744786956382: 7
console.log('Encrypting low-12345678 high-102: ' + cipher.encrypt(12345678, 102)); 
// Encrypting low-12345678 high-102: 28599712632087
console.log('Decrypting 28599712632087: ' + JSON.stringify(cipher.decrypt(28599712632087))); 
// Decrypting 28599712632087: {"low":12345678,"high":102,"unsigned":true}
share|improve this answer
So, is sha-256 an overkill? –  Ozo Aug 18 '14 at 20:03
What programming language is that? $\:$ Will the lengths of x.low ever be different for the same key? $\:$ What about the lengths of x.high? $\;\;\;\;$ –  Ricky Demer Aug 18 '14 at 20:09
Javascript. x.low and x.high are 32-bit signed numbers. –  Ozo Aug 18 '14 at 20:27
Well, now I notice that in the case of 48 bits (6 bytes), the input of the sha-256 will always end with 2 zero bytes. Not a big deal. –  Ozo Aug 18 '14 at 20:41

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.