Digital evolution has metamorphosed the nature of online communication. A strong encryption algorithm imparts adequate security to user information but also consumes the equivalent time for the transfer from the source to the destination. This research accentuates the need for generating novel cryptographic algorithms with faster encryption and decryption. A contemporary design algorithm called ‘greedy encryption algorithm’ (GEA) uses greedy methods to generate cipher text as a ‘minimum spanning tree’ path. The input characters serve as the nodes and the position of the characters in the dataset provides the weight between the characters. GEA using Prim’s algorithm offers more variability and strength than GEA using Kruskal’s algorithm. The encrypted text is independent of the generated key in GEA. Encryption and decryption in GEA are two distinct processes that involve different steps. The security provided by GEA is decentralized, which helps it emerge strong against several cryptographic attacks. GEA is a technique that is best suited for processing small-length input text.