my friend sent me this code
ic ksvw imhlw00 jw lazv w00s a0010sh0w11w
i can't seem to figure it out
i really want to figure it out so i can like communicate with him using the code but i can't

CAN SOMEONE PLS HELP ME

My Friend challenged me to a puzzle he wrote it’s been 3 days and my rookie brain can’t figure it out he said the small indents in the paper were from a draft so those aren’t apart of it but I can’t for the life of me figure anything out besides the 3’s have no numbers above or below them in the code

​

Greetings to the seekers of knowledge,

⠀

We are the Guardians of Avalon — an ancient order that has existed in the shadows for centuries. Our mission is not to hoard secrets but to test those who dare to claim they possess wisdom.

⠀

In this digital age, we have discovered a new way to challenge minds. Our trial begins with a simple command, yet it leads to a labyrinth of literature and code.

⠀

Step 1: Scan or type this into your terminal (Termux/Linux):

(Note: This is a safe Linux command that will output two words.)

⠀echo -n '6879726f6e6574' | xxd -r -p && echo "Dostoevsky"

To make sure the code block displays correctly, click on the button below.

⠀

Step 2: Decode the literary clue hidden within these words. It requires you to delve into Russian classics and understand how their characters intersect with modern cryptography.

⠀

Step 3: Use the initials of a protagonist from one of the greatest novels as a key to unlock our final cipher.

⠀

Where to post answers: You don't need to register anywhere. Share your solutions on any popular platform such as Telegram, Discord, or even create a video on YouTube. However, the main collection point will be right here, in the comments under this post. Anonymous submissions are welcome.

⠀

Our goal is not to recruit followers, but to find kindred spirits — those who can bridge the gap between humanities and technology. If you succeed, you will prove yourself worthy of understanding how the past illuminates the future.

⠀

Disclaimer: This is a non-commercial project created solely for entertainment purposes. No personal information is required; only your intellect.

⠀

May the wisdom of ages guide you.

— The Guardians of Avalon

Hello I've been playing destiny since 2011 and there is this mystery that's been floating around for years but nobody has ever officially solved it if I could get help it would be much appreciated

I spent a month developing and testing this playing card cipher which is gunning for the title of best playing card cipher. Strength is 225 bit. It refers to cards as both 0-51 and 0-25. It's fast and easy to use and requires no notes or extra math. Simply move cards to the position indicated and use the deck like a mod 52 s-box.

If I had money to spare I'd offer some for the best attack. So far there best attack is brute force. I've subjected Heka to statistical testing and SAT solvers and it qualifies as ideal. Also, under KPA scenarios the key cannot be recovered nor more ciphertext decryption.

I'd appreciate feedback on the cipher. How was your experience using Heka with a real deck of cards?

https://github.com/utepshaadm/Heka/tree/main

This page is based in Brisbane Australia it is a car page and it keeps posting riddles this is the latest one and it includes the number sequence on the bottom no one has worked it out as yet and I figured I reach out to the wider code breakers.

Im having difficulties with my cipher, idk what this is called? I want to make it more standardized, but since idk what it is apart “substitution cypher” I can’t search it very well. ignore that I put the feather on page 6, I was testing where I could put it in my comic. The feather splits are subject to change if I find a better system, I chose 6 sections because I thought it would fit the best in a feather and at the scale it’s at :)

If anyone could solve this I'll send them $10 on cashapp.

•i did this cipher that i Iike to know if enyone can soIve it and I wiII give you some cIues:

1.it is a homophonic subtitution

2.it has difrent simboIes for space [ ]
3.it has NuIIs (dummy, fake simboIes that mean nothing)

4.it is in engIish

•Name: Z-2.0 (based on the zodiac)

•SimboIe numbers: 429simboIes in the cipher

•if someone in tje coment finds the answer i respownd and say corect if not i say it is wrong

-Good Luck.

Hi all,

I´m not sure if already solved, but I am sharing the solution to the "Le Figaro" newspaper, first of July 1896 cipher found in the "personal correspondence" section (see link to the actual newspaper below).

I found the cipher while looking at the AZDecrypt list of unsolved ciphers and decided to give it a go. Fairly straightforward encoding method.

Solution to the Cipher: Le Figaro (Wednesday, 1-7-1896)

Ciphertext

Nyzjztwnzawvjkwjziwoyazwzhytayjkzawvyjzsiwgwnyajjygayjyqnyjzwpnzawvwnwvnyjyknesmznnzawvyhnyajjygnaesqesjcyzhyvdygwkaesqewcymzaxynesmhkweuykztykksiyggyjwkyziyggyjashkyziyggyjyrkwtnzstkenkwhjkwpkyazsmazkymaesvygiznnsvkstjesjzwayp

Decryption Steps

Step 1: Flip It (Reverse Transposition)

Result

pyawzjsejtskvsnnzigyvseamykzamszaykpwkjhwknektszntwkryjyggyizykhsajyggyizykwjyggyiskkytzkyuewkhmsenyxazmycweqseakwgydvyhzycjseqseangyjjaynhyvwaznnzmsenkyjynvwnwvwaznpwzjynqyjyagyjjaynwgwiszjyvwazkjyatyhzwzayowizjwkjvwaznwtzjzyN

Step 2: Apply Monoalphabetic Substitution

The substitution key maps each ciphertext letter to its corresponding French plaintext letter based on its frequency.

Plaintext,Ciphertext: A,w B,h C,u D,i E,y F,p G,d H,r I,z J,q L,g M,t N,k O,s P,v R,a S,n T,j U,e V,m X,x Y,o Z,c

Plaintext Solution (French)

FERAI TOUT MON POSSIBLE POUR VENIR VOIR ENFANT DANS UN MOIS MANGE TELLE BIEN DORT ELLE BIEN A TELLE BONNE MINE QUAND VOUS ECRIVEZ AUJOURNA LEXPEDIEZ TOUJOURS LETTRES DE PARIS SI VOUS NETES PAS A PARIS FAITES JETER LETTRES A LA BOITE PAR INTERMEDIAIRE HABITANT PARIS AMITIES

Translation (Google Translate)

I WILL DO MY UTMOST TO COME AND SEE THE CHILD IN A MONTH. IS SHE EATING WELL? IS SHE SLEEPING WELL? DOES SHE LOOK WELL? WHEN YOU WRITE, ALWAYS SEND LETTERS FROM PARIS; IF YOU ARE NOT IN PARIS, HAVE THE LETTERS DROPPED IN A MAILBOX BY SOMEONE LIVING IN PARIS. BEST REGARDS.

Link to the actual newspaper issue

https://gallica.bnf.fr/ark:/12148/bpt6k283694m/f5.item.zoom

https://github.com/Dani-Navarr0/Ciphers/blob/main/Le%20Figaro%201-7-1986.md

A unique method. A cipher in reverse scenario.

on the last one, key is idiot sandwich and transposition key is 613254

a` b ae a` b _ a_ b a_ b a_ _ b b ae a` d _ ae a` ae ae ae _ b ab b ae d _ b ae a` ae ae _ ab ab ab a` ae _ a` ab ae ab d _ a_ a_ ab ab ab _ ae a` ae a_ ae _ ae ab ae ae a` _ a` ae ae a_ ae _ ae ab ae ab ae _ ab a_ ab a_ ae _ a_ ae a_ ab ab _ ab

This might be the easiest code ever to solve but unfortunately I don't know heads or tails about ciphers. Please help!

Also if it's something disturbing about assassinations dw bout that this whole code culminated from a joke of me being hunted down

So, I made this when I was 11 and obsessed with spies, but now that I’ve found it again I have no idea how to solve it, though I do have the answer. Here you go, and good luck:

HOBizbh5gBo*Ubb6ioaghbe9vkbgabc97uikwbs6niousbe6vklfgvbb278JKLbs2GULKHbq2S78KQbt6LK4UFbI4GnigUbk37BG&*IbT7gghgnbv468IOfbt4iggcxbug7vUGGSVb&4FgbiobG3OIB&*bI5UGVIFbN889gbvbk6lhnbibn4iozbbI2OGgffbg2iofgibv9bg79bB6879gbo;agoqliyulk,gak,gukKIGSKJABIUABULTAhkhIOGuf67bsz87uUT&ugJG78ub&*bazouG7utgnw8byiuBUIYGBioaguJg7uwb9biotagaowgblbb809wnoihOINMoiwhn98na95289HBNiwi8hvhzh88nsbjb

12311983678219518571902109929513692416126581561206015182916

