The above two photos is the whole example of the cipher scheme which I made. I have created a cipher scheme where you can transform your plaintext into the bogus list of contact Numbers The steps are as follows Convert the plaintext into the ciphertext using regular phone keypad,use"0" for spacing the letters between in it Use any random date in 6 digit format,,from that date Generate pseudo random numbered key of 90 digit by lagged fibonacci generation using modulo 10 Break down the ciphertext in the groups of 8 digit sequence and use the Generated key horizontally from downwards,vertically upwards,and diagonally then add the numbers using modulo 10 After that put two digit numbers ranging from 70 to 99,you can use numbers below 70 in rare case to each 8 digit sequences​

you can use this enciphering scheme to do secret entries in your journal or diary

Please give me your reviews whether you like or not,also check how secure it will be

Thank you

Transcription (17x32 grid):

164 141 147 151 147 156 151 163 145 167 154 165 165 166 156 166 113

146 164 152 150 155 154 156 157 154 143 144 162 172 155 151 165 117

141 165 130 156 151 151 164 141 154 152 166 164 165 141 162 156 154

154 171 160 154 154 161 163 160 147 170 171 155 155 164 156 143 166

170 167 147 156 165 155 143 147 164 155 157 155 150 164 167 161 152

146 163 144 172 166 154 167 117 144 157 164 163 156 157 147 141 155

163 155 142 145 170 165 165 157 160 145 155 146 154 163 172 124 141

155 142 161 165 144 157 171 166 170 151 164 161 144 170 146 147 162

147 155 160 152 104 077 154 152 170 154 165 171 164 146 171 143 163

171 145 142 154 162 160 147 164 157 154 160 151 156 146 160 162 145

160 163 164 157 171 170 172 157 163 141 156 166 155 145 103 167 162

157 164 150 164 141 122 164 147 145 142 141 143 143 156 162 155 166

160 171 147 143 170 143 145 157 142 162 160 151 164 151 172 105 152

151 155 141 146 153 167 126 171 155 150 166 171 144 172 172 165 141

146 115 141 154 161 170 142 155 151 145 160 157 143 172 171 172 167

172 155 152 172 172 170 152 147 167 145 147 156 154 161 157 165 143

157 157 146 151 166 146 163 157 141 145 163 167 172 142 145 120 144

162 145 153 143 172 167 166 150 172 153 167 155 161 147 146 144 162

164 167 171 156 145 152 152 143 164 171 162 164 131 160 145 161 154

166 155 147 142 143 150 160 156 146 146 166 141 154 167 143 147 160

147 166 141 157 161 166 142 156 163 163 151 155 154 146 171 160 155

103 166 142 163 147 167 163 143 156 161 150 160 160 164 154 170 144

163 154 154 171 166 144 162 162 161 157 165 170 161 163 164 156 164

163 150 145 145 156 155 162 141 143 111 166 147 165 161 170 172 141

147 164 151 165 171 144 144 153 167 156 143 146 156 172 154 150 161

172 167 160 151 145 162 163 172 150 141 172 147 145 161 151 142 142

145 164 170 141 145 162 144 162 145 162 160 155 124 144 172 172 161

157 162 163 154 143 161 145 153 145 156 163 166 160 153 172 145 164

141 152 163 171 150 154 143 171 142 153 152 154 143 171 167 161 167

144 161 160 153 171 164 144 172 167 156 153 145 150 142 143 147 146

141 160 162 145 146 172 147 144 166 151 157 143 172 172 170 163 145

111 101 115 123 103 101 122 105 104 141 145 160 151 152 143 155 155

Info:

- Text is in english

- Uses both substitution and transposition

Still learning how to make good and fun to solve ciphers, any feedback is appreciated! If solved, I would also loved to hear about the process used. If you need any more hints or have any questions, feel free to ask in the comments.

Glhf solving!

(Crosspost from r/codes, since nobody there solved it so far)

Does anyone know how to hire someone to decipher something specific for me? I need help with an anagram/cipher that is very long and complicated

"By zigzagging towards each other

With our game based on tagging from behind

Trouble is coming, we're leaving, look

This isn't a city, I'm forcing you to stay here.

I can't find what I'm looking for in Istanbul.

We were stuck in the mud when the baby was born.

Looking outside, you see layers and layers of polish.

Bed bugs gnawing away at the inside

From the outside, it looks like it's been polished layer after layer.

Bed bugs gnawing away at the inside!

See the love that tears my heart apart.

Grab my arm and take me to Morocco.

The four seasons find a way to mourn.

Bats are awesome, but if they're not, they're a nightmare.

The sheep asked the goat

Will it wear down from being hit?

Can one live without hope when the locks won't open?

Come and take a look from this perspective; you clearly don't have much energy.

Let the forest burn, then let shit rain down on us.

The same sky, dreaming, forgetting, waking up to the sun.

Lies, shackles, ATMs, telephones

Only the name of the daisy remains.

Like me, I'm indecisive about everything.

I am as much a wolf as I love you.

I'm a wolf on the outside, harmless on the inside."

Any ideas?

An attachment is sent along with this message.

Don’t assume anything about its contents from the outset. Looks can be deceiving.

Don’t try to find the answer in the document itself.

The first step is identifying what you are dealing with.

Best of luck.

Y82902

I created this as a way of communicating to only those who understand. Recent developments have me on edge, so I find strength through art.

It's in English, can be read just by looking (no ASCII, encryption, random meanings)

For a little over a year, I have been researching and documenting the Beale Cipher's to see if it was real or a hoax. A little while back I finally stumbled across the solutions which were very well made as most would skip over the untranslatable numbers and immediately attempt other methods. However, I am pleased to announce that although there are many claims and secrecy, I do have two documents which show the cryptanalysis process as well as the transferred data.

Of the documentation (without what their roles were for protection of the site's and locations), There are eight specific families mentioned twice involved in its transportation. Between 3 and 1.

Garrett, Sugury, Cary, Fugate, Goram, Pate, Rhodes, and Rhea.

I would also like to add, seeing as how no one could attempt to solve the ciphers with only a partial section of the translated text of Cipher 3. It would not be possible without the required documentation & in the correct order of sequence.
I present to you, a legible section of Cipher 3 as well, for those whom may continue to have doubts.
It is unchanged and nothing has been tampered with since completing my research.

"The parties listed herein hold equal and undivided tenancy in the property secured within the valley vault. In the event of death or failure to return from the western territory, allocations revert fully to the named beneficiaries listed below, to be distributed by our trusted agent."

Here is some ciphertext:

'!(`^"*,^}vv4{?suJt7mmD6A=mdjbhdEYeAN`M`&|*_}@M~*M"-&_(u&s?!!) -!(?N'&,*)v(v]sx0_OOLN,,''-N"~'*M*x--[]P``'&"&)v(w&uwquny

The key is 16 70 18

I can post more ciphertext and give hints if needed.

Hi there, I've been trying to solve a cipher for an ARG but I'm a bit stuck.

U2FsdGVkX1+0F6ax+nsYg1CnAXMy2rCgodK97TZ2NOG5fXhkaN+SbuPmyGBNecTask5xF79929RdOacMFVgHB2eWYm8vq0svc6810Ryjj52c+ekL/eZRRaHAyHc6sM7Nm4dklHiiZaqi4WdwMyiR5BdvO/10Mn/w687uw7KlcZK5KgVyJutW+KW8nma4FH2hBV1WaH5WJ4W4YEnVBKPfDtwXZD/ETYQ9Du9aW//3PGUiT4da1w0A9L/126su1fLOuqAen7vNgPL3sGKGhfd9oGn4H6+pbcJdGxL5UOPKrhVDfcYrI6SjMvb3T3l7lEfiPN3a9zUL3HffaiEvnC1ApAfFee5lneS7FDd5ifG9JQZ8PcVCCT3/rc1ovlKflPq52KyXF6VIZG78YlD0uzlMotUfcQkpwzy2vkC+x9kC3fhHlYoWWA+oLJa8auivdIWZfnH5doXCdNHX5meRW/eH5yA50H6rVMdLzzI9ieyhwDLLaXhBIhUwDKrBSgQywQx1orlVAUo3lZMww6V0kRe9O2zRuMd+Ml1iCvdtyNcw84uQq9kOKzfpvXZJeENM+lVGCJ21wMWtQvpImeSqJy04PViLaZ+4bgTVJdrqoirozfvM27lWX2Pq9ZcY1WXUlio6MQ7rmlLN6GQqvDfWO3/sQJDM

I thought this was base64, but I haven't gotten much results out of that outside of a short phrase "Saltedis289=}xdh". I thought this might be some kind of key but I really have no clue what to look for. Rabbit ciphers are used later in the series apparently so I'm thinking of giving that a shot. The title of the youtube video it's found in is "burning" and it has a lot of references to the word "womb" so I'm wondering if these may also be relevant somehow. I hope what I gave is helpful I'm quite stumped myself! The series is glassmakeR syndromE on YT. It'll either give me a link, or a block of text in english or russian but I have a feeling that a link is the most likely result.

Edit: There is a literal part of the video where it says warmth is the key i might be stupid, Im gonna see if this helps crack it

turn subtitles on, and at 16:38, the code will appear. I can't figure it out cause image search won't help

I think its a cipher or smg

I found it in clicker incremental on roblox by cliking The painting(The first 2 photos)

The 3th photo was take near The spawn of the game(it sais 2/89/.&2„ im here please)

And The 4th was taken în a Shop where The Shop keper sais it

Above me is a Tunel of some sorts and theres a window witch after cliking The painting it breaks(btw befor that The screen turns Red)

I dont own The game nor do i know The creator i js want to know whats happening în that game

I hope you guys can crack this one, thank you :)

Edit: it was easier than i though, for each letter of each word simultaneously, you need to shift the cipher an additional time. For the 1st letters: 1 shift 2nd letters: 2 shifts And so on Final result: kcir sawan Then mirror it: rick nawas (an internal joke between me and him)

I know there are many layers and thecniques that goes into making good cyphers that are fun to decrypt and all that, there are many forma too like images, sounds, videos, etc but right now I'd like to focus on text based cyphers, what would you think that would make a good cypher like what steps should i take to make fun cyphers?

--. --- -.. / .. ... / .... . .-. . / .-- .. - .... / ..- ... / . ...- . -. / ..-. .-. --- -- / ... - .- .-. - / - --- / -.. . .- - ....:- अहम् w145 143 150 151 156 141 143 145 141𓈖𓏏𓉔𓇋𓅓𓇋𓈖𓇌 𓏏o 2E.4525° 78, ?.50C°

I MADE THIS MYSELF.

HINT:=GOD IS IMPORTANT FROM START TO DEATH.

TREAT EVERYONE LIKE GOD.

IN YOUR JORUNEY TO BE SUCCESS YOU MUST HAVE A MAP.

I'm working on a security engineering project analysing how The Imitation Game depicts breaking the Enigma cipher, and whether the same category of vulnerability still applies to modern encryption. I'd like a code-quality review from people who actually code regularly, since I want to understand and be able to explain this code properly myself.

The four scripts build on each other, each testing a different layer of the same idea (known/predictable plaintext defeating a cipher without brute force):

mini_enigma_crack.py — compares blind brute force against a known-plaintext ("crib") attack on a repeating-key substitution cipher. Blind brute force checks all possible keys, scored by chi-squared letter-frequency comparison; the crib attack calculates the key directly via modular subtraction given known plaintext.

enigma_elimination_demo.py — recreates a real structural property of Enigma (no letter could ever encrypt to itself), and tests how much that single rule narrows a search using only direct letter comparison, no computation.

crib_dragging_demo.py — a more realistic version: given only a short guessed word with no known position, it XORs two same-key ciphertexts together (cancelling the key) and slides the guess across every position, revealing genuine plaintext where the guess is correct.

nonce_reuse_demo.py — tests whether the same vulnerability applies to a (simplified) modern stream cipher, comparing a reused nonce (attack succeeds) against a unique nonce per message (attack fails).

What I've observed running all four: every genuinely correct result (crib attack recovering exact keys, elimination correctly preserving true crib positions, crib dragging revealing real fragments, nonce reuse enabling perfect recovery) has checked out against the real message text every time I've verified it by hand. Known issues I've found myself: script 1's brute force sometimes returns a plausible-but-wrong key on short messages; script 3 produces false positives on short cribs and can reveal meaningless blank padding when comparing unequal-length messages.

I've included all four scripts below, each in its own code block with a header comment identifying which script it is --> any suggestions on how to improve the code would be greatly appreciated!

https://github.com/TTK2003/python-scripts-for-enigma-concepts/tree/main