tryAll

100%

✓ Published0🌍 Public

Last edited Apr 5, 2018

Created on Apr 5, 2018

This example demonstrates a brute-force attack on a Caesar cipher, decrypting a short encrypted string by testing all 24 possible shift keys. It shows the decryption attempts in a visualization, highlighting how different keys produce varying results. The code uses Node.js file system operations (`fs.readFileSync`) to load a frequency list from an external text file, then applies the `isEnglish` module to score each attempt. The `caesar` module performs the shift-based decryption, while `tryAll` iterates through all keys.

AI-generated description

Similar vizzes

Loading thumbnail…

Caesar Cipher Visualization

This interactive visualization demonstrates the Caesar cipher encryption technique by allowing users to input text and a shift value, then animating the transformation of the alphabet. The code uses D3.js v7 to render SVG letter boxes that smoothly transition colors and characters over a one-second animation, highlighting which letters shift and which remain unchanged. User input is processed through a custom `caesarCipher` function, while the `d3.select` and `transition` APIs drive the visual feedback.

Ffay Alomar

62% match

Loading thumbnail…

Data Encryption Testing

This example demonstrates how AES encryption transforms a short plain-text message into a much longer ciphertext, highlighting the approximately 4× size increase. The page renders both the unencrypted string and its encrypted form in green terminal-style text on a black background. It uses the CryptoJS library’s `AES.encrypt` and `AES.decrypt` methods with a fixed secret key, then displays the results via `document.getElementById().textContent`. The visualization is purely textual, with no charts or data beyond the two message strings.

CCurran Kelleher

57% match

Loading thumbnail…

Node.js as an alertnative to Lisp ;-)

This example demonstrates a Node.js command-line tool that maps numeric phone-keypad input to dictionary words, following the classic Lisp challenge from Norvig. It reads a dictionary file and an input stream, building a lookup table of character-to-digit mappings and then recursively matching digit sequences against encoded words. The implementation uses Node.js core APIs like `fs.readFileSync` and `fs.createReadStream` for file I/O, processing the input line-by-line via stream events, and outputs matching words to the console. It highlights the practicality of JavaScript for text-processing puzzles.

RRandomEtc

53% match

Loading thumbnail…

Gist 95bc6a1fc08d5057b64b1b1dc24c211e

This example demonstrates a JavaScript array manipulation that generates all possible single-step neighbors for a four-digit lock combination. It creates two variations for each digit: one decrementing the value (with 0 wrapping to 9) and one incrementing it (with 9 wrapping to 0), storing all eight resulting arrays in a `neighbors` list. The code uses standard JavaScript array methods like `forEach` and `slice`, along with a ternary operator for edge-case wrapping, to construct the neighbor variations. The output, logged via `console.log`, shows a matrix of four-element arrays representing every adjacent combination state.

GGugaGongadze

52% match

Loading thumbnail…

secretArchivesLock

secretArchivesLock presents a puzzle where a grid of characters shifts in response to a sequence of directional commands. The code models a lock as an array of strings, removing '.' characters and then applying L, R, U, or D actions to repack rows or columns. Using JavaScript array methods and string manipulation, it illustrates a deterministic, text-based simulation without external libraries. The visualization demonstrates the transformation of the lock’s state through each action, showcasing the logical result of the programmatic operation.

PPanJ

49% match

Loading thumbnail…

Base64.js

This example demonstrates a compact implementation of Base64 encoding in JavaScript, showing how binary data can be converted into a six-bit character representation using the standard Base64 alphabet. The code defines a function, `encode`, that iterates over the input string’s character codes and constructs the output by bit-shifting values and selecting characters from a lookup string. It uses standard JavaScript string methods like `charCodeAt` and `charAt` alongside bitwise operators, with no external libraries or visualization components involved. The example serves as a clear, minimal demonstration of encoding logic rather than a data-driven graphic.

Mmbostock

48% match

Loading thumbnail…

Gist 1967223

This example visualizes the leaked plaintext password from a support email, mapping its characters and their positions through a network layout. The code uses `d3.forceSimulation` to arrange character nodes, with `d3.geoPath` absent; instead, it employs SVG paths for links and `transition.attrTween` to animate text placement. The data comes from the email’s body, parsed into individual characters and spaces, while the rendering approach highlights the password’s structure as a force-directed graph. Only the visible simulation and tweening logic appear, with no additional interactions beyond the animated layout.

CCaged

47% match

Loading thumbnail…

shadow

A security-themed visualization analyzes password strength by decoding Unix shadow file entries. Using a custom JavaScript parser, the code splits the hash fields and maps the salt and cryptographic hash characters to bar lengths. The layout, built with D3.js, renders each account as a row of gray horizontal bars. The visualization leverages the `d3.select` and `d3.scale` APIs to encode the raw hash string characters into a geometric form, allowing quick visual comparison of password complexity across the displayed user accounts from the provided gist data.

PPeleke

47% match