A New Multiple Key Cipher and an Improved Voting Scheme

  • Boyd C
N/ACitations
Citations of this article
42Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

At Eurocrypt 88 we introduced the notion of a multiple key cipher and illustrated it with an example based on RSA which we called "multiple key RSA". In this paper we consider another multiple key cipher also based on a well known cryptographic function, exponentiation in a prime field. The important difference from multiple key RSA is that this function does not possess the trapdoor property, At the end of Cl1 we speculated that such functions may have useful applications and here we give as one illustration a new voting scheme.

Cite

CITATION STYLE

APA

Boyd, C. (2007). A New Multiple Key Cipher and an Improved Voting Scheme. In Advances in Cryptology — EUROCRYPT ’89 (pp. 617–625). Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-46885-4_58

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free