Norbert Tihanyi

Orcid: 0000-0002-9002-5935

According to our database1, Norbert Tihanyi authored at least 25 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Privacy-Preserving Password Cracking: How a Third Party Can Crack Our Password Hash Without Learning the Hash Value or the Cleartext.
IEEE Trans. Inf. Forensics Secur., 2024

CyberMetric: A Benchmark Dataset for Evaluating Large Language Models Knowledge in Cybersecurity.
CoRR, 2024

D(HE)at: A Practical Denial-of-Service Attack on the Finite Field Diffie-Hellman Key Exchange.
IEEE Access, 2024

Revolutionizing Cyber Threat Detection With Large Language Models: A Privacy-Preserving BERT-Based Lightweight Model for IoT/IIoT Devices.
IEEE Access, 2024

ESBMC v7.4: Harnessing the Power of Intervals - (Competition Contribution).
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2024

2023
Simple chain automaton random number generator for IoT devices.
Acta Informatica, September, 2023

ESBMC v7.4: Harnessing the Power of Intervals.
CoRR, 2023

SecureFalcon: The Next Cyber Reasoning System for Cyber Security.
CoRR, 2023

Revolutionizing Cyber Threat Detection with Large Language Models.
CoRR, 2023

A New Era in Software Security: Towards Self-Healing Software via Large Language Models and Formal Verification.
CoRR, 2023

Edge Learning for 6G-Enabled Internet of Things: A Comprehensive Survey of Vulnerabilities, Datasets, and Defenses.
IEEE Commun. Surv. Tutorials, 2023

The FormAI Dataset: Generative AI in Software Security through the Lens of Formal Verification.
Proceedings of the 19th International Conference on Predictive Models and Data Analytics in Software Engineering, 2023

2022
Report on the First DES Fixed Points for Non-Weak Keys: Case-Study of Hacking an IoT Environment.
IEEE Access, 2022

2021
A Pseudorandom number Generator with Full Cycle Length based on Automata Compositions.
Informatica (Slovenia), 2021

A Full Cycle Length Pseudorandom Number Generator Based on Compositions of Automata.
Informatica (Slovenia), 2021

Creating effective fingerprint artefacts: a cooperative and a non-cooperative method for bypassing capacitive and optical sensors with high success rate.
Proceedings of the 2021 International Carnahan Conference on Security Technology, 2021

2020
Numerical computing of extremely large values of the Riemann-Siegel Z-function
PhD thesis, 2020

A general construction for generating pseudorandom sequences using the digit expansion of real functions.
Proceedings of the 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2020

The Theory and Practice of Magic Hash Based Attacks on Lightweight Cryptographic Hash Functions in Complex IoT Environments.
Proceedings of the Security, Privacy, and Anonymity in Computation, Communication, and Storage, 2020

2019
Some Remarks and Tests on the Dh1 Cryptosystem Based on Automata Compositions.
Informatica (Slovenia), 2019

2018
Computation Results of the Riemann Zeta Search Project.
Proceedings of the 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2018

2017
Computing Extremely Large Values of the Riemann Zeta Function.
J. Grid Comput., 2017

Statistical Analysis of DH1 Cryptosystem.
Acta Cybern., 2017

2014
Fast Method for Locating Peak Values of the Riemann Zeta Function on the Critical Line.
Proceedings of the 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2014

Unrevealed Patterns in Password Databases Part One: Analyses of Cleartext Passwords.
Proceedings of the Technology and Practice of Passwords, 2014


  Loading...