Skip to main content
100%

Gist 211e4e229b6947bfb6c358c250294083

✓ Published0🌍 Public
Aandyreagan
Last edited Nov 5, 2021
Created on Apr 30, 2021

This example demonstrates a custom encryption and decryption scheme that shuffles a secret string using a permutation key. It shows that the same key can encrypt and restore the original message, while also verifying identity operations, reversal, and manual key swaps. The Python code defines `encrypt` and `decrypt` functions that filter the key to valid indices, then use list comprehensions to reorder characters. It relies on the built-in `random` module with a seeded shuffle to generate test keys, and asserts correctness across multiple scenarios.

AI-generated description

Similar vizzes

Loading thumbnail…

Quick Obfuscation in Python

This example demonstrates quick text obfuscation in Python using AES encryption from the PyCrypto library. It defines padding and encoding/decoding functions, then encrypts a sample string with a randomly generated secret key and prints the base64-encoded ciphertext before decrypting it back to plaintext. The code relies on `Crypto.Cipher.AES`, `os.urandom`, and `base64` functions for key generation and data transformation.

WWilliamQLiu
59% match
Loading thumbnail…

Secrets

A short Python script demonstrates the use of the `secrets` module to generate cryptographically secure random URLs. It prints a single 64-byte token via `secrets.token_urlsafe(64)`, showing the output as a string of base64-encoded characters. The code also includes a commented-out example token, warning readers not to reuse it. The example highlights the module’s purpose for creating secure, unpredictable keys for applications, with no external libraries or visualization involved.

WWilliamQLiu
58% match
Loading thumbnail…

Gist 9e2ff3789a2158f045441b8f90f7ab91

This example visualizes the content of an encrypted message by decoding its PGP structure. It shows the raw cryptographic payload, including the key ID, version, and comment metadata, as a series of text blocks. The visualization uses the `d3.select` and `d3.text` APIs to fetch and display the message content, with a focus on the Base64-encoded body. It highlights the header lines (e.g., "Version:" and "Comment:") separately from the encrypted data, rendering them as distinct styled sections. The source is a static gist file, and the rendering relies on plain HTML and CSS, not on interactive libraries.

CCliffordAnderson
54% match
Loading thumbnail…

Gist 3d2406a594700ec447ebd0b208ead916

This example demonstrates a JavaScript implementation of the Fisher–Yates shuffle algorithm, providing two distinct array manipulation methods. The `shuffle()` function returns a new, shuffled copy of the original array without modifying it, while `permShuffle()` permanently rearranges the elements in place. The code extends the native `Array.prototype` with these custom methods, using modern JavaScript syntax including spread operators and destructuring assignments for element swapping. A usage example with a five-element array illustrates both behaviors, showing the original array preserved after copying and altered after permanent shuffling. The implementation relies solely on core JavaScript array operations and the built-in `Math.random()` function.

MMAKIO135
53% match
Loading thumbnail…

Encrypting Messages with Keybase

This example demonstrates the full range of encryption capabilities offered by Keybase, from messaging and file sharing to managing teams and serving websites. Screenshots illustrate the workflow across three interfaces—the website, desktop application, and command line—highlighting how a user creates a public/private key pair, asserts their identity via Twitter, and encrypts chats and git repositories. The visualizations are static images embedded directly into a Markdown file, relying on Keybase’s underlying NaCl cryptographic library and its CLI tools, with no custom JavaScript or D3 code involved.

CCliffordAnderson
53% match
Loading thumbnail…

Gist 278715

This example demonstrates sequential and parallel generation of RSA cryptographic tuples, each containing an encryption exponent, decryption exponent, and modulus derived from two 200-digit prime numbers. The code contrasts a straightforward sequential approach with a parallelized version that uses `ForkedFeeder` from the stream library to generate random primes in two child processes, while `ent.random_prime` supplies the primes and `ent.rsa_init` constructs the tuples. The parallel pipeline collects primes via `PCollector` and groups them into pairs with the `chop` operator before printing each RSA tuple.

Aaht
53% 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
52% match
Loading thumbnail…

Gist 238407abb94324fa6379

This example shows a cryptographic proof of identity, linking a GitHub account to a Keybase profile through a signed JSON message and a PGP signature. It displays the plaintext of the proof, including the public key fingerprint, the JSON body, and the armored PGP message, as a formatted document. The gist file contains no executable visualization code, so no JavaScript or rendering libraries are used. Instead, the content is presented as raw text within a single file, relying on the gist interface for display.

Aakollegger
52% match