Giuseppe Filippone

Dr. Giuseppe Filippone

Mathematics and Computer Science, University of Palermo, Palermo, Sicilia, Italy
orcid

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 September 2025 in Electronics
Verified
Journal Article
Open access
PDF file
LCLydia Castronovo
Lydia Castronovo
GFGiuseppe Filippone
Giuseppe Filippone
MGMario Galici
Mario Galici
GRGianmarco La Rosa
Gianmarco La Rosa
MTMarco Elio Tabacchi
Marco Elio Tabacchi
This paper extends a novel method for fuzzifying crisp ontologies through a fuzzy Multi-Criteria Group Decision-Making (MCGDM) approach. The key feature of the method is the achievement of a geometric compromise obtained by minimising distances among the best alternatives provided by experts, and by assigning and refining membership degrees for entities and relations in order to better capture uncertainty and vagueness. Its effectiveness is demonstrated on two case studies, the Cognitive Task Ontology (CogiTO) and the BrainTeaser Ontology (BTO), which showcase the potential of the proposed method in complex decision-making scenarios. Many applications are possible, including the enhancement of knowledge integration and the development of more informative reasoning under uncertainty.



1 May 2025
Verified
Book Chapter
Closed access
PDF file
GFGiuseppe Filippone
Giuseppe Filippone
GRGianmarco La Rosa
Gianmarco La Rosa
MMManuel Mancini
Manuel Mancini
MTMarco Elio Tabacchi
Marco Elio Tabacchi

11 July 2025
Verified
Book Chapter
Closed access
PDF file
GFGiuseppe Filippone
Giuseppe Filippone
MGMario Galici
Mario Galici
GRGianmarco La Rosa
Gianmarco La Rosa
MTMarco Elio Tabacchi
Marco Elio Tabacchi

1 January 2024 in Advances in Mathematics of Communications
Verified
Journal Article
Closed access
PDF file
GFGiuseppe Filippone
Giuseppe Filippone
The difficulty of solving the ECDLP is the foundation of the security of elliptic curve cryptography (ECC). A connection between the lifting problem on a curve in Weierstrass form and the ECDLP has been stressed by Silverman. Based on this, in order to study the ECDLP, we compute the exponential map for Edwards curves, which are more efficient for cryptographic use, as proved by Bernstein and Lange. In this paper, using the birational equivalence between Edwards curves and elliptic curves in Weierstrass form, we extend the map $ {\mathrm{Exp}} $ to Edwards curves over local fields. Furthermore, we compute the map $ {\mathrm{Exp}} $ for the specific case of $ p $-adic numbers. More recently, curves over local fields have been investigated by Tang, Xu, and Qi, who introduced a cryptosystem based on their quotient groups.