Show HN: accdoo cipher – like xkcd/936 but with dial-pad only

2 points

2 years ago

Hi, this is an intro for a cipher App I've built, instead of making another markdown-based SSR blog system from scratch to write the hello world post, I will just use show HN as my cold opening.

The algorithm is easy to perform and can be practiced on any calculator (small input), making it friendly to non-tech-savvy users and without vendor lock-in. Implementation-wise, to its very core just one-liner of JavaScript:

    arr.map(BigInt).reduce((a, b) => (a * b) ** 2n)

By using BigInt gives arbitrary precision, soft limits are set at 10n ^ 100_000n for Web App, 10n ^ 1_000_000n for CLI, configurable from API.

It comes with battery-included, API (npm packed with source code), CLI (via node, deno, bun, qjs), and a responsive-design Web page, with offline-ready PWA that is optimized for small screens (iPhone SE).

Aside from the spirit of xkcd/936, it is widely applicable (does not require English-speaking knowledge nor an ANSI keyboard) and can be used for things like door locks, vaults, pins, passcodes, entropy seeding, etc.

The default UI is tailored for regular daily activities (90% on phones), and an advanced mode with features such as keyboard typing, copy/paste, and QR code for air gapping is planned.

About the naming, it's just a meaningless throwaway code name, one could grep by exact keyword matching and scrap everything before 2024, I hope it's not too much of asking for search engines nowadays.

I am composing this post on HN as its primary discussion spot, if it somehow gains ENOUGH hype, I will create a GitHub Discussions to gather long-term conversations.

To test its strength, I'll end with a ciphertext it produced. Once someone manages to crack it, I will reveal the story behind the making of this App.

00062973002248148460

1 comment