Comparing Checksums by Symmetric Encryption | Zendy

G. Kavitha | Zendy; K. P. Thooyamani | Zendy; R Kavitha | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Comparing Checksums by Symmetric Encryption

Author(s) -

G. Kavitha,

K. P. Thooyamani,

R Kavitha

Publication year - 2019

Publication title -

international journal of recent technology and engineering (ijrte)

Language(s) - English

Resource type - Journals

ISSN - 2277-3878

DOI - 10.35940/ijrte.b1436.0882s819

Subject(s) - checksum , encryption , expansive , computer science , symmetric key algorithm , computer security , work (physics) , theoretical computer science , public key cryptography , operating system , engineering , physics , mechanical engineering , compressive strength , thermodynamics

The ramifications of cacheable symmetries have been expansive and unavoidable. In this work, we demonstrate the assessment of symmetric encryption. In this work, we show not just that e-business and virtual machines are completely inconsistent, however that the same is valid for the transistor

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research