CentralNotice From Wikipedia, the free encyclopedia Jump to: navigation , search This article provides insufficient context for those unfamiliar with the subject . Please help improve the article with a good introductory style . (October 2009) ( Learn how and when to remove this template message ) The Fiat–Shamir heuristic is a technique in cryptography for taking an interactive proof of knowledge and creating a digital signature based on it. This way, some fact (for example, knowledge of a certain number secret to the public) can be proven without revealing underlying information. The technique is due to Fiat and Shamir (1986). [1] The original interactive proof must have the property of being public-coin , for the method to work. For the algorithm specified below, a reader should be familiar with the laws of modular arithmetic , especially with multiplicative...