Abstract
This paper proposes and analyzes an approach for design of stream ciphers based on joint computing over random and secret data. Feasibility of encryption/ decryption computation when the ciphertext involve pure random data is shown. The core element of the proposed approach for stream ciphering is a pseudo-random embedding of the random bits into the ciphertext and this embedding plays role of a homophonic encoding. The initial ciphertext with the embedded random bits is further on intentionally degraded by its exposure to a moderate noise which can be modelled as the binary symmetric channel effect. A security evaluation of the proposed approach implies that its security appears as a consequence of hardness of the LPN problem, as well. The developed design has potential of providing that complexity of recovering the secret key in the known plaintext attack scenario is close to the complexity of recovering the secret key via the exhaustive search, i.e. close to the maximal possible one for the given size of the secret key. The proposed approach can be considered as a trade-off between the increased security and decreased communications efficiency which in a number of scenarios appears as a suitable one.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Aumasson J-P, Finiasz M, Meier W, Vaudenay S (2007) TCHo: a hardware-oriented trapdoor cipher. ACISP 2007. Lect Notes Comput Sci 4586: 184–199
Biryukov A, Shamir A (2000) Cryptanalytic time/memory/data tradeoffs for stream ciphers. ASIACRYPT 2000. Lect Notes Comput Sci 1976: 1–13
Blum A, Furst M, Kearns M, Lipton R (1994) Cryptographic primitives based on hard learning problems, CRYPTO 1993. Lect Notes Comput Sci 773: 278–291
Fossorier M, Mihaljević MJ, Imai H, Cui Y, Matsuura K (2006) An algorithm for solving the LPN problem and its application to security evaluation of the HB protocols for RFID. Authentication INDOCRYPT 2006. Lect Notes Comput Sci 4329: 48–62
Fossorier M, Mihaljević MJ, Imai H (2007) Modeling block encoding approaches for fast correlation attack. IEEE Trans Inform Theory 53: 4728–4737
Gilbert H, Robshaw MJB, Seurin Y (2008) HB#: increasing the security and efficiency of HB+. EUROCRYPT2008. Lect Notes Comput Sci 4965: 361–378
Gilbert H, Robshaw MJB, Seurin Y (2008) How to Encrypt with the LPN Problem. ICALP 2008. Lect Notes Comput Sci 5126: 679–690
Hellman ME (1980) A cryptanalytic time-memory trade-off. IEEE Trans Inform Theory 26: 401–406
Hopper N, Blum M (2001) Secure human identification protocols. ASIACRYPT 2001. Lect Notes Comput Sci 2248: 52–66
Jendal HN, Kuhn YJB, Massey JL (1990) An information-theoretic treatment of homophonic substitution. EUROCRYPT’89. Lect Notes Comput Sci 434: 382–394
Kara O, Erguler I (2008) A new approach to keystream based cryptosystems. SASC 2008. Workshop Record, pp 205–221
Katz J (2007) Efficient cryptographic protocols based on the hardness of learning parity with noise. Cryptography and coding 2007. Lect Notes Comput Sci 4887: 1–15
McEliece RJ (1978) A public key cryptosystem based on algebraic coding theory. DSN Prog Rep 42(44): 114–116
Mihaljević MJ (2007) Generic framework for secure Yuen 2000 quantum-encryption employing the wire-tap channel approach. Phys Rev A 75:052334-1-5
Mihaljević MJ, Fossorier M, Imai H (2007) Security evaluation of certain broadcast encryption schemes employing a generalized time-memory-data trade-off. IEEE Commun Lett 11: 988–990
Rivest R, Sherman T (1983) Randomized encryption techniques. In: Advances in cryptology: proceedings of CRYPTO ’82, Plemum, New York, pp 145–163
Ryabko B, Fionov A (1999) Efficient homophonic coding. IEEE Tran Inform Theory 45: 2083–2094
Sloane NJA (1982) Error-correcting codes and cryptography–part I. Cryptologia 6: 128–153
Wyner AD (1975) The wire-tap channel. Bell Syst Tech J 54: 1355–1387
Willett M (1980) Deliberate noise in a modern cryptographic system. IEEE Trans Inform Theory 26: 102–104
Author information
Authors and Affiliations
Corresponding author
Additional information
M. J. Mihaljević was supported by the grant ON144018 of the Ministry for Science and Tech.
Rights and permissions
About this article
Cite this article
Mihaljević, M.J., Imai, H. An approach for stream ciphers design based on joint computing over random and secret data. Computing 85, 153–168 (2009). https://doi.org/10.1007/s00607-009-0035-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00607-009-0035-x