![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Umar Hayat
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j18]Takreem Haider
, Saúl A. Blanco
, Umar Hayat:
A novel pseudo-random number generator based on multivariable optimization for image-cryptographic applications. Expert Syst. Appl. 240: 122446 (2024) - [j17]Takreem Haider
, Naveed Ahmed Azam
, Umar Hayat
:
Substitution box generator with enhanced cryptographic properties and minimal computation time. Expert Syst. Appl. 241: 122779 (2024) - 2023
- [j16]Naveed Ahmed Azam, Jianshen Zhu
, Umar Hayat, Aleksandar Shurbevski
:
Towards provably secure asymmetric image encryption schemes. Inf. Sci. 631: 164-184 (2023) - [j15]Mohammad Abdul Mujeeb Khan, Naveed Ahmed Azam, Umar Hayat, Hailiza Kamarulhaili:
A novel deterministic substitution box generator over elliptic curves for real-time applications. J. King Saud Univ. Comput. Inf. Sci. 35(1): 219-236 (2023) - [i4]Takreem Haider, Saúl A. Blanco, Umar Hayat:
A Novel Pseudo-Random Number Generator Based on Multi-Objective Optimization for Image-Cryptographic Applications. CoRR abs/2307.03911 (2023) - 2022
- [j14]Umar Hayat, Ikram Ullah, Naveed Ahmed Azam
, Sumaira Azhar:
A Novel Image Encryption Scheme Based on Elliptic Curves over Finite Rings. Entropy 24(5): 571 (2022) - [j13]Fazal Abbas, Mubasher Umer
, Umar Hayat
, Ikram Ullah
:
Trivial and Nontrivial Eigenvectors for Latin Squares in Max-Plus Algebra. Symmetry 14(6): 1101 (2022) - 2021
- [j12]Ikram Ullah, Naveed Ahmed Azam, Umar Hayat:
Efficient and secure substitution box and random number generators over Mordell elliptic curves. J. Inf. Secur. Appl. 56: 102619 (2021) - [j11]Naveed Ahmed Azam, Umar Hayat, Maria Ayub:
A substitution box generator, its analysis, and applications in image encryption. Signal Process. 187: 108144 (2021) - 2020
- [j10]Ikram Ullah, Umar Hayat, Miguel D. Bustamante
:
Image Encryption Using Elliptic Curves and Rossby/Drift Wave Triads. Entropy 22(4): 454 (2020) - [j9]Mubasher Umer
, Umar Hayat, Fazal Abbas, Anurag Agarwal, Petko Kitanov:
An Efficient Algorithm for Eigenvalue Problem of Latin Squares in a Bipartite Min-Max-Plus System. Symmetry 12(2): 311 (2020) - [c3]Adeel Shahzad, Hafiz Tayyab Rauf
, Tayyaba Asghar, Umar Hayat:
Comparison of Probability Distributions for Evolving Artificial Neural Networks Using Bat Algorithm. AHFE (13) 2020: 97-104 - [c2]Shaban Zulfiqar, Safa Arooj, Umar Hayat, Suleman Shahid, Asim Karim:
Automated Generation of Accessible PDF. ASSETS 2020: 91:1-91:3 - [c1]Ali Mirza
, Imran Siddiqi
, Umar Hayat
, Muhammad Atif
, Syed Ghulam Mustufa
:
Recognition of Cursive Caption Text Using Deep Learning - A Comparative Study on Recognition Units. ICPRAI 2020: 156-167 - [i3]Ikram Ullah, Umar Hayat, Miguel D. Bustamante
:
An efficient image encryption scheme based on ordered quasi-resonant Rossby/drift wave triads and Mordell elliptic curves. CoRR abs/2003.03394 (2020)
2010 – 2019
- 2019
- [j8]Umar Hayat, Shahid Amanullah, Shane Walsh, Mamoon Abdullah, Miguel D. Bustamante
:
Discrete resonant Rossby/drift wave triads: Explicit parameterisations and a fast direct numerical search algorithm. Commun. Nonlinear Sci. Numer. Simul. 79: 104896 (2019) - [j7]Naveed Ahmed Azam
, Umar Hayat, Ikram Ullah:
Efficient construction of a substitution box based on a Mordell elliptic curve over a finite field. Frontiers Inf. Technol. Electron. Eng. 20(10): 1378-1389 (2019) - [j6]Umar Hayat, Naveed Ahmed Azam:
A novel image encryption scheme based on an elliptic curve. Signal Process. 155: 391-402 (2019) - [j5]Mubasher Umer, Umar Hayat
, Fazal Abbas:
An Efficient Algorithm for Nontrivial Eigenvectors in Max-Plus Algebra. Symmetry 11(6): 738 (2019) - [i2]Ikram Ullah, Naveed Ahmed Azam, Umar Hayat:
Efficient and Secure Substitution Box and Random Number Generators Over Mordell Elliptic Curves. CoRR abs/1910.05576 (2019) - 2018
- [j4]Naveed Ahmed Azam
, Umar Hayat
, Ikram Ullah
:
An Injective S-Box Design Scheme over an Ordered Isomorphic Elliptic Curve and Its Characterization. Secur. Commun. Networks 2018: 3421725:1-3421725:9 (2018) - [j3]Umar Hayat, Daniel López-Aguayo
, Akhtar Abbas:
Fixed Points of Automorphisms of Certain Non-Cyclic p-Groups and the Dihedral Group. Symmetry 10(7): 238 (2018) - [j2]Umar Hayat, Naveed Ahmed Azam, Muhammad Asif:
A Method of Generating 8 × 8 Substitution Boxes Based on Elliptic Curves. Wirel. Pers. Commun. 101(1): 439-451 (2018) - [i1]Naveed Ahmed Azam, Umar Hayat, Ikram Ullah:
Efficient Construction of S-boxes Based on a Mordell Elliptic Curve Over a Finite Field. CoRR abs/1809.11057 (2018) - 2013
- [j1]Miguel D. Bustamante
, Umar Hayat:
Complete classification of discrete resonant Rossby/drift wave triads on periodic domains. Commun. Nonlinear Sci. Numer. Simul. 18(9): 2402-2419 (2013)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-19 21:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint