NOTICE: Due to a lapse in annual appropriations, most of this website is not being updated. Learn more.

Form submissions will still be accepted but will not receive responses at this time. Sections of this site for programs using non-appropriated funds (such as NVLAP) or those that are excepted from the shutdown (such as CHIPS and NVD) will continue to be updated.

U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

PUBLICATIONS

Cryptographic Primitives Can Be Fragile

Published

Author(s)

Rene C. Peralta

Abstract

We show that a well-known coin-flipping protocol is breakable in the sense that one of the parties can pre-determine the result of the coin-flip. The way in which the protocol fails is illustrative of the fact that there are insecure ways of using secure cryptographic primitives.
Citation
ISO Press, NATO Science Series
Volume
1
Pub Type
Journals

Download Paper

Local Download

Keywords

multiplicative complexity, Hamming weight, symmetric functions, cryptographic proofs, circuit complexity, concrete complexity
Cybersecurity and privacy

Citation

Peralta, R. (2006), Cryptographic Primitives Can Be Fragile, ISO Press, NATO Science Series, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=150385 (Accessed October 30, 2025)

Issues

If you have any questions about this publication or are having problems accessing it, please contact [email protected].

Created January 3, 2006, Updated January 27, 2020
Was this page helpful?