Home › Entities › request_for_comments › RFC 9106: Argon2 Memory-Hard Function for Password Hashing and Proof-of-Work Applications

RFC 9106: Argon2 Memory-Hard Function for Password Hashing and Proof-of-Work Applications

request for comments publication
Place request_for_comments Q108691812
Press Enter · cited answer in seconds

RFC 9106: Argon2 Memory-Hard Function for Password Hashing and Proof-of-Work Applications

Summary

RFC 9106: Argon2 Memory-Hard Function for Password Hashing and Proof-of-Work Applications is a Request for Comments[1].

Key Facts

  • RFC 9106: Argon2 Memory-Hard Function for Password Hashing and Proof-of-Work Applications authored Argon2 Memory-Hard Function for Password Hashing and Proof-of-Work Applications — author (P50): Simon Josefsson[2].
  • RFC 9106: Argon2 Memory-Hard Function for Password Hashing and Proof-of-Work Applications's instance of is recorded as Argon2 Memory-Hard Function for Password Hashing and Proof-of-Work Applications — instance of (P31): Request for Comments[3].
  • RFC 9106: Argon2 Memory-Hard Function for Password Hashing and Proof-of-Work Applications's publisher is recorded as Argon2 Memory-Hard Function for Password Hashing and Proof-of-Work Applications — publisher (P123): Internet Engineering Task Force[4].
  • RFC 9106: Argon2 Memory-Hard Function for Password Hashing and Proof-of-Work Applications's DOI is recorded as 10.17487/RFC9106[5].
  • RFC 9106: Argon2 Memory-Hard Function for Password Hashing and Proof-of-Work Applications's language of work or name is recorded as Argon2 Memory-Hard Function for Password Hashing and Proof-of-Work Applications — language of work or name (P407): English[6].
  • RFC 9106: Argon2 Memory-Hard Function for Password Hashing and Proof-of-Work Applications's publication date is recorded as +2021-09-01T00:00:00Z[7].
  • RFC 9106: Argon2 Memory-Hard Function for Password Hashing and Proof-of-Work Applications's RfC ID is recorded as 9106[8].
  • RFC 9106: Argon2 Memory-Hard Function for Password Hashing and Proof-of-Work Applications's main subject is recorded as Argon2 Memory-Hard Function for Password Hashing and Proof-of-Work Applications — main subject (P921): Argon2[9].
  • RFC 9106: Argon2 Memory-Hard Function for Password Hashing and Proof-of-Work Applications's work available at URL is recorded as https://tools.ietf.org/html/rfc9106[10].
  • RFC 9106: Argon2 Memory-Hard Function for Password Hashing and Proof-of-Work Applications's title is recorded as Argon2 Memory-Hard Function for Password Hashing and Proof-of-Work Applications[11].
  • RFC 9106: Argon2 Memory-Hard Function for Password Hashing and Proof-of-Work Applications's author name string is recorded as A. Biryukov[12].
  • RFC 9106: Argon2 Memory-Hard Function for Password Hashing and Proof-of-Work Applications's author name string is recorded as D. Dinu[13].
  • RFC 9106: Argon2 Memory-Hard Function for Password Hashing and Proof-of-Work Applications's author name string is recorded as D. Khovratovich[14].
  • RFC 9106: Argon2 Memory-Hard Function for Password Hashing and Proof-of-Work Applications's DBLP publication ID is recorded as journals/rfc/rfc9106[15].

Body

Designation and Status

RFC 9106: Argon2 Memory-Hard Function for Password Hashing and Proof-of-Work Applications's instance of is recorded as Argon2 Memory-Hard Function for Password Hashing and Proof-of-Work Applications — instance of (P31): Request for Comments[3].

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [3] ↑ . RFC Index. Retrieved . wikidata.org.
  2. [2] ↑ . RFC Index. Retrieved . wikidata.org.
  3. [4] ↑ . RFC Index. Retrieved . wikidata.org.
  4. [5] ↑ . RFC Index. Retrieved . wikidata.org.
  5. [6] ↑ . RFC Index. Retrieved . wikidata.org.
  6. [7] ↑ . RFC Index. Retrieved . wikidata.org.
  7. [8] ↑ . RFC Index. Retrieved . wikidata.org.
  8. [9] ↑ . wikidata.org.
  9. [10] ↑ . RFC Index. Retrieved . wikidata.org.
  10. [11] ↑ . RFC Index. Retrieved . wikidata.org.
  11. [12] ↑ . RFC Index. Retrieved . wikidata.org.
  12. [13] ↑ . RFC Index. Retrieved . wikidata.org.
  13. [14] ↑ . RFC Index. Retrieved . wikidata.org.
  14. [15] ↑ . dblp.org. Retrieved . dblp.org. Provenance: wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). RFC 9106: Argon2 Memory-Hard Function for Password Hashing and Proof-of-Work Applications. Retrieved May 3, 2026, from https://4ort.xyz/entity/rfc-9106-argon2-memory-hard-function-for-password-hashing-and-proof-of-work-applications
MLA “RFC 9106: Argon2 Memory-Hard Function for Password Hashing and Proof-of-Work Applications.” 4ort.xyz Knowledge Graph, 4ort.xyz, 3 May. 2026, https://4ort.xyz/entity/rfc-9106-argon2-memory-hard-function-for-password-hashing-and-proof-of-work-applications.
BibTeX @misc{4ortxyz_rfc-9106-argon2-memory-hard-function-for-password-hashing-and-proof-of-work-applications_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{RFC 9106: Argon2 Memory-Hard Function for Password Hashing and Proof-of-Work Applications}}, year = {2026}, url = {https://4ort.xyz/entity/rfc-9106-argon2-memory-hard-function-for-password-hashing-and-proof-of-work-applications}, note = {Accessed: 2026-05-03}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): RFC 9106: Argon2 Memory-Hard Function for Password Hashing and Proof-of-Work Applications — https://4ort.xyz/entity/rfc-9106-argon2-memory-hard-function-for-password-hashing-and-proof-of-work-applications (retrieved 2026-05-03)

Canonical URL: https://4ort.xyz/entity/rfc-9106-argon2-memory-hard-function-for-password-hashing-and-proof-of-work-applications · Last refreshed: