Oregami
Repositories/oxedyne/fe2o3

oxedyne/fe2o3/fe2o3_namex/namex.jdat

12.0 KiB, 173 runs

created by r1870400018:517, which is this file's identity for as long as the history lasts, whatever it is later renamed to

download · who wrote it · its history

1{
2 "cBK+9vSPBc/iN3hW067gNNhyWGllITruhBGV60JiT+U=": {
3 (nams): (vek|[
4 "RSA",
5 ]),
6 (lang): "English",
7 (desc): "RSA (Rivest–Shamir–Adleman) is a public-key cryptosystem, one of the oldest that is widely used for secure data transmission. The initialism “RSA” comes from the surnames of Ron Rivest, Adi Shamir and Leonard Adleman, who publicly described the algorithm in 1977. An equivalent system was developed secretly in 1973 at Government Communications Headquarters (GCHQ), the British signals intelligence agency, by the English mathematician Clifford Cocks. That system was declassified in 1997.",
8 (tim1): "1197802",
9 (tags): (vek|[
10 "Algorithm",
11 "Encryption",
12 "Asymmetric",
13 "Transformation",
14 ]),
15 (alts): {
16 "iod": "1.2.840.113549.1.1.1",
17 },
18 },
19 "jQkDJ+bpsbvZJ6ykRYax8pacAKJrM6YxQMHtUkNc/dw=": {
20 (nams): (vek|[
21 "AES",
22 ]),
23 (lang): "English",
24 (desc): "The Advanced Encryption Standard, also known by its original name Rijndael is a specification for the encryption of electronic data established by NIST in 2001.",
25 (tim1): "12001",
26 (tags): (vek|[
27 "Algorithm",
28 "Encryption",
29 "Symmetric",
30 "Transformation",
31 ]),
32 },
33 "4IaH4F8elJw60EkIr2N9+S1avkvUDHX5IaH1GkEKoXQ=": {
34 (nams): (vek|[
35 "AES-256-GCM",
36 "AES256GCM",
37 ]),
38 (lang): "English",
39 (desc): "Galois/Counter Mode is a mode of operation for symmetric-key cryptographic block ciphers providing authentication.",
40 (tim1): "12001",
41 (lnks): {
42 "jQkDJ+bpsbvZJ6ykRYax8pacAKJrM6YxQMHtUkNc/dw=": "variant of",
43 },
44 (tags): (vek|[
45 "Algorithm",
46 "Authentication",
47 "Block Cipher",
48 ]),
49 },
50 "u4exjFVVFwYK/c5AeDsAgqe5MUIfp5asov30Qb0pwmA=": {
51 (nams): (vek|[
52 "Argon",
53 ]),
54 (lang): "English",
55 (desc): "Argon is a family of memory-hard password hashing algorithms.",
56 (tags): (vek|[
57 "Algorithm",
58 "Hash",
59 "KeyDerivation",
60 "Transformation",
61 "Verifiable",
62 ]),
63 },
64 "sl6UqXw8nwjEzDMyO9TMlCzwUKtNDHgpDq+DOYjUukU=": {
65 (nams): (vek|[
66 "Argon2d_v0x10",
67 ]),
68 (lang): "English",
69 (lnks): {
70 "u4exjFVVFwYK/c5AeDsAgqe5MUIfp5asov30Qb0pwmA=": "variant of",
71 },
72 },
73 "cu9pC9q0wONz80OCjaxtMJiyv4zqMUuljhDKMOiUE4o=": {
74 (nams): (vek|[
75 "Argon2i_v0x10",
76 ]),
77 (lang): "English",
78 (lnks): {
79 "u4exjFVVFwYK/c5AeDsAgqe5MUIfp5asov30Qb0pwmA=": "variant of",
80 },
81 },
82 "D4NkV8upthkHwlPrkfq/wqo+S4dnXwU7EkM4vg4h4jo=": {
83 (nams): (vek|[
84 "Argon2id_v0x10",
85 ]),
86 (lang): "English",
87 (lnks): {
88 "u4exjFVVFwYK/c5AeDsAgqe5MUIfp5asov30Qb0pwmA=": "variant of",
89 },
90 },
91 "bbj8wR0HwO6JJoWDWgauLWOacUfLfJZVnoWEyTYIfqI=": {
92 (nams): (vek|[
93 "Argon2d_v0x13",
94 ]),
95 (lang): "English",
96 (lnks): {
97 "u4exjFVVFwYK/c5AeDsAgqe5MUIfp5asov30Qb0pwmA=": "variant of",
98 },
99 },
100 "6UQjGIfYSHD7/2mcr27mtB8B9IyQBRpye0ABSH9/YCo=": {
101 (nams): (vek|[
102 "Argon2i_v0x13",
103 ]),
104 (lang): "English",
105 (lnks): {
106 "u4exjFVVFwYK/c5AeDsAgqe5MUIfp5asov30Qb0pwmA=": "variant of",
107 },
108 },
109 "M/dnApVP4FC91bbNYeKy73V6j3NVfwW7qcVspx53zl8=": {
110 (nams): (vek|[
111 "Argon2id_v0x13",
112 ]),
113 (lang): "English",
114 (lnks): {
115 "u4exjFVVFwYK/c5AeDsAgqe5MUIfp5asov30Qb0pwmA=": "variant of",
116 },
117 },
118 "+n9EN0dPKFF7q6iiwjtkgAUyT3odnl95JwnQd4z+jfw=": {
119 (nams): (vek|[
120 "CRC",
121 ]),
122 (lang): "English",
123 (desc): "Cyclic redundancy check",
124 (tags): (vek|[
125 "Algorithm",
126 "Checksum",
127 "Hash",
128 "Transformation",
129 "Verifiable",
130 ]),
131 },
132 "9m5ja11mi86oosyB7LG4Kvcx83ln3stpD0/8Pnq01tE=": {
133 (nams): (vek|[
134 "CRC32",
135 ]),
136 (lang): "English",
137 (lnks): {
138 "+n9EN0dPKFF7q6iiwjtkgAUyT3odnl95JwnQd4z+jfw=": "variant of",
139 },
140 },
141 "K0rUHer60cFxE01/50yDDiSFULi9E1Tp4/1bup743lc=": {
142 (nams): (vek|[
143 "Australia",
144 "Commonwealth of Australia",
145 ]),
146 (lang): "English",
147 (desc): "The world's sixth largest country and the oldest, flattest and driest inhabited continent.",
148 (tags): (vek|[
149 "Region",
150 "Earth",
151 "Country",
152 "Continent",
153 ]),
154 },
155 "zPQbBR9QUW8HFxEr3vRx3BqBKKrS8Huh+Kbtur5hgJQ=": {
156 (nams): (vek|[
157 "Julia Millicent Citizen",
158 "jules",
159 ]),
160 (lang): "English",
161 (tim1): "11987",
162 (tags): (vek|[
163 "Person",
164 ]),
165 },
166 "mlW69HS3ZqI8F5dNgKuPBx0JRV5kcluxVnNrNnxwGVQ=": {
167 (nams): (vek|[
168 "Hematite",
169 "fe2o3",
170 "Fe2O3",
171 ]),
172 (lang): "English",
173 (desc): "A software library in the Rust language.",
174 (lnks): {
175 "zPQbBR9QUW8HFxEr3vRx3BqBKKrS8Huh+Kbtur5hgJQ=": "created by",
176 },
177 (tags): (vek|[
178 "Software",
179 "Library",
180 "Open Source",
181 ]),
182 },
183 "PbuqJaY/3EQAXgH5XTlArR1duvLlcO5UDGaI1KN/QxM=": {
184 (nams): (vek|[
185 "Dilithium",
186 ]),
187 (lang): "English",
188 (desc): "Post quantum digital signature algorithm based on the hardness of lattice problems over module lattices.",
189 (tags): (vek|[
190 "Algorithm",
191 "Asymmetric",
192 "Encryption",
193 "Transformation",
194 ]),
195 },
196 "W4+qt2Gd+9RQBxllcx10b4h/Ih3g9m76C+mj17TwUNw=": {
197 (nams): (vek|[
198 "Dilithium2",
199 ]),
200 (lang): "English",
201 (lnks): {
202 "PbuqJaY/3EQAXgH5XTlArR1duvLlcO5UDGaI1KN/QxM=": "variant of",
203 },
204 },
205 "tJSJgXe8jU8PGqFNmBJUwFqU1GpO2NGpDjRBOCxeTXk=": {
206 (nams): (vek|[
207 "Dilithium3",
208 ]),
209 (lang): "English",
210 (lnks): {
211 "PbuqJaY/3EQAXgH5XTlArR1duvLlcO5UDGaI1KN/QxM=": "variant of",
212 },
213 },
214 "atwpejMudApM4BMcBYhDrjZVu9aP6ZaCqzaVro5MqKQ=": {
215 (nams): (vek|[
216 "Dilithium5",
217 ]),
218 (lang): "English",
219 (lnks): {
220 "PbuqJaY/3EQAXgH5XTlArR1duvLlcO5UDGaI1KN/QxM=": "variant of",
221 },
222 },
223 "8te+vL2m7B3PJLGs20M6LWUnQLnVWSnW2frTGp4fnV0=": {
224 (nams): (vek|[
225 "Dilithium2_AES",
226 ]),
227 (lang): "English",
228 (lnks): {
229 "PbuqJaY/3EQAXgH5XTlArR1duvLlcO5UDGaI1KN/QxM=": "variant of",
230 },
231 },
232 "TfYW5Va3t+ZIJ9ql2asP20S9ACF1O+52yVJvV54DrF8=": {
233 (nams): (vek|[
234 "Dilithium3_AES",
235 ]),
236 (lang): "English",
237 (lnks): {
238 "PbuqJaY/3EQAXgH5XTlArR1duvLlcO5UDGaI1KN/QxM=": "variant of",
239 },
240 },
241 "asX21Hj43Ff+xXazoKY3pVQXvmAF6FH7m4ajLt3yuzc=": {
242 (nams): (vek|[
243 "Dilithium5_AES",
244 ]),
245 (lang): "English",
246 (lnks): {
247 "PbuqJaY/3EQAXgH5XTlArR1duvLlcO5UDGaI1KN/QxM=": "variant of",
248 },
249 },
250 "zkSGGwLauv5FLpNoCse+3D7bKIdNh7PeBsfbjv/TSvQ=": {
251 (nams): (vek|[
252 "Dilithium2_fe2o3",
253 ]),
254 (lang): "English",
255 (lnks): {
256 "PbuqJaY/3EQAXgH5XTlArR1duvLlcO5UDGaI1KN/QxM=": "variant of",
257 },
258 },
259 "ssXKMEZ55yiMvme8ugkdiLvAEBhEKTwj3+IEg5YHIh0=": {
260 (nams): (vek|[
261 "EdDSA",
262 ]),
263 (lang): "English",
264 (desc): "Edwards-curve Digital Signature Algorithm is a digital signature scheme using a variant of Schnorr signature based on twisted Edwards curves.",
265 (tags): (vek|[
266 "Algorithm",
267 "Asymmetric",
268 "Signature",
269 "Transformation",
270 "Verifiable",
271 ]),
272 },
273 "9UQvATp4Zbv8IbWOivdhiQnex+ELo7sxOr8ntEZphMc=": {
274 (nams): (vek|[
275 "Ed25519",
276 ]),
277 (lang): "English",
278 (lnks): {
279 "ssXKMEZ55yiMvme8ugkdiLvAEBhEKTwj3+IEg5YHIh0=": "variant of",
280 },
281 },
282 "miDRfrTDbbSUE2HZe60ut1ek96ieyDkO34Ene7KWLJs=": {
283 (nams): (vek|[
284 "Empty",
285 "void",
286 ]),
287 (lang): "English",
288 (desc): "The empty set",
289 (tags): (vek|[
290 "Mathematics",
291 "Set",
292 ]),
293 },
294 "2AsUAMWta6DafRiLjBIz/lnZbQILzIidv+mLzT+G+EI=": {
295 (nams): (vek|[
296 "HTTP",
297 "http",
298 ]),
299 (lang): "English",
300 (desc): "The Hypertext Transfer Protocol is an application layer protocol in the Internet protocol suite model for distributed, collaborative, hypermedia information systems.",
301 (tags): (vek|[
302 "https://www.rfc-editor.org/rfc/rfc9110.html",
303 ]),
304 },
305 "YLhiuV3kTZLe5CLhUMChayUYothcmCKTCCfnCRnf2k8=": {
306 (nams): (vek|[
307 "Http/2",
308 ]),
309 (lang): "English",
310 (lnks): {
311 "2AsUAMWta6DafRiLjBIz/lnZbQILzIidv+mLzT+G+EI=": "variant of",
312 },
313 },
314 "6yhzBUiSBXZUGqsZhmSzPexuh1iJDsr0IorFTZ4YjfE=": {
315 (nams): (vek|[
316 "Https",
317 "https",
318 ]),
319 (lang): "English",
320 (lnks): {
321 "2AsUAMWta6DafRiLjBIz/lnZbQILzIidv+mLzT+G+EI=": "variant of",
322 },
323 },
324 "bBUust/mGJstzU/9gPrn3TtRRvp/vnhyEzHKZhXTH9E=": {
325 (nams): (vek|[
326 "Identity",
327 ]),
328 (lang): "English",
329 (desc): "A transformation that preserves the original.",
330 (tags): (vek|[
331 "Algorithm",
332 "Transformation",
333 ]),
334 },
335 "jUOA+grTLhZwpaYcSFS7mOgbY4D+V6bOLZ0UEDvsPX0=": {
336 (nams): (vek|[
337 "SABER",
338 ]),
339 (lang): "English",
340 (desc): "SABER is an IND-CCA2 secure Key Encapsulation Mechanism whose security relies on the hardness of the Module Learning With Rounding problem and remains secure even against quantum computers.",
341 (tags): (vek|[
342 "Algorithm",
343 "Asymmetric",
344 "Encryption",
345 "Transformation",
346 ]),
347 },
348 "SWfFDn+zM5nroo8TlFC4Wmr79XMUNuek6T41KB+8XkY=": {
349 (nams): (vek|[
350 "LightSaber",
351 ]),
352 (lang): "English",
353 (lnks): {
354 "jUOA+grTLhZwpaYcSFS7mOgbY4D+V6bOLZ0UEDvsPX0=": "variant of",
355 },
356 },
357 "/oxxQAGmpxXLZFbgWwW2zGlGWMqHu0gIrMrrLUXGkHs=": {
358 (nams): (vek|[
359 "Saber",
360 ]),
361 (lang): "English",
362 (lnks): {
363 "jUOA+grTLhZwpaYcSFS7mOgbY4D+V6bOLZ0UEDvsPX0=": "variant of",
364 },
365 },
366 "nb68Os+ihmMixsBrsV5K+OzgCJrtxQ1L3e1FJ7KOvPk=": {
367 (nams): (vek|[
368 "FireSaber",
369 ]),
370 (lang): "English",
371 (lnks): {
372 "jUOA+grTLhZwpaYcSFS7mOgbY4D+V6bOLZ0UEDvsPX0=": "variant of",
373 },
374 },
375 "O/3zgxf8/f6mjc0RBau1MMtkfNi9B1eeFB5Q9f6ZfAM=": {
376 (nams): (vek|[
377 "Seahash",
378 ]),
379 (lang): "English",
380 (desc): "A portable, high performance non-cryptographic hash function.",
381 (tags): (vek|[
382 "Algorithm",
383 "Hash",
384 "Non-Cryptographic",
385 "Transformation",
386 ]),
387 },
388 "/TmhhCg6oJazKJxaQePSwhzvjuMSnjU5bucC9kH+TCs=": {
389 (nams): (vek|[
390 "SHA",
391 ]),
392 (lang): "English",
393 (desc): "The Secure Hash Algorithms are a family of cryptographic hash functions published by the National Institute of Standards and Technology.",
394 (tags): (vek|[
395 "Algorithm",
396 "Cryptographic",
397 "Hash",
398 "Transformation",
399 ]),
400 },
401 "VybbHNWeNXeTqTrXj66TzZScbSTsEFVy0W79QnbroFA=": {
402 (nams): (vek|[
403 "SHA3_256",
404 "SHA3-256",
405 ]),
406 (lang): "English",
407 (desc): "SHA3-256, a member of the SHA-3 family specified in FIPS 202 and built on Keccak. A different construction from SHA-2 and not interchangeable with it.",
408 (lnks): {
409 "/TmhhCg6oJazKJxaQePSwhzvjuMSnjU5bucC9kH+TCs=": "variant of",
410 },
411 (tags): (vek|[
412 "Algorithm",
413 "Cryptographic",
414 "Hash",
415 "Transformation",
416 ]),
417 },
418 "kCnQluCVX4v62XUObBIPJhg+VZaXjXHQOLoNDVrOZso=": {
419 (nams): (vek|[
420 "SHA-256",
421 ]),
422 (lang): "English",
423 (desc): "SHA-256, a member of the SHA-2 family specified in FIPS 180-4, producing a 256 bit digest. It is the strongest digest common to Hematite and the Web Crypto API, which offers no SHA3.",
424 (lnks): {
425 "/TmhhCg6oJazKJxaQePSwhzvjuMSnjU5bucC9kH+TCs=": "variant of",
426 },
427 (tags): (vek|[
428 "Algorithm",
429 "Cryptographic",
430 "Hash",
431 "Transformation",
432 ]),
433 },
434 "QByizewdCnRH/E6ksx4rOnqv5lFuB6PX1EA4Z5kNQwA=": {
435 (nams): (vek|[
436 "Ozone Database",
437 "O3db",
438 ]),
439 (lang): "English",
440 (desc): "A log-structured in-memory key-value database written in the Rust programming language, and inpired by BitCask.",
441 (tags): (vek|[
442 "Software",
443 "Database",
444 ]),
445 },
446 "HFN5dPSwWFeAktUWQEr0S9Zn1LyMSaurR4tPSPM9c0w=": {
447 (nams): (vek|[
448 "X25519",
449 ]),
450 (lang): "English",
451 (desc): "An elliptic curve Diffie-Hellman function over Curve25519, specified in RFC 7748. Two parties each hold a 32 byte secret and publish a 32 byte public key, and each computes the same 32 byte shared secret from its own secret and the other's public key.",
452 (tim1): "12006",
453 (tags): (vek|[
454 "Algorithm",
455 "Asymmetric",
456 "KeyAgreement",
457 "Transformation",
458 ]),
459 },
460}