A review on mathematical strength and analysis of Enigma
April 17, 2020 ยท The Cartographer ยท ๐ arXiv.org
"No code URL or promise found in abstract"
"Title-pattern auto-detect: A review on mathematical strength and analysis of Enigma"
Evidence collected by the PWNC Scanner
Authors
Kalika Prasad, Munesh Kumari
arXiv ID
2004.09982
Category
cs.CR: Cryptography & Security
Cross-listed
math.HO
Citations
3
Venue
arXiv.org
Last Checked
4 days ago
Abstract
In this review article, we discussed the Mathematics and mechanics behind the Enigma machine with an analysis of security strength. The German army used the Enigma machine during the second world war to encrypt communications. Due to its complexity, the encryption done by the Enigma Machine was assumed to be almost unbreakable. However, the Polish believed that people with good background and deep knowledge of science and mathematics would have a better chance to break the encryption done by Enigma. They appointed twenty mathematicians from Poznan University to work on this problem at the Polish Cipher Bureau. Three of those, Marian Rejewski, Jerzy Rozycki and Henryk Zygalski were able to exploit certain flaws in the encryption, and by using permutation group theory finally managed to decipher the Enigma messages. The mathematics discovered by them is presented here.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
๐ Similar Papers
In the same crypt โ Cryptography & Security
R.I.P.
๐ป
Ghosted
R.I.P.
๐ป
Ghosted
The Limitations of Deep Learning in Adversarial Settings
R.I.P.
๐ป
Ghosted
Distillation as a Defense to Adversarial Perturbations against Deep Neural Networks
R.I.P.
๐ป
Ghosted
Spectre Attacks: Exploiting Speculative Execution
R.I.P.
๐ป
Ghosted
How To Backdoor Federated Learning
R.I.P.
๐ป
Ghosted