Security is the cornerstone of all kinds of digital transformation. As the demand for secure data encryption grows, the algorithms we use must be secure. Algorithms are not always the issue, it is also about settings, like key length. Security of students' academic records is essential when their relevant data are being transmitted over public networks using computerized data. Research on the improvement of different optimization algorithms has become increasingly important as optimization problems have become more complex. Monarch Butterfly Optimization (MBO) has proved to be an effective algorithm for solving a wide range of optimization problems. A hybrid MBO and Ed25519 is developed in this paper in order to address these issues. This paper proposes an approach for Ed25519 that optimizes the calculation steps for the need of a monarch butterfly optimization in order to speed up factorization time in affine coordinates. In general, proposed equations can be used for Elliptic Curve Cryptography (ECC) and Elliptic Curve Digital Signature Algorithm (ECDSA), which use the same principle and thus can be more efficient. In Ed25519, elliptic curves are combined with defined group operations to form groups. To ensure fast implementation, we optimize these operations based on specific architectures or approaches. In the realm of communication confidentiality, several essential expectations come into play to ensure the preservation and secure transmission of information. These expectations include data integrity, data origin authentication, entity authentication, non-repudiation, and maintaining confidentiality during data exchange. Tests and comparisons of performance revealed that the proposed algorithm improves Time computation efficiency significantly. As a result, it has practical significance for monarch butterfly optimization and will be applied to Ed25519 as well.