Fiat–Shamir heuristic

Summary

Fiat–Shamir heuristic is a cryptography^[1]. It draws 50 Wikipedia views per month (cryptography category, ranking #3 of 5).^[2]

Key Facts

• Fiat–Shamir heuristic is credited with the discovery of Amos Fiat^[3].
• Fiat–Shamir heuristic is credited with the discovery of Adi Shamir^[4].
• Fiat–Shamir heuristic's instance of is recorded as cryptography^[5].
• Fiat–Shamir heuristic's publication date is recorded as +1986-00-00T00:00:00Z^[6].
• Fiat–Shamir heuristic's Freebase ID is recorded as /m/06_ttrx^[7].
• Fiat–Shamir heuristic's Microsoft Academic ID is recorded as 2778700983^[8].

Body

Works and Contributions

Credited discoveries include Amos Fiat^[3], a computer scientist^[9], b. 1956^[10], of Israel^[11], awarded the Paris Kanellakis Award^[12], specialised in computer science^[13] and Adi Shamir^[4], a mathematician^[14], b. 1952^[15], of Israel^[16], awarded the Israel Prize^[17], specialised in informatics^[18].

Why It Matters

Fiat–Shamir heuristic draws 50 Wikipedia views per month (cryptography category, ranking #3 of 5).^[2] It has Wikipedia articles in 6 language editions, a strong signal of global cultural recognition.^[19]