Nikolay A. Moldovyan

According to our database1, Nikolay A. Moldovyan authored at least 65 papers between 1994 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Vector finite fields of characteristic two as algebraic support of multivariate cryptography.
Comput. Sci. J. Moldova, 2024

2022
A novel version of the hidden logarithm problem for post-quantum signature algorithms.
Theor. Comput. Sci., 2022

Constructing New Representative Collective Signature Using the GOST R34.10-2012.
J. Commun., 2022

Split logarithm problem and a candidate for a post-quantum signature scheme.
Comput. Sci. J. Moldova, 2022

2021
Post-quantum signature schemes for efficient hardware implementation.
Microprocess. Microsystems, 2021

2020
A New Method for Designing Post-Quantum Signature Schemes.
J. Commun., 2020

Digital signature scheme set in a hidden cyclic group.
Comput. Sci. J. Moldova, 2020

Digital signature scheme with doubled verification equation.
Comput. Sci. J. Moldova, 2020

Switchable Controlled Operations with Bent Functions.
Proceedings of the 9th Mediterranean Conference on Embedded Computing, 2020

Post-quantum Digital-Signature Algorithms on Finite 6-Dimensional Non-commutative Algebras.
Proceedings of the Future Data and Security Engineering - 7th International Conference, 2020

Hybrid deniable and short-key encryption protocols based on the authentication procedure.
Proceedings of the International Conference on Advanced Computing and Applications, 2020

2019
Pseudo-probabilistic block ciphers and their randomization.
J. Ambient Intell. Humaniz. Comput., 2019

Post-quantum commutative encryption algorithm.
Comput. Sci. J. Moldova, 2019

2018
Post-quantum signature algorithms based on the hidden discrete logarithm problem.
Comput. Sci. J. Moldova, 2018

Post-quantum Cryptoschemes: New Finite Non-commutative Algebras for Defining Hidden Logarithm Problem.
Proceedings of the Context-Aware Systems and Applications, and Nature of Computation and Communication, 2018

Stream Pseudo-probabilistic Ciphers.
Proceedings of the Context-Aware Systems and Applications, and Nature of Computation and Communication, 2018

2017
New blind signature protocols based on a new hard problem.
Int. Arab J. Inf. Technol., 2017

Non-commutative finite associative algebras of 2-dimension vectors.
Comput. Sci. J. Moldova, 2017

Method for Pseudo-probabilistic Block Encryption.
Proceedings of the Industrial Networks and Intelligent Systems, 2017

Symmetric encryption for error correction.
Proceedings of the 20th Conference of Open Innovations Association, 2017

Deniable encryption protocols based on probabilistic public-key encryption.
Proceedings of the 20th Conference of Open Innovations Association, 2017

2016
On Using Mersenne Primes in Designing Cryptoschemes.
Int. J. Netw. Secur., 2016

Some applications of quasigroups in cryptology.
Comput. Sci. J. Moldova, 2016

Stream Deniable-Encryption Algorithms.
Comput. Sci. J. Moldova, 2016

Bi-deniable public-encryption protocols based on standard PKI.
Proceedings of the 18th Conference of Open Innovations Association and Seminar on Information Security and Protection of Information Technology, 2016

2015
Provably sender-deniable encryption scheme.
Comput. Sci. J. Moldova, 2015

2013
Cryptoschemes Based on Difficulty of Simultaneous Solving Two Different Difficult Problems.
Comput. Sci. J. Moldova, 2013

Digital Signature Schemes from Two Hard Problems.
Proceedings of the Multimedia and Ubiquitous Engineering, 2013

2012
Blind 384-bit Digital Signature Scheme.
Proceedings of the Computer Network Security, 2012

2011
Blind Signature Protocols from Digital Signature Standards.
Int. J. Netw. Secur., 2011

Blind Collective Signature Protocol.
Comput. Sci. J. Moldova, 2011

2010
Blind Collective Signature Protocol Based on Discrete Logarithm Problem.
Int. J. Netw. Secur., 2010

A New Hard Problem over Non-commutative Finite Groups for Cryptographic Protocols.
Proceedings of the Computer Network Security, 2010

2009
Acceleration of the Elliptic Cryptography with Vector Finite Fields.
Int. J. Netw. Secur., 2009

Short Signatures from Difficulty of Factorization Problem.
Int. J. Netw. Secur., 2009

Multisignature Protocols and Problem of Simultaneous Signing a Package of Contracts.
Proceedings of the Information Fusion and Geographic Information Systems, 2009

Vector Finite Groups as Primitives for Fast Digital Signature Algorithms.
Proceedings of the Information Fusion and Geographic Information Systems, 2009

2008
On Cipher Design Based on Switchable Controlled Operations.
Int. J. Netw. Secur., 2008

Digital Signature Scheme Based on a New Hard Problem.
Comput. Sci. J. Moldova, 2008

2007
On Software Implementation of Fast DDP-based Ciphers.
Int. J. Netw. Secur., 2007

Architecture Types of the Bit Permutation Instruction for General Purpose Processors.
Proceedings of the Third International Workshop on Information Fusion and Geographical Information Systems, 2007

New Public Key Cryptosystems Based on Difficulty of Factorization and Discrete Logarithm Problems.
Proceedings of the Third International Workshop on Information Fusion and Geographical Information Systems, 2007

2006
Controlled elements for designing ciphers suitable to efficient VLSI implementation.
Telecommun. Syst., 2006

New Class of Cryptographic Primitives and Cipher Design for Networks Security.
Int. J. Netw. Secur., 2006

A Class of Data-Dependent Operations.
Int. J. Netw. Secur., 2006

An Approach to Shorten Digital Signature Length.
Comput. Sci. J. Moldova, 2006

2005
High Speed Networking Security: Design and Implementation of Two New DDP-Based Ciphers.
Mob. Networks Appl., 2005

Pure DDP-Based Cipher: Architecture Analysis, Hardware Implementation Cost and Performance up to 6.5 Gbps.
Int. Arab J. Inf. Technol., 2005

Variable Bit Permutations: Linear Characteristics and Pure VBP-Based Cipher.
Comput. Sci. J. Moldova, 2005

Wireless Networks World and Security Algorithms.
Proceedings of the Handbook on Theoretical and Algorithmic Aspects of Sensor, 2005

2004
Computer Network Security: Report from MMM-ACNS.
IEEE Secur. Priv., 2004

New class of the FPGA efficient cryptographic primitives.
Proceedings of the 2004 International Symposium on Circuits and Systems, 2004

2003
Fast software-oriented hash function based on data-dependent lookup operations.
Comput. Sci. J. Moldova, 2003

Fast DDP-Based Ciphers: Design and Differential Analysis of Cobra-H64.
Comput. Sci. J. Moldova, 2003

Fast Ciphers for Cheap Hardware: Differential Analysis of SPECTR-H64.
Proceedings of the Computer Network Security, 2003

2002
A Cipher Based on Data-Dependent Permutations.
J. Cryptol., 2002

Fault-based analysis of flexible ciphers.
Comput. Sci. J. Moldova, 2002

2001
Controlled Operations as a Cryptographic Primitive.
Proceedings of the Information Assurance in Computer Networks: Methods, 2001

Fast Encryption Algorithm Spectr-H64.
Proceedings of the Information Assurance in Computer Networks: Methods, 2001

1998
Flexible Block Cipher with Provably Inequivalent Cryptalgorithm Modifications.
Cryptologia, 1998

Software Encryption Algorithms for Transparent Protection Technology.
Cryptologia, 1998

1997
Software encryption: new 64-bit block cryptoscheme.
Comput. Sci. J. Moldova, 1997

Provably indeterminate 128-bit cipher.
Comput. Sci. J. Moldova, 1997

1995
Fast software encryption system based on local pseudorandomness.
Comput. Sci. J. Moldova, 1995

1994
Effective software-oriented cryptosystem in complex PC security software.
Comput. Sci. J. Moldova, 1994


  Loading...