9 Oct 2021, 01:24 UTC326 viewsread 9 August 2026
spiped https://github.com/Tarsnap/spiped
Channel
LibreCryptography
@librecryptography
On this record: Growth · Engagement · What this channel posts · Posts · Citations · Cite this entry
102subscribers
+0 since we began measuring on 6 August 2026
Risers and fallers across the register · movement among entries of Under 1,000.
Register entry
| Telegram ID | -1001457141199 |
|---|---|
| Type | Channel |
| Username | @librecryptography |
| Description | Aggregating and Organizing Some Crypto-Related Resources | Under the #librehash brand |
| Created | Between 1 April 2019 and 18 August 2021— estimated from Telegram’s id allocation, not measured. How this range is calculated. |
| First recorded | 9 August 2026 |
| Last confirmed live | 9 August 2026 |
| Measurements held | 2 |
| On Telegram | t.me/librecryptography |
Growth
| Measured (UTC) | Subscribers | Change |
|---|---|---|
| 9 Aug 2026, 09:47 | 102 | no change |
| 6 Aug 2026, 22:00 | 102 | first reading |
Engagement
20 posts held, back to 18 August 2021 — the reader has not yet reached the start of this channel’s public history, so older posts may sit further back, unread. Read across 1 pageof Telegram’s post history, 20 posts per page.
Nothing published in the last 30 days. ERR and ER are rolling 30-day measures, so there is nothing to compute — we hold 20 posts for this entry, the most recent from 9 October 2021. An engagement rate over an empty window would be a number about nothing.
What this channel posts
- Photos
- 24
- Links
- 173
Lifetime counters from Telegram’s own channel header, read 9 August 2026 — not the date at the top of this page, which is when the subscriber count was last read. Below Telegram’s rounding threshold, so these counts are exact.
Recent posts
9 Oct 2021, 01:24 UTC301 viewsread 9 August 2026
https://link.springer.com/chapter/10.1007/11599548_15
9 Oct 2021, 01:24 UTC186 viewsread 9 August 2026
Hash Chains I was wrong about my initial impression but also possibly on to something as it pertains to the hash tree that could be created with Blake. Hash / Merkle Tree Concept Rather than just creating an appended list (sort of like blockchain) and then adding an additional operation that merely hashes the last input, it feels like it would be prudent to have all of the values hashed together in some capacity. …
9 Oct 2021, 01:23 UTC94 viewsread 9 August 2026
HCTR: A Variable-Input Length Enciphering Mode (this sounds extremely fucking interesting) I wonder if there's any way that the hash of a cipher text can be taken since hashes are not invertible (but encryption is). Feels like it would be a really good idea to encrypt a hashed output (specifically ; not signatures though). I only say what I said above because if the hash is being used to obfuscate / hide somethin…
9 Oct 2021, 01:23 UTC82 viewsread 9 August 2026
Adiantum: Wide-block mode. This is not a primitive but rather a scheme of some sort (utilizes a combination of XChaCha20 + AES) <—- but where's the AEAD part that you get with the poly1305?? Ah, its in there per an explanation of the specifications. States, "It works by first hashing almost the entire plaintext using a keyed hash based on Poly1305 and another very fast keyed hash function called NH" NH? Never hea…
9 Oct 2021, 01:22 UTC74 viewsread 9 August 2026
Transcrypt (bash script!) ; its just like git-crypt except a little bit cooler than that if you really know what you're doing here) = https://github.com/elasticdog/transcrypt
9 Oct 2021, 01:20 UTC70 viewsread 9 August 2026
Desirable S-Box Properties - https://crypto.stackexchange.com/questions/1297/desirable-s-box-properties
9 Oct 2021, 01:17 UTC73 viewsread 9 August 2026
MPFR: For precise arithmetic in the calculation of values (this is especially important when it comes to cryptographic computations; this is done at the sake of some speed, but when a precise value must be calculated, this is the library that is generally used [perhaps on a remote server first to ensure that any compromises on the host do not impact the results that are gleaned back from it]) = https://gforge.inria.f…
9 Oct 2021, 01:06 UTC73 viewsread 9 August 2026
Great link on Hardening One's GPG Configuration https://www.designed-cybersecurity.com/tutorials/harden-gnupg-config/ (check that out here) ; maybe this gets crossposted into libresec / who knows!
9 Oct 2021, 01:04 UTC90 viewsread 9 August 2026
1. Guideline That Outlines How to Create GPG Keys With an Advanced Algorithm = https://www.gniibe.org/memo/software/gpg/keygen-25519.html 2. Covering the Types of Encryption Covered by Bitcoin = https://wiki.gnupg.org/ECC 3. Another Great Resource on Elliptic Curve Cryptography = https://arstechnica.com/security/2013/10/a-relatively-easy-to-understand-primer-on-elliptic-curve-cryptography/ 4. OpenSSL Cheat Sheet …
9 Oct 2021, 01:03 UTC78 viewsread 9 August 2026
Post-Quantum Signature Curves = https://csrc.nist.gov/projects/post-quantum-cryptography/round-2-submissions
9 Oct 2021, 01:03 UTC78 viewsread 9 August 2026
This astronomical question did not get sufficiently answered - which is worrisome. But we'll leave that on the side for the time being (this will be addressed in short fashion)
Showing the 12 most recent of 20 posts we hold for @librecryptography. View and reaction counts are the latest single reading for each post, not a live figure, and a recent post is still accumulating both. A view count marked ≈ was rounded by Telegram before we ever saw it — t.me prints views in full below 1,000 and to three significant figures above, so ≈1,200,000 means somewhere between 1,150,000 and 1,249,999. Unmarked counts are exact. Text is reproduced from the public post preview and truncated for length.
Citation-graph rank
Citation-graph rank — 1,041,507 of 1,169,250entries in the measured graph. A weighted position computed from the forward and mention edges below — republished posts weigh more than named mentions — and recomputed periodically, over the whole graph. Published only as this ordinal position, never as a score: a position is a fact, and a score printed beside one channel’s name would read as a verdict this register does not make. The two counts beneath stay separate for the same reason mentions are never summed with forwards anywhere else on this page — a named-by count costs nothing to manufacture. The top 100 by this measure, or how it is computed.
Mentions
Named by 1 registered channel — every channel on the register whose own posts have named this one, by its current username or any other username it currently holds, merged from two separately captured readings of the same fact so a namer caught by only one of them is not missed and a namer both caught is not counted twice. A username this channel has since dropped is not matched — that handle may belong to someone else now, and crediting today’s namer to yesterday’s owner would misattribute it.
Named by
Channels on the register whose posts name this channel's handle.
A mention is a weaker signal than a forward and is counted separately for that reason — naming a channel is not republishing it, and a handle in a post body is easy to place deliberately. The post counts beside each row below are distinct posts in which the handle appeared, from posts we have read on both sides — the “Named by N registered channels” figure above is a different count, of distinct NAMING CHANNELS rather than posts, and is not the sum of the rows under it.
Cite this entry
A live page changes as we take new readings, so a citation should name the measurement it is based on, not just the URL. The line below cites the subscriber count as measured 9 August 2026 — this entry's latest reading, not the date you are reading this.
“LibreCryptography” (@librecryptography), 102 subscribers as measured 9 August 2026. Telegram Register, tgregister.com/channel/librecryptography.
Full measurement history, CC BY 4.0. Every reading this register holds for this entry, not just the latest one, as a dated, downloadable record: CSV · JSON. Free to use with attribution to tgregister.com. Each file carries its own generation timestamp, which is the figure to cite for exactly when the data was retrieved.