Research any topic before you write.

Find related topics. | Discover entities. | See connections. | Build a topical map.

Argon2

Argon2 is a key derivation function that was selected as the winner of the 2015 Password Hashing Competition. It was designed by Alex Biryukov, Daniel Dinu, and Dmitry Khovratovich from the University of Luxembourg. The reference implementation of Argon2 is released under a Creative Commons CC0 license (i.e. public domain) or the Apache License 2.0.

Overview, Algorithm & Cryptanalysis

Use the mouse wheel or two fingers (on touchscreens) to zoom in and out of the map.

Research this topic

Explore the main themes, entities and connections around Argon2. Start with the topic map, then use the sections below for research and deeper semantic analysis.

Explore this topic

Start with a few of the strongest sections from the source topic. These are research directions, not a list of keywords you must use.

Overview

12 related topics

Algorithm

2 related topics

Cryptanalysis

1 related topics

Recommended minimum parameters

1 related topics

Key facts & relationships

High-confidence facts extracted from structured source data. Use them as anchors for further research.

Block sizes
variable
Designers
Alex Biryukov · Daniel Dinu · Dmitry Khovratovich
Digest sizes
variable
First published
2015; 11 years ago (2015)
Rounds
variable

Topics to explore

Browse the full topic structure. Each item opens a new analysis centered on that subject.

Overview

Cryptanalysis

Algorithm

Recommended minimum parameters

Advanced semantic analysis

Deeper signals for content research, entity SEO and topical coverage. The plain-language headings explain what each technical view is useful for.

Map overview Semantic statistics

Argon2

Nodes21
Edges20
Triples33
Avg. degree1.9
Density0.095238
Components1

How this topic connects Entity context

See the strongest relationship patterns around the current topic before diving into the raw triples.

Argon2

Top relations

related to External links · 8
Argon2 → Argon2 Memory-Hard Function, GithubArgon2, Hashing CompetitionUni, Lu Argon2 PageBalloon Hashing, Memory-Hard Function Providing Provable, Password Hashing, Proof-of-Work Applications, Protection Against Sequential AttacksRFC
related to Recommended minimum parameters · 8
Argon2 → Comments, GiB, Iterations, Memory, MiB, Parallelism, September, The Request
related to Cryptanalysis · 7
Argon2 → According, Argon2d, Argon2i, N/2, N/e, The, While
Designers · 3
Argon2 → Alex Biryukov, Daniel Dinu, Dmitry Khovratovich
related to Variable-length hash function · 2
Argon2 → Blake2, This
Block sizes · 1
Argon2 → variable
Digest sizes · 1
Argon2 → variable
First published · 1
Argon2 → 2015; 11 years ago (2015)
Rounds · 1
Argon2 → variable
is a · 1
Argon2 → key derivation function that was selected as the winner of the 2015 Password Hashing Competition

Important terminology Word statistics

Use these terms to understand the vocabulary surrounding the topic, not as a checklist for keyword stuffing.

Important terminology

memory attacks function argon2i attack time side-channel first three argon2d order argon2id parameters version passes recommends using commons license accesses

Entity relationships Subject–Predicate–Object triples

SubjectPredicateObjectConfidenceSrc
Argon2Block sizesvariable1.00infobox
Argon2DesignersAlex Biryukov1.00infobox
Argon2DesignersDaniel Dinu1.00infobox
Argon2DesignersDmitry Khovratovich1.00infobox
Argon2Digest sizesvariable1.00infobox
Argon2First published2015; 11 years ago (2015)1.00infobox
Argon2Roundsvariable1.00infobox
Argon2is akey derivation function that was selected as the winner of the 2015 Password Hashing Competition0.90text
Argon2related to CryptanalysisWhile0.60section
Argon2related to CryptanalysisArgon2d0.60section
Argon2related to CryptanalysisArgon2i0.60section
Argon2related to CryptanalysisThe0.60section

Related concept clusters Concept neighborhoods

These clusters group vocabulary that occurs around closely connected concepts in the source material.

    Connections between topic areas Semantic bridges

    Bridges can reveal useful research angles that are easy to miss in a flat list of related terms.

    Min side: 3
    For writers, content strategists, SEOs, marketers and creators — from quick topic research to advanced semantic analysis.