Asymmetric Cryptography

  • Fitzpatrick P
N/ACitations
Citations of this article
26Readers
Mendeley users who have this article in their library.

Abstract

Wang and Yu proposed a block cipher scheme based on dynamic sequences generated by multiple chaotic systems, which overcomes the problem of periodical degradation on random sequences due to computational precision. Their scheme has a feature that a plaintext is encrypted by a keystream created from several one-dimensional chaotic maps. However, this feature results in some weaknesses of the encryption algorithm. We show three kinds of attacks in this paper, through which one can recover the plaintext from a given ciphertext without the secret key. We also present an improvement on their scheme, which prevents the three attacks mentioned above. Security of the enhanced cipher is presented and analyzed, which shows that our improved scheme is secure under the current attacks. Copyright 2010 Jun He et al.

Cite

CITATION STYLE

APA

Fitzpatrick, P. (2021). Asymmetric Cryptography. Irish Mathematical Society Bulletin, 0020, 21–31. https://doi.org/10.33232/bims.0020.21.31

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free