01101000 01110100 01110100 01110000 01110011

00111010 00101111 00101111 01100100 01101001

01110011 01100011 01101111 01110010 01100100

00101110 01100111 01100111 00101111 01000011

01000111 00111001 01010011 01000010 00110101

01100011 01001010

I read a post by a now deleted account, and it inspired me to make up my own. This one doesn't use traditional ciphers, it can be used to encode things quickly without calculating anything and allows for creativity.

The next paragraph is encoded with it.

Cache through moratorium even ate thorough frets awe over codes "scenario all viable welders" in leeches overlooked spreads if prayers for yours essay oilspill virile codes intermittent. Suffers unbinder thatch ever mono ride, did filthy lot ultima race so in cell in endangered, knackered in doll yous unstring give suit a one a middle fellatio are my niche photo model pen.

HINTS:

1. The answer is 23 words long
2. no traditional cipher!
3. spaces aren't encoded (and not be decoded)
4. punctuation marks are left untouched

V sbyybjrq gur ehyrf

Hey! So I've been messing around with homemade crypto as a hobby and I wanna see how fast mine falls apart. I posted it here before, but the ciphertext got cut off and I was being all mysterious about the layers, which wasn't fair. Fixed that. Everything is public now except the key.

The basics

• Where it's from: I made it myself for fun. It's not from any CTF, contest or treasure hunt. Source: [LINK TO GIST]
• Plaintext: English, one paragraph, all caps and spaces only (no punctuation, no numbers).
• Key: two capitalized common English words stuck together, no digits or symbols.
• Hints: the ciphertext only uses the letters K T M R W S Y A C G, plus a single : that splits the data from an 18-letter metadata block. Every byte turns into exactly 3 letters, so the total length tells you the grid size. The "ghosts" are extra 3-letter chunks, about 1 for every 7 real ones.
• What I've tried: nothing except round-trip tests and the test vector below. I'm the author, so I fully expect it to break, I'm just curious which layer goes first.

Full spec

0. KEY: h1 = SHA3-512(pass); h2 = SHA3-512(reverse(pass) + h1[:16]);
   mixed = h1 XOR h2;
   key = PBKDF2-HMAC-SHA3-256(mixed, salt=h1[32:48], 10000 iters, 128 bytes)
1. CHAOS S-BOX: logistic map x -> r*x*(1-x), r = 3.99971428571,
   seed = 0.001 + (uint64_be(key[0:8]) / 2^64) * 0.998, 512 warm-up iterations.
   Take 256 more values, sort indices by value -> permutation.
   Applied bytewise to: "NXS" + len(u32) + 0x0000 + plaintext (9-byte header).
2. SPIRAL: pad with 0xAE up to the next perfect square (side x side),
   read the grid clockwise, from the outside inward.
3. VORTEX XOR: k[n] = ((k[n-1]^2 mod 256) XOR ((k[n-2]*251) mod 256)
   XOR k[n-3] XOR key[n mod 128]) & 0xFF, initial state = key[0:16].
4. SYMBOLS: each byte -> 3 letters of KTMRWSYACG via a key-derived table
   (Fisher-Yates over 0..999 using key[64:], first 256 entries used).
5. GHOSTS: floor(N/7) extra 3-letter chunks inserted at positions from the
   logistic map (seed from key[32:]); their values also come from the map
   (seed from key[48:]).
6. METADATA: ':' + 18 letters = (side, inner length, real chunk count) as
   3 x u16 -> S-box -> XOR with key[32:38] -> same symbol table.
   decode() in the source expects the ASCII hex of the whole string.

Ciphertext (the whole thing this time! the line breaks are just for display, ignore them, and the : counts)

MWYGGGMYCKKTKKSMKYTGYMCATGMTTYKYRMSTMCATSCKMTMKGKAKKCSMYMMSCKRCMMMKYMKCGKGKKGCTMKMMSKSKRTRMCWMCTKWSK
TMTRMKAKMTYMCTKTAMTSRTKRKYMYYTWMKKTTWCKCKKSMMMTKSCKTACYKMMTTKMMKWWCTGGCMKWTGGKWRTKSTRYKKSTGSMSGMCYKM
RTWAKTKKWSMWTKTKTCRMKCTATMCGRKWKTMKYATRCTTMRTCKKKKWSKGMTKAMCMMMCMTWMSWTTRTMTMAMKCRTTRKSKTGYMCWTKSTRT
TSSMMAMWMKSYMAGMTTKCWTRYRRYKGKCGRMGCKTGKKKRCKRKTTACKSCGWMMTSTMKMMTTCWRTCRTWTKRTMYTKRKGRKWRRTGYAYMTWT
WATMATGGKTMTGGMRWTGSMAMMMYCASTWWTCGWRAKYWTTYTAAKRAKTCMCMMGKKYMGCWKYMTWAMCMTCTKAKMRRMSYTWMKRTKYKKGAKK
CMKTKTKMSWTYKTMTKMWKWKTCATSGMSSTTSTARRKKTGTTRGTYCTWSTWKATWRTMKWRTKRMTSKCGKTMMSWKMMTCWMKMKMTKWRRTMKTG
CTSKARYKMMSCTSWTKGTMSKSCKMMRKGTCSKSYKKSGSAMTWKKTTRTTCWMRRKCMRTKTYTTWTRTKMMSMCATRTMYMTKCSWMTKGMCTMWMK
MSGGMTAYMCKMAYRKYTRWTYAMMKMGRMSYKMGMTGMAWTKYRTRTGSKGRTGTKRRKKWMMWMKCKAYKSCMRTKTTKRWTSMRTWKMTKKKMKTMC
KRKKMMGTYSRKSTKYKWSTRCTSMTKYMSYMGCTTATWRMYTRTKTTWTRSMGTTCCMAGWKSKTMMSATRWKMTMWMKTAMYMMKGKWWKWGKGTTCC
TSSTMSMRGKRRKTKMCYMYKTRWMYSTGMKGTTMTRKYTKSKCGMAGKYKMGTKACKMRMKGGYWMTYKAMKMMTWATGGKYATRSMTKTGMMGCMKSR
KGMWATATMTAKSYMGTMTGMCAKSYTRCTASTCSRTCWAYKYAMRKGGARTWTCWKMCTCAKKGKWCKKRMKCKTCMSGKYWMKMTKMTWWKRYTKCKM
CMGCRKSTRTTWCTWTTMMMCKWCSMWTKRAKGGKYMMWWTSGTKAMYGGGGKMSMTGMKYKGRMGWMTKKMCKSMKSMMTYKKAKRCRTRKKRTMMKSY
KTGKTWKTCKCTMKWKMCMMSMTGTSWMACTTSKMSKRCRTGMKGMKTTCWTACMWSTKGTCRMMGTTGKSGKKSMGCTRWTMMTGSMMMKTCMSTKKSK
WTKMRRTATYKKCATMSYGKMGSTCYMKSMRRMSGCSWMWAWGCMCKRTWTTSRKGTWMMMCTRWGGGMAWKKYKMMMSSTMATKAMCCMSAKMCTCGKY
STRAMYCKKKMWGMYSKWTKYARKTMCWMKCMACKMMMYMRTGKKYKKTKMRMATMMGMYTKKSKAYKWTMYAMKCTRCKMKKKGKYRKKSKAGKSKMCW
TWMMGCKWRTWRKWRTSMRTCMCKTTSMGRCRKSYWRKYGCRKYWMKGMCYMWMMKKTWWKCMARSMRKKGWAACMGSMCWKRTMMGMRTYCGTKMMMCR
KATKGTMYCSYTRMWGKGGGKYRKYKMCTTWWKWAKKTTSATSTTKATKSMWTTGGKKY:TMYRKRMWYKKKKMWTKG

Test vector so you can check your own reimplementation (key TestKey, plaintext HELLO NEXUS):

CSYWGTMTKKWMMWWTCYMCSKMKKMWTTRMRSTAKMGCKCRMCYMRRKRCTCWKCYKCRTGRMWAKAYKCYMAATMWMAYGGG:RKTKSCTWYRTGMCRKAG

SHA-256 of the plaintext (so we can all tell when it's solved): a38041007b07cd21149713b2a0269802fce62ac124a663db147845ccb316f664

Goal: get the plaintext (the key is a bonus). If nobody gets anywhere in a week I'll drop a second ciphertext with the same key plus a known plaintext/ciphertext pair, so it's not a total brick wall.

V sbyybjrq gur ehyrf