Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A k -th order Carmichael key scheme for shared encryption

A k -th order Carmichael key scheme for shared encryption A k-th Order Carmichael Key Scheme for Shared Encryption Selwyn Russell CRC for Distributed Systems Technology and the School of Data Communications, Queensland University of Technology, 2 George Street, Brisbane, Australia. email: selwyn@fit.qut.edu.au. Indexing Terms Public-key cryptosystems; digital multisignatures; Carmichael key scheme Abstract A generalization of a digital multisignature key scheme published by Desmedt and Frankel is presented, with increased protection from line monitors and with a high degree of privacy of message contents. The Desmedt/Frankel paper at Crypto'91 [1] presented the following shared encryption Carmichael scheme: * An RSA cryptosystem with modulus n and private key K P r i v . * Separate individual keys K P r i v i are generated by some unspecified process with the sole requirement that ~ K P r i v i ~ ( K P r i v - 1) rood $(n), where ~(.) is the Carmichael function. ¢ Individual signatures ("partial results") of a message m are calculated as 81 ------r n K P r i v i rood n. ¢ A "Combiner" produces the final signature S from the partial results and the plain text message as S ~ m Ilsi rood n. The combiner is http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM SIGSAC Review Association for Computing Machinery

A k -th order Carmichael key scheme for shared encryption

ACM SIGSAC Review , Volume 15 (2) – Apr 1, 1997

Loading next page...
 
/lp/association-for-computing-machinery/a-k-th-order-carmichael-key-scheme-for-shared-encryption-MyFkLtJHUa
Publisher
Association for Computing Machinery
Copyright
Copyright © 1997 by ACM Inc.
ISSN
0277-920X
DOI
10.1145/254594.254596
Publisher site
See Article on Publisher Site

Abstract

A k-th Order Carmichael Key Scheme for Shared Encryption Selwyn Russell CRC for Distributed Systems Technology and the School of Data Communications, Queensland University of Technology, 2 George Street, Brisbane, Australia. email: selwyn@fit.qut.edu.au. Indexing Terms Public-key cryptosystems; digital multisignatures; Carmichael key scheme Abstract A generalization of a digital multisignature key scheme published by Desmedt and Frankel is presented, with increased protection from line monitors and with a high degree of privacy of message contents. The Desmedt/Frankel paper at Crypto'91 [1] presented the following shared encryption Carmichael scheme: * An RSA cryptosystem with modulus n and private key K P r i v . * Separate individual keys K P r i v i are generated by some unspecified process with the sole requirement that ~ K P r i v i ~ ( K P r i v - 1) rood $(n), where ~(.) is the Carmichael function. ¢ Individual signatures ("partial results") of a message m are calculated as 81 ------r n K P r i v i rood n. ¢ A "Combiner" produces the final signature S from the partial results and the plain text message as S ~ m Ilsi rood n. The combiner is

Journal

ACM SIGSAC ReviewAssociation for Computing Machinery

Published: Apr 1, 1997

There are no references for this article.