Abstract
The attempt of using the techniques of error correction coding for building the cryptographic system, which can detect the manipulations on cryptograms, is shown in the paper. Presented approach to generating cipher, generating redunant ciphertexts, which are resistant to manipulations, allows to fulfilling the accessibility as well as confidentiality and authenticity. The capacity of obtained ciphertexts, by mean of statistical tests’ results, is also presented.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
T. Hebisz, Cz. Kościelny. A method of constructing symmetric-key block cryptosystem resistant to manipulations on ciphertext. Bulletin of the Polish Academy of Sciences, Technical Sciences, Vol. 50, No. 4, 2002.
T. Hebisz, E. Kuriata, M. Jackiewicz. Fulfilment of computer security and safety by using symmetric-key block cryptosystem resistant to manipulations on ciphertext. International Conference on Computer Information Systems and Industrial Management Applications CISIM’ 03, 2003.
A. Kiayias, M. Yung Polynomial Reconstruction Based Cryptography. SAC 2001. ICALP 2002. LNCS 2259. pp. 129–133. Springer-Verlag. 2002.
A. Kiayias, M. Yung Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes. Springer-Verlag. ICALP 2002. LNCS 2380. pp. 232–243. 2002.
L. Knudsen, B. Preneel Construction of Secure and Fast Hash Function Using Nonbinary Error-Correcting Codes. IEEE Trans. on Information Theory. Vol. 48. No. 9. pp. 2524–2537. 2002.
Cz. Kościelny. Computing in the composite GF(q m ) of characteristic 2 formed by means of an irreducible binomial, International Journal of Applied Mathematics and Computer Science, Vol. 8, No. 3, pp. 671–680, 1998.
Cz. Kościelny, T. Hebisz. More secure computing infinite fields for cryptographic applications. Mathematical Theory of Networks and Systems MTNS 2000, The fourteenth International Conference, Perpignan, 2000, CD-ROM.
E. Krouk. A new Public Key Cryptosystem. Proc. of Sixth Joint Swedish-Ruppian Intern. Workshop on Information Theory, 1993.
E. Kuriata. Error correction codes in crytography. VI Intern. conference “Wojskowa Konferencja Telekomunikacji i Informatyki”, 1997 (in polish).
Y. X. Li, R H. Deng, X. M. Wang. On the equivalence of McEliece’s and Niederreiter’s public-key cryptosystems. IEEE Trans. on Information Theory. Vol. 40. pp. 271–273. 1994
R. Lidl, H. Niederreiter. Introduction to finite fields and their applications. Cambridhe University Prepp, 1986.
G. Marsaglia. Statistical tests Diehard, http://stat.fsu.edu/~geo/diehard.html.
R. J. McEliece. A Public Key Cryptosystem Based on Algebraic Coding Theory. JPLDSN Progrepp Rept, pp. 42–44, 1978.
A. J. Menezes, ed. Application of Finite Fields. Kluwer Academic Publishers, 1993.
H. Niederreiter. Knapsak-type cryptosystems and algebraic coding theory, Probl. Control and Inform. Theory, Vol. 15, 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer Science+Business Media, Inc.
About this paper
Cite this paper
Hebisz, T., Kuriata, E. (2005). The capacity of ciphers fulfilling the accessibility of cryptograms. In: Pejaś, J., Piegat, A. (eds) Enhanced Methods in Computer Security, Biometric and Artificial Intelligence Systems. Springer, Boston, MA. https://doi.org/10.1007/0-387-23484-5_2
Download citation
DOI: https://doi.org/10.1007/0-387-23484-5_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4020-7776-0
Online ISBN: 978-0-387-23484-7
eBook Packages: Computer ScienceComputer Science (R0)