References
- El‐Gamal , T. 1985 . “A Public Key Cryptosystem and Signature Scheme Based on Discrete Logarithms,” . IEEE Transations on Information Theorey , IT‐31 ( 4 ) July : 469 – 472 .
- Fiat , A. and Shamir , A. 1986 . “How to Prove Yourself: Practical Solution to Identification and Signature Problems,” . Advances in Cryptology: Proceedings of Crypto ‘86 , : 186 – 199 .
- Ong , H. , Schnorr , C.P. and Shamir , A. 1984 . “An Efficient Signature Scheme Based on Quadratic Equations,” . Proceedings of the 16th Symposium on the Theory of Computing . April 1984 , Washington DC.
- Rosen , K.H. 1993 . Elementary Number Theory and Applications, , 3rd ed. , Reading, Massachusetts : Addison‐Wesley .
- Seberry , J. 1985 . “A Subliminal Channel in Codes for Authentication without Secrecy,” . Ars Combinatoria , 19A : 337 – 342 .
- Shamir , A. July 1978 . “A Fast Signature Scheme,” . In MIT Laboratory for Computer Science , Tech. Memo. 107 July ,
- Simmons , G.J. 1983 . “The Prisoners Problem and the Subliminal Channel,” . In Advances in Cryptology: Proceedings of Crypto’ , Vol. 83 , 51 – 67 . New York : Plenum .
- Simmons , G.J. 1984 . “The Subliminal Channel and Digital Signatures,” . In Sandia National Laboratory
- Simmons , G.J. 1993 . “Subliminal Communication is Easy Using the DSA,” . In Advances in Cryptology: Proceedings of Eurocrypto ‘93 T65 – T81 .
- Simmons , G.J. and Holdridge , D. “Forward Search as a Cryptanalytic Tool Against a Public Key Privacy Channel,” . Proceedings of the IEEE Computer Socience, 1982 Symposium on Security and Privacy . Oakland, CA. April 26–28 . pp. 117 – 128 .
- Correspondence addressee