Asymmetric encryption

Public key : h = 57251611150727890142436231421751030862246877776994203725031983010721065164656737413228352577933167834458424799958699296886417563085940307695803998731046038483413588377152808066195906534796736908315286998481645571190997335356096595 f = 10378738218062183249209738211086120691124417614399791374613333601522225236253813729426082937385434905927655673216939902792254408255544223108875540489686910593889055405993898 Alice and bob are using an asymmetric encryption whose php implementation is available here to communicate secretly. Below, a secret message crypted with the previous public key. Recover the corresponding plaintext message. C : 56916980768017924007851301882527048361867399199088585894973909447186527369040346671556302507918751560122956754203656586834657589673261146757496931531568780344208785266547816075269817348239760634744197132642384013306011897916980069 You have 3 seconds to solve this challenge. Digital values change on each page refresh.

[1] Public-key cryptography [2] Modular arithmetic