Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore the cryptanalytic technique of hill-climbing in this 34-minute conference talk from Electronic Frontiers Forums at DragonCon, where cryptographer Elonka Dunin demonstrates how this computational method is being applied to crack historical ciphers. Learn about the fundamental principles of hill-climbing algorithms and their specific applications in cryptanalysis, understanding how these techniques systematically search for optimal solutions when breaking encrypted messages. Discover the successes and limitations of hill-climbing approaches in solving historical cryptographic puzzles, while gaining insight into the ongoing challenges faced by cryptanalysts working with unsolved historical ciphers. Gain practical knowledge about how modern computational techniques are being used to unlock secrets from the past, making this presentation valuable for anyone interested in cryptography, historical puzzle-solving, or computational problem-solving methods.
