Giters

RaymundoBaca / Caesar

This method requires two inputs one a number and a plaintext. The Time Complexity and Space Complexity both are O(N). The encryption formula is En(x) = (x + n) mod 26 and the Decryption formula is Dn(x) = (x – n) mod 26. Made in: Java Netbeans 8.2

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

cryptographycifradocifrado-cesarcriptografiacaesar-cipher

This repository is not active

About

This method requires two inputs one a number and a plaintext. The Time Complexity and Space Complexity both are O(N). The encryption formula is En(x) = (x + n) mod 26 and the Decryption formula is Dn(x) = (x – n) mod 26. Made in: Java Netbeans 8.2

cryptographycifradocifrado-cesarcriptografiacaesar-cipher

Languages

Language:Java 100.0%