FACTORING FOR THE PLUGBOARD – WAS REJEWSKI'S PROPOSED SOLUTION FOR BREAKING THE ENIGMA FEASIBLE?

@article{Lawrence2005FACTORINGFT,
  title={FACTORING FOR THE PLUGBOARD – WAS REJEWSKI'S PROPOSED SOLUTION FOR BREAKING THE ENIGMA FEASIBLE?},
  author={John Lawrence},
  journal={Cryptologia},
  year={2005},
  volume={29},
  pages={343 - 366}
}
We prove a generalization of a theorem of Rejewski. This theorem shows how one can solve an equation of the form XY=α in a symmetric group, where α is a given permutation and X and Y are each of order two with a specified number of disjoint transpositions. The number of solutions is also part of the theorem. Using this theorem we outline what we believe was the Polish solution (or very close to it) to the Enigma assuming that one had no data from daily keys. With some assumptions on… 
2 Citations

Polish Mathematicians Finding Patterns in Enigma Messages

This is a story about heroes. Its heroes are three Polish mathematicians who in the decade before World War II broke German Enigma messages. It seems rare that mathematicians are heroes of stories,

Review of Memories of My Work at the Cipher Bureau of the General Staff Second Department 1930–1945 by Marian Rejewski

TLDR
The year 2010 marked the thirtieth anniversary of the death of Marian Rejewski, and to honor him and his colleagues Jerzy Rozycki and Henryk Zygalski, AdamMickiewicz University Press decided to publish in book from two of his typed manuscripts.