Zobrazeno 1 - 10
of 61
pro vyhledávání: '"Ţiplea, Ferucio Laurenţiu"'
Finding a low-weight multiple (LWPM) of a given polynomial is very useful in the cryptanalysis of stream ciphers and arithmetic in finite fields. There is no known deterministic polynomial time complexity algorithm for solving this problem, and the m
Externí odkaz:
http://arxiv.org/abs/2410.10224
The concept of Generalized Inverse based Decoding (GID) is introduced, as an algebraic framework for the syndrome decoding problem (SDP) and low weight codeword problem (LWP). The framework has ground on two characterizations by generalized inverses
Externí odkaz:
http://arxiv.org/abs/2202.08640
Autor:
Ţiplea, Ferucio Laurenţiu1 ferucio.tiplea@uaic.ro, Hristea, Cristian2 cristi.hristea@gmail.com, Bulai, Rodica3 rodica.bulai@ati.utm.md
Publikováno v:
Computer Science Journal of Moldova. 2022, Vol. 30 Issue 3, p335-359. 25p.
We propose a formal proof of the undecidability of the model checking problem for alternating- time temporal logic under imperfect information and perfect recall semantics. This problem was announced to be undecidable according to a personal communic
Externí odkaz:
http://arxiv.org/abs/1102.4225
Autor:
Ţiplea, Ferucio Laurenţiu1,2 (AUTHOR) ferucio.tiplea@uaic.ro
Publikováno v:
International Journal of Information Security. Jun2022, Vol. 21 Issue 3, p563-575. 13p.
Publikováno v:
In Information Sciences October 2018 463-464:75-85
Autor:
Ţiplea, Ferucio Laurenţiu1 (AUTHOR) ferucio.tiplea@uaic.ro
Publikováno v:
Mathematics (2227-7390). Mar2022, Vol. 10 Issue 6, p908. 9p.
Publikováno v:
In Information Sciences 20 April 2016 339:85-97
Autor:
Nica, Anca-Maria1 contact@ancamarianica.ro, Ţiplea, Ferucio Laurenţiu1 ferucio.tiplea@uaic.ro
Publikováno v:
Computer Science Journal of Moldova. 2019, Vol. 27 Issue 3, p283-298. 16p.
Compact sequences of co-primes and their applications to the security of CRT-based threshold schemes
Publikováno v:
In Information Sciences 10 August 2013 240:161-172