Panagiotis E. Nastou

Prof. Dr. Panagiotis E. Nastou

orcid

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
30 October 2023 in Cryptography
Verified
Journal Article
Open access
PDF file
Anastasios BikosAnastasios Bikos
Anastasios Bikos
PNPanagiotis E. Nastou
Panagiotis E. Nastou
GPGeorgios Petroudis
Georgios Petroudis
YSYannis Stamatiou
Yannis Stamatiou
In this paper, we present approaches to generating random numbers, along with potential applications. Rather than trying to provide extensive coverage of several techniques or algorithms that have appeared in the scientific literature, we focus on some representative approaches, presenting their workings and properties in detail. Our goal is to delineate their strengths and weaknesses, as well as their potential application domains, so that the reader can judge what would be the best approach for the application at hand, possibly a combination of the available approaches. For instance, a physical source of randomness can be used for the initial seed; then, suitable preprocessing can enhance its randomness; then, the output of preprocessing can feed different types of generators, e.g., a linear congruential generator, a cryptographically secure one and one based on the combination of one-way hash functions and shared key cryptoalgorithms in various modes of operation. Then, if desired, the outputs of the different generators can be combined, giving the final random sequence. Moreover, we present a set of practical randomness tests that can be applied to the outputs of random number generators in order to assess their randomness characteristics. In order to demonstrate the importance of unpredictable random sequences, we present an application of cryptographically secure generators in domains where unpredictability is one of the major requirements, i.e., eLotteries and cryptographic key generation.

14 September 2023 in Preprints.org
Verified
Preprint
Open access
PDF file
Anastasios BikosAnastasios Bikos
Anastasios Bikos
PNPanagiotis E. Nastou
Panagiotis E. Nastou
GPGeorgios Petroudis
Georgios Petroudis
YSYannis Stamatiou
Yannis Stamatiou
This paper we present approaches for generating random numbers along with potential applications. Rather than trying to provide extensive coverage of several techniques or algorithms that have appeared in the scientific literature, we focus on some representative approaches presenting their workings and properties in detail. Our goal is to delineate their strengths and weaknesses as well as their potential application domains so as the reader can judge what would be the best approach for the application in hand, possibly a combination of the available approaches. For instance, a physical source of randomness can be used for the initial seed, then suitable preprocessing can enhance its randomness and then the output of the preprocessing can feed different types of generators, e.g. a linear congruential generator, a cryptographically secure one and one based on the combination of one way hash functions and shared key cryptoalgorithms in various modes of operation. Then, if desired, the outputs of the different generators can be combined giving the final random sequence. Moreover, we present a set of practical randomness tests which can be applied on the outputs of random number generators in order to assess their randomness characteristics. In order to demonstrate the importance of unpredictable random sequences, we present an application of cryptographically secure generators in domains where unpredictability is one of the major requirements, i.e. eLotteries and cryptographic key generation.

21 August 2025 in Engineering Proceedings
Verified
Conference Paper
Open access
PDF file
Stavros N. MoutsisStavros N. Moutsis
Stavros N. Moutsis
Despoina IoakeimidouDespoina Ioakeimidou
Despoina Ioakeimidou
Konstantinos A. TsintotasKonstantinos A. Tsintotas
Konstantinos A. Tsintotas
KEKonstantinos Evangelidis
Konstantinos Evangelidis
PNPanagiotis E. Nastou
Panagiotis E. Nastou
ATAntonis Tsolomitis
Antonis Tsolomitis
Artificial intelligence (AI) is a cutting-edge and revolutionary technology in computer science that has the potential to completely transform a wide range of disciplines, including the social sciences, the arts, and the humanities. Therefore, since its significance has been recognized in engineering and medicine, history, literature, paleography, and archaeology have recently embraced AI as new opportunities have arisen for preserving ancient manuscripts. Acknowledging the importance of digitizing archival documents, this paper explores the use of advanced technologies during this process, showing how these are employed at each stage and how the unique challenges inherent in past scripts are addressed. Our study is based on Cyril’s Lexicon, a Byzantine-era dictionary of great historical and linguistic significance in Greek territory.

20 August 2022 in Cryptography
Verified
Journal Article
Open access
PDF file
VLVASILIKI LIAGKOU
VASILIKI LIAGKOU
PNPanagiotis E. Nastou
Panagiotis E. Nastou
PSPaul Spirakis
Paul Spirakis
YSYannis Stamatiou
Yannis Stamatiou
The Panopticon (which means “watcher of everything”) is a well-known prison structure of continuous surveillance and discipline studied by Bentham in 1785. Today, where persistent, massive scale, surveillance is immensely facilitated by new technologies, the term Panopticon vaguely characterizes institutions with a power to acquire and process, undetectably, personal information. In this paper we propose a theoretical framework for studying Panopticons and their detectability status. We show, based on the Theory of Computation, that detecting Panopticons, modelled either as a simple Turing Machine or as an Oracle Turing Machine, is an undecidable problem. Furthermore, we show that for each sufficiently expressive formal system, we can effectively construct a Turing Machine for which it is impossible to prove, within the formal system, its Panopticon status. Finally, we discuss how Panopticons can be physically detected by the heat they dissipate each time they acquire, effortlessly, information in the form of an oracle and we investigate their detectability status with respect to a more powerful computational model than classical Turing Machines, the Infinite Time Turing Machines (ITTMs).

30 June 2015 in Optimization Letters
Verified
Journal Article
Closed access
PDF file
PNPanagiotis E. Nastou
Panagiotis E. Nastou
VPVassilis Papadinas
Vassilis Papadinas
Panos M. PardalosPanos M. Pardalos
Panos M. Pardalos
YSYannis Stamatiou
Yannis Stamatiou