A Block Encryption Construction Based on Bi-Periodic Pell Matrices and Elliptic Curve Group Operations
Open Access
Abstract
This paper presents a theoretical algebraic block transformation based on bi-periodic Pell matrices and elliptic-curve point-valued blocks. The construction uses block-dependent scalar key matrices to transform plaintext blocks whose entries lie in a selected elliptic-curve subgroup of prime order . The encryption operation is defined by the elliptic-curve scalar matrix action where the entries of act as scalar coefficients modulo , and point additions are performed in . The main purpose of the construction is to formalize the interaction between recursive Pell-type matrix sequences over and elliptic-curve point-valued block transformations. The algebraic correctness follows from the invertibility of over and the compatibility of the -action with the matrix multiplication. The deterministic version is not claimed to provide semantic security or IND-CPA security without additional randomization, nonce-dependent masking, and formal security proofs.
Keywords
This publication has 13 references indexed in Scilit:
- Coding theory for h(x)-Fibonacci polynomialsBalıkesir Üniversitesi Fen Bilimleri Enstitüsü Dergisi, 2024
- FPGA Acceleration of Fully Homomorphic Encryption over the Torus2022
- The matrix sequence in terms of bi-periodic Fibonacci numbersCommunications Faculty of Sciences University of Ankara Series A1 Mathematics and Statistics, 2019
- A New Application to Coding Theory via Fibonacci and Lucas NumbersMathematical Sciences and Applications E-Notes, 2019
- Understanding Cryptography2010
- The generalized relations among the code elements for Fibonacci coding theoryChaos, Solitons & Fractals, 2009
- The Arithmetic of Elliptic Curves2009
- Foundations of Cryptography2001
- Elliptic curve cryptosystemsMathematics of Computation, 1987
- Cryptography in An Algebraic AlphabetThe American Mathematical Monthly, 1929