fermat’s little theorem
Recently Published Documents


TOTAL DOCUMENTS

59
(FIVE YEARS 8)

H-INDEX

4
(FIVE YEARS 0)

2022 ◽  
pp. 1-15
Author(s):  
Fernanda D. de Melo Hernández ◽  
César A. Hernández Melo ◽  
Horacio Tapia-Recillas

2021 ◽  
pp. 95-111
Author(s):  
Satyabrota Kundu ◽  
Sypriyo Mazumder

2020 ◽  
Vol 2231-3478 (2319-8052) ◽  
pp. 1-3
Author(s):  
LOKANATH SAHOO ◽  

Nowadays, protecting sensitive factual information from hackers when it is transmitted over the broad network to communicate around the world is a huge task. To provide secure online transactions, communication, and business, researchers are insisted to develop novel security techniques. One of these approaches is on the basis of encrypting a plaintext will be in ciphertext by applying some mathematical models. This paper suggested a modified Blowfish algorithm with Fermat’s Little Theorem to provide an additional layer of security for sensitive information while sending over a non-secure channel. The performance analysis of Modified Blowfish Algorithm and Fermat’s Little Theorem (BFLT) encryption algorithm reveals consumption of memory, time consumption for encrypting and decrypting by comparing with the standard encryption algorithm. According to the analysis, this proposed encryption algorithm provides significantly upper level of performance and security and BFLT can be used for real-time implementations


Author(s):  
MJ Sanada Khumanthem ◽  
Kh Manglem Singh

2018 ◽  
Vol 14 (3) ◽  
pp. 331-333
Author(s):  
Olamide Funmilayo Florence ◽  
Tahir Ahmad ◽  
Adaraniwon Amos Olalekan

Fermat’s little theorem has been proved using different mathematical approaches, which majority of them are based on number theory. These approaches have only exposed the usability of Fermat’s little theorem for logical, linear and structural predictions. Only small numbers of attempts had only been made to proof Fermat’s little theorem from other perspectives. This paper exhibits an alternative approach to proof the Fermat’s little theorem via dynamical system. Two lemmas are proven with respect to a redefined function, Tn (x) in order to achieve the task.


2018 ◽  
Vol 08 (01) ◽  
pp. 41-44
Author(s):  
Thomas Beatty ◽  
Marc Barry ◽  
Andrew Orsini

Sign in / Sign up

Export Citation Format

Share Document