Information security has immense importance in today’s world of digital communication. Sharing information between intended parties while keeping it secret from any outsider is a challenging task. Cryptography provides the security of information by keeping the information secret among only the communicating parties. In this paper, a new cryptographic algorithm is propounded, which is a block cipher algorithm. A positive integer, n, two \(n\times 256\) tables of ASCII characters, and a string, Mapper, are used as shared private keys in the proposed method. Every row of the key tables and Mapper contains a random permutation of all the ASCII characters. In the beginning of encryption of a block, an Exclusive Or (XOR) operation is done between the block and a random array of integers. Then, a 3-round substitution operation is done using the key tables and Mapper. We found that the encryption and the decryption speed of the proposed algorithm is faster than the encryption–decryption speed of Advanced Encryption Standard (AES) and Data Encryption Standard (DES). The strength of the proposed cipher was analyzed in the light of some popular attacks, and we found that the system is strong enough against those attacks. We hope that if integrated with the modern cryptography protocols, this method will enhance modern digital communication security.

在当今的数字通信世界中，信息安全至关重要。在预期的各方之间共享信息，同时使其对任何外部人都保密，这是一项艰巨的任务。密码术通过仅在通信方之间对信息保密，从而提供了信息安全性。本文提出了一种新的密码算法，即分组密码算法。在该方法中，正整数n，两个ASCII字符\\（n \ times 256 \）表和字符串Mapper用作共享私钥。关键表和Mapper的每一行包含所有ASCII字符的随机排列。在块加密开始时，在块与整数随机数组之间执行“异或”（XOR）操作。然后，使用键表和Mapper完成三轮替换操作。我们发现，该算法的加密和解密速度比高级加密标准（AES）和数据加密标准（DES）的加密解密速度快。根据一些流行的攻击对建议密码的强度进行了分析，我们发现该系统足以抵御那些攻击。我们希望，如果与现代加密协议集成，此方法将增强现代数字通信的安全性。