ACE2012 Enigma Turing Uncategorized

Optimal Stecker Combinations on an Enigma #ACE2012

I attended the ACE2012 conference over the weekend, and the issue of the stecker patching on the front of the Enigma came up.  The Germans used 10 stecker cables to cross connect 20 letters in the Enigma.  It was presented that the 10 cables that the Germans used was the most mathematically complex combination that can be used.  However, it is not!

The optimal number of stecker cables is, in fact, 11 which would increase the complexity of the Enigma by just over 36% (as the table below shows).

It is believed that the reason the Germans chose 10 instead of 11 was in part due to the physical difficult of squeezing an eleventh cable in the confined space at the front of the Enigma; and perhaps, the increased possibility of operator error.  Additionally, the Germans could have made life more interesting by increasing the combination from 150 billion to over 500 billion by having a variable number of stecker pairs instead of the fixed 10.

The formula and the mathematical results are here:
In Microsoft Excel terms, the formula looks like this:
=FACT(26)/(FACT()*FACT((26-2*))*2^) where is the number of cables in the second column

If you want more information on this, then the excellent cryptomusem site at has the same maths on show, along with a lot more information on the Enigma and other crypto devices.

By P J Bryant

Ramblings of a freelance IT Consultant working for some nice SME's, large organisations, resellers and the usual friends and family! Bit of

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s