{"id":13699281,"url":"https://github.com/google/adiantum","last_synced_at":"2025-05-04T16:33:13.806Z","repository":{"id":33852942,"uuid":"143328579","full_name":"google/adiantum","owner":"google","description":"Adiantum and HPolyC specification and test vectors","archived":false,"fork":false,"pushed_at":"2024-03-19T23:12:34.000Z","size":15995,"stargazers_count":469,"open_issues_count":0,"forks_count":48,"subscribers_count":29,"default_branch":"master","last_synced_at":"2024-08-03T20:03:46.976Z","etag":null,"topics":["cryptography-algorithms"],"latest_commit_sha":null,"homepage":"","language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/google.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":"CONTRIBUTING.md","funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2018-08-02T17:59:27.000Z","updated_at":"2024-06-26T19:24:35.000Z","dependencies_parsed_at":"2023-02-19T19:45:34.127Z","dependency_job_id":null,"html_url":"https://github.com/google/adiantum","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/google%2Fadiantum","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/google%2Fadiantum/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/google%2Fadiantum/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/google%2Fadiantum/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/google","download_url":"https://codeload.github.com/google/adiantum/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":224398823,"owners_count":17304661,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["cryptography-algorithms"],"created_at":"2024-08-02T20:00:29.507Z","updated_at":"2024-11-13T05:30:33.831Z","avatar_url":"https://github.com/google.png","language":"C","funding_links":[],"categories":["C"],"sub_categories":[],"readme":"# Adiantum and HPolyC\n\nFor many storage encryption applications, the ciphertext must be the same size\nas the plaintext; generally this matches the disk sector size of either 512 or\n4096 bytes. This means that standard approaches like AES-GCM or RFC7539 cannot\nbe applied. The standard solution is AES-XTS, but this has two disadvantages:\n\n- If AES hardware is absent, AES is relatively slow, especially constant-time\nimplementations\n\n- Using XTS, a one-bit change to the plaintext means only a 16-byte change to\nthe ciphertext, revealing more to the attacker than necessary.\n\nAdiantum uses a fast hash (NH + Poly1305) and a fast stream cipher (XChaCha12)\nto build a construction which encrypts an entire sector at a time. On an ARM\nCortex-A7 processor, Adiantum decrypts 4096-byte messages at 10.6 cycles per byte,\nover five times faster than AES-256-XTS. It is a \"super pseudorandom\npermutation\" over the whole sector, which means that any change to the plaintext\nof the sector results in an unrecognizably different ciphertext sector and vice\nversa.\n\nAdiantum appears in\n[IACR Transactions on Symmetric Cryptology, Volume 2018, Issue 4](https://tosc.iacr.org/index.php/ToSC/article/view/7360). We also document HPolyC, our first\nsuch proposal, which is slower on large messages but simpler and more key agile\nfor small messages.\n\n## File layout\n\n* `specification/`: LaTeX sources for our paper presenting Adiantum\n* `test_vectors/other`: Test vectors we use to validate our implementations\nof other primitives\n* `test_vectors/ours`: Test vectors we generate, in JSON format\n* `python/`: Python implementation and test vector generation\n* `benchmark/`: software we used to generate the benchmarks in our paper\n* `third_party/`: derived works covered by a different license than our\nmain MIT license\n\n## Notices\n\n`third_party/` includes derived works not covered by the MIT license;\nspecifically software derived from the Linux kernel and licensed under GPLv2.\n\nWe include here a variety of algorithms and implementations; we make no\nguarantee they are suitable for production use.\n\nThis is not an officially supported Google product.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgoogle%2Fadiantum","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fgoogle%2Fadiantum","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgoogle%2Fadiantum/lists"}