← All problemsSign in

Semusa Modified Cipher

Problem Description Semusa assigned numbers to the English alphabets in consecutive order as A-1, B-2, C-3........Z-26 to encrypt a message given in string of letters. He developed a very unique cryptosystem which required an authentication text every time a user want it to use it to transit information securely. The authentication text was developed on a mathematical series and the cryptosyste

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start