Public key cryptosystems based on boolean permutations and their applications

In this paper we propose the use of Boolean permutations to design public key cryptosystems. The security of the cryptosystems is based on the difficulty of inverting Boolean permutations. Using two Boolean permutations for which the inverses are easy to find, one can construct a composite Boolean permutation which is hard to invert. The paper proposes three such Boolean permutation based public key systems. The paper also consider applications of a Boolean permutation based public key system to digital signatures and shared signatures.

[1]  Ed Dawson,et al.  A New Key Escrow Cryptosystem , 1995, Cryptography: Policy and Algorithms.

[2]  Pierangela Samarati,et al.  Proceedings of the 8th ACM conference on Computer and Communications Security , 1998, CCS 2001.

[3]  David Paul Maher,et al.  Crypto backup and key escrow , 1996, CACM.

[4]  Yvo Desmedt,et al.  Securing Traceability of Ciphertexts - Towards a Secure Software Key Escrow System (Extended Abstract) , 1995, EUROCRYPT.

[5]  David M. Balenson,et al.  Commercial key recovery , 1996, CACM.

[6]  Mihir Bellare,et al.  Verifiable partial key escrow , 1997, CCS '97.

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8]  Moti Yung,et al.  Escrow Encryption Systems Visited: Attacks, Analysis and Designs , 1995, CRYPTO.

[9]  Robert J. McEliece,et al.  A public key cryptosystem based on algebraic coding theory , 1978 .

[10]  Kaisa Nyberg,et al.  Perfect Nonlinear S-Boxes , 1991, EUROCRYPT.

[11]  Jennifer Seberry,et al.  Advances in Cryptology — AUSCRYPT '92 , 1992, Lecture Notes in Computer Science.

[12]  M. Smid,et al.  Key escrowing today , 1994, IEEE Communications Magazine.

[13]  Yvo Desmedt,et al.  Threshold Cryptosystems , 1989, CRYPTO.

[14]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[15]  William J. Caelli.  Commercial Key Escrow: An Australian Perspective , 1995, Cryptography: Policy and Algorithms.

[16]  Silvio Micali,et al.  A Simple Method for Generating and Sharing Pseudo-Random Functions, with Applications to Clipper-like Escrow Systems , 1995, CRYPTO.

[17]  Dorothy E. Denning,et al.  A taxonomy for key escrow encryption systems , 1996, CACM.

[18]  Ravi Ganesan,et al.  How to use key escrow , 1996, CACM.

[19]  Ed Dawson,et al.  Cryptography: Policy and Algorithms , 1996, Lecture Notes in Computer Science.

[20]  Josef Pieprzyk,et al.  Towards effective nonlinear cryptosystem design , 1988 .

[21]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[22]  Neil J. A. Sloane,et al.  The theory of error-correcting codes (north-holland , 1977 .

[23]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.