Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Combinatorial optimization in cryptography
K Knežević - 2017 40th International Convention on Information …, 2017 - ieeexplore.ieee.org
The known attacks on different cryptosystems lead to a number of criteria that the
implemented cryptographic algorithms (ciphers) must satisfy. The design of cryptographic …
implemented cryptographic algorithms (ciphers) must satisfy. The design of cryptographic …
Design and Analysis of RSA and Paillier Homomorphic Cryptosystems Using PSO-Based Evolutionary Computation
Non-lattice based homomorphic encryption schemes usually involve huge modular
exponentiation operations. Thus, improving the efficiency of modular exponentiation for …
exponentiation operations. Thus, improving the efficiency of modular exponentiation for …
Some new methods to generate short addition chains
Y Ding, H Guo, Y Guan, H Song, X Zhang - arxiv preprint arxiv …, 2022 - arxiv.org
Modular exponentiation and scalar multiplication are important operations of most public key
cryptosystems, and their fast calculation is essential to improve the system efficiency. The …
cryptosystems, and their fast calculation is essential to improve the system efficiency. The …
Evolutionary computation and machine learning in security
Stjepan Picek received his PhD in 2015 as a double doctorate under the supervision of Lejla
Batina, Elena Marchiori (Radboud University Nijmegen, The Netherlands), and Domagoj …
Batina, Elena Marchiori (Radboud University Nijmegen, The Netherlands), and Domagoj …
Evolutionary computation and machine learning in cryptology
6 Attacks on Ciphers-ML 7 Quantum Protocols-EC 8 Physically Unclonable Functions-EC,
ML 9 Hardware Trojans-EC, ML 10 Side-channel Analysis-ML, EC 11 Fault Injection-EC, ML …
ML 9 Hardware Trojans-EC, ML 10 Side-channel Analysis-ML, EC 11 Fault Injection-EC, ML …
Finding short and implementation-friendly addition chains with evolutionary algorithms
Finding the shortest addition chain for a given exponent is a significant problem in
cryptography. In this work, we present a genetic algorithm with a novel encoding of solutions …
cryptography. In this work, we present a genetic algorithm with a novel encoding of solutions …
Evolutionary algorithms for finding short addition chains: Going the distance
The problem of finding the shortest addition chain for a given exponent is of great relevance
in cryptography, but is also very difficult to solve since it is an NP-hard problem. In this paper …
in cryptography, but is also very difficult to solve since it is an NP-hard problem. In this paper …
Study of direct local search operators influence in memetic differential evolution for constrained numerical optimization problems
S Domínguez-Isidro… - 2017 International …, 2017 - ieeexplore.ieee.org
This paper analyzes the influence of the depth of direct local search methods in constrained
numerical optimization problems in order to use as a local search operator (LSO) within a …
numerical optimization problems in order to use as a local search operator (LSO) within a …
Evolutionary computation and cryptology
S Picek - Proceedings of the 2016 on genetic and evolutionary …, 2016 - dl.acm.org
Evolutionary Computation (EC) has been used with great success on various real-world
problems. One domain abundant with numerous difficult problems is cryptology. Cryptology …
problems. One domain abundant with numerous difficult problems is cryptology. Cryptology …
A genetic algorithm with a mutation mechanism based on a Gaussian and uniform distribution to minimize addition chains for small exponents
E Vázquez-Fernández, C Cadena… - 2016 IEEE Congress …, 2016 - ieeexplore.ieee.org
The purpose of this research is to minimize the length of an addition chain. Addition chains
are employed to reduce the number of multiplications involved in modular exponentiation in …
are employed to reduce the number of multiplications involved in modular exponentiation in …