TY - GEN

T1 - Network Security by Merging two Robust Tools from the Mathematical Firmament

AU - Andreas, Andreou

AU - Mavromoustakis, Constandinos X.

AU - Mastorakis, George

AU - Batalla, Jordi Mongay

N1 - Publisher Copyright:
© 2021 IEEE.

PY - 2021

Y1 - 2021

N2 - Significant advances in wireless detection, networking, and IoT technologies presuppose network security and confidentiality demand. Therefore, we develop a novel text encryption framework that has provable security against attacks on cryptosystems. The framework is based on fundamental mathematics and specifically on the Pell-Lucas sequence in conjunction with elliptic curves. We elaborate the plain text by the implementation of three basic steps. Initially, by applying a cyclic shift on the symbol set, we obtain a meaningless plain text. After that, we conceal the elements of the scattered plain text from the adversaries by using the Pell-Lucas sequence, a weight function, and a binary sequence. The binary sequence encodes each component of the diffused plain text into real numbers. In the final step, the encoded scattered plain text is confused by creating permutations over elliptic curves. We then prove that the proposed encryption framework has provable security against brute-force and known-plaintext attack. It is also extremely secure compared with fundamental spacing analysis.

AB - Significant advances in wireless detection, networking, and IoT technologies presuppose network security and confidentiality demand. Therefore, we develop a novel text encryption framework that has provable security against attacks on cryptosystems. The framework is based on fundamental mathematics and specifically on the Pell-Lucas sequence in conjunction with elliptic curves. We elaborate the plain text by the implementation of three basic steps. Initially, by applying a cyclic shift on the symbol set, we obtain a meaningless plain text. After that, we conceal the elements of the scattered plain text from the adversaries by using the Pell-Lucas sequence, a weight function, and a binary sequence. The binary sequence encodes each component of the diffused plain text into real numbers. In the final step, the encoded scattered plain text is confused by creating permutations over elliptic curves. We then prove that the proposed encryption framework has provable security against brute-force and known-plaintext attack. It is also extremely secure compared with fundamental spacing analysis.

KW - confidential ciphertext

KW - cryptography

KW - elliptic curves

KW - Pell-Lucas

UR - http://www.scopus.com/inward/record.url?scp=85128779283&partnerID=8YFLogxK

U2 - 10.1109/MSN53354.2021.00094

DO - 10.1109/MSN53354.2021.00094

M3 - Conference contribution

AN - SCOPUS:85128779283

T3 - Proceedings - 2021 17th International Conference on Mobility, Sensing and Networking, MSN 2021

SP - 616

EP - 621

BT - Proceedings - 2021 17th International Conference on Mobility, Sensing and Networking, MSN 2021

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 17th International Conference on Mobility, Sensing and Networking, MSN 2021

Y2 - 13 December 2021 through 15 December 2021

ER -