Abstract
This paper is concerned with cryptosystems offering perfect or unconditional secrecy. For those perfect-secrecy systems which involve using keys just once, the theory is well established; however, this is not the case for those systems which involve using a key several times. This paper takes a rigorous approach to the definition of such systems, and exhibits some new families of examples of systems providing perfect secrecy for which the number of keys is minimal.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
H. J. Beker and F. C. Piper, Cipher Systems, Van Nostrand, Wokingham, 1982.
A. Bonisoli and P. Quattrocchi, Existence and extension of sharply k-transitive permutation sets: a survey and some new results, Ars Combinatoria, 24A (1987), 163–173.
E. F. Brickell, A few results in message authentication, Congressus Numerantium, 43 (1984), 141–154.
M. De Soete, Some constructions for authentication-secrecy codes, in Advances in Cryptology: Proceedings of Eurocrypt '88, Springer-Verlag, Berlin, 1988, pp. 57–75.
M. De Soete, Bounds and constructions for authentication-secrecy codes with splitting, in Advances in Cryptology: Proceedings of Crypto '88, Springer-Verlag, Berlin, 1990, pp. 311–317.
E. N. Gilbert, F. J. MacWilliams, and N. J. A. Sloane, Codes which detect deception, Bell System Technical Journal, 53 (1974), 405–424.
E. S. Kramer, D. L. Kreher, R. Rees, and D. R. Stinson, On perpendicular arrays with t ≥ 3, Ars Combinatoria, to appear.
E. S. Kramer, S. S. Magliveras, T. van Trung, and Q. Wu, Some perpendicular arrays for arbitrarily large t, Preprint.
F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam, 1977.
J. L. Massey, Cryptography—a selective survey, in Digital Communications (editors: C. Biglieri and C. Prati), Elsevier (North-Holland), Amsterdam, 1986, pp. 3–21.
R. C. Mullin, P. J. Schellenberg, G. H. J. van Rees, and S. A. Vanstone, On the construction of perpendicular arrays, Utilitas Mathematica, 18 (1980), 141–160.
K. Nomura, On t-homogeneous permutation sets, Archiv der Mathematik, 44 (1985), 485–487.
C. R. Rao, Combinatorial arrangements analogous to orthogonal arrays, Sankhya Series A, 23 (1961), 283–286.
C. E. Shannon, Communication theory of secrecy systems, Bell System Technical Journal, 28 (1949), 656–715.
G. Simmons, Authentication theory/coding theory, in Advances in Cryptology: Proceedings of Crypto '84, Springer-Verlag, Berlin, 1985, pp. 411–431.
D. R. Stinson, A construction for authentication/secrecy codes from certain combinatorial designs, Journal of Cryptology, 1 (1988), 119–127.
D. R. Stinson, Some constructions and bounds for authentication codes, Journal of Cryptology, 1 (1988), 37–51.
D. R. Stinson, The combinatorics of authentication and secrecy codes, Journal of Cryptology, 2 (1990), 23–49.
D. R. Stinson and L. Teirlinck, A construction for authentication/secrecy codes from 3-homogeneous permutation groups, European Journal of Combinatorics, to appear.
H. Wielandt, Finite Permutation Groups, Academic Press, New York, 1964.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Godlewski, P., Mitchell, C. Key-minimal cryptosystems for unconditional secrecy. J. Cryptology 3, 1–25 (1990). https://doi.org/10.1007/BF00203966
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00203966