Abstract: Noise-resistant modular cryptographic system that functions in polynomial residue classes is considered in this article. An algorithm for bases expansion of the cryptographic system is suggested. An estimation of interference-stability of proposed cryptograph-ic system in relation to the traditional system is presented
Information security, reliability of data transfer are today an important component of the globaliza...
A new fast public key cryptosystem is proposed, which is based on two dissimilar number-theoretic ha...
The design of algorithms for sending confidential messages (i.e. messages that no one can read, exce...
There has been a tendency to use the theory of finite Galois fields, or GF(2n), in cryptographic cip...
Abstract. Security of cryptographic symmetric primitives is studied in this thesis. Pseudorandomness...
This thesis is concerned with GF(2m) Polynomial Residue Number Systems (PRNS) and their application ...
Cryptosystems of theoretical resistance, construction of which is based on using algebraic block cod...
Simple power analysis (SPA) attacks are widely used against several cryptosystems, principally again...
The goal of secure computation is for distrusted parties on a network to collaborate with each other...
Abstract. We present a generalization of Pedersen’s public-key threshold cryptosystem. Pedersen’s pr...
A new method using polynomial residue number systems (PRNS) is introduced in this paper to protect t...
Obecnie jakość realizacji procedur przetwarzania informacji zależy w dużym stopniu od wybranego mode...
International audienceWe propose a novel noise-resisting ciphering method resorting to a chaotic mul...
Information security, reliability of data transfer are today an important component of the globaliza...
The conventional way of cryptanalysis is based on the cryptographic algorithms weak points examine. ...
Information security, reliability of data transfer are today an important component of the globaliza...
A new fast public key cryptosystem is proposed, which is based on two dissimilar number-theoretic ha...
The design of algorithms for sending confidential messages (i.e. messages that no one can read, exce...
There has been a tendency to use the theory of finite Galois fields, or GF(2n), in cryptographic cip...
Abstract. Security of cryptographic symmetric primitives is studied in this thesis. Pseudorandomness...
This thesis is concerned with GF(2m) Polynomial Residue Number Systems (PRNS) and their application ...
Cryptosystems of theoretical resistance, construction of which is based on using algebraic block cod...
Simple power analysis (SPA) attacks are widely used against several cryptosystems, principally again...
The goal of secure computation is for distrusted parties on a network to collaborate with each other...
Abstract. We present a generalization of Pedersen’s public-key threshold cryptosystem. Pedersen’s pr...
A new method using polynomial residue number systems (PRNS) is introduced in this paper to protect t...
Obecnie jakość realizacji procedur przetwarzania informacji zależy w dużym stopniu od wybranego mode...
International audienceWe propose a novel noise-resisting ciphering method resorting to a chaotic mul...
Information security, reliability of data transfer are today an important component of the globaliza...
The conventional way of cryptanalysis is based on the cryptographic algorithms weak points examine. ...
Information security, reliability of data transfer are today an important component of the globaliza...
A new fast public key cryptosystem is proposed, which is based on two dissimilar number-theoretic ha...
The design of algorithms for sending confidential messages (i.e. messages that no one can read, exce...