Results 11 to 20 of about 124 (57)
, 2021 ITRU cryptosystem is a public key cryptosystem and one of the known variants of NTRU cryptosystem. Instead of working in a truncated polynomial ring, ITRU cryptosystem is based on the ring of integers.
Hashim, Hayder R. +2 more
core +3 more sources
MALWARE ANALYSIS AND STATIC CALL GRAPH GENERATION WITH RADARE2 [PDF]
, 2023 A powerful feature used in automated malware analysis is the static call graph of the executable file. Elimination of sandbox environment, fast scan, function call patterns beyond instruction level information – all of these motivate the prevalence of ...
MESTER, Attila
core +2 more sources
Group key management based on semigroup actions [PDF]
, 2016 In this work we provide a suite of protocols for group key management based on general semigroup actions. Construction of the key is made in a distributed and collaborative way.
Lopez-Ramos, Juan Antonio +3 more
core +1 more source
Hypothesis testing and advanced distinguishers in differential cryptanalysis of block ciphers [PDF]
, 2015 Distinguishing distributions is a major part during cryptanalysis of symmetric block ciphers. The goal of the cryptanalyst is to distinguish two distributions; one that characterizes the number of certain events which occur totally at random and another ...
Courtois, N, Mourouzis, T
core +1 more source
Formalization of the Advanced Encryption Standard. Part I [PDF]
, 2013 In this article, we formalize the Advanced Encryption Standard (AES). AES, which is the most widely used symmetric cryptosystem in the world, is a block cipher that was selected by the National Institute of Standards and Technology (NIST) as an official ...
Arai, Kenichi, Okazaki, Hiroyuki
core +1 more source
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data [PDF]
, 2004 We provide formal definitions and efficient secure techniques for - turning noisy information into keys usable for any cryptographic application, and, in particular, - reliably and securely authenticating biometric data.
Adam Smith +5 more
core +3 more sources
Efficient Fully Homomorphic Encryption from (Standard) LWE [PDF]
, 2018 A fully homomorphic encryption (FHE) scheme allows anyone to transform an encryption of a message, m, into an encryption of any (efficient) function of that message, f(m), without knowing the secret key.
Brakerski, Zvika, Vaikuntanathan, Vinod
core +1 more source
Journal of Mathematical Cryptology, 2018 In this paper, we construct some cartesian authentication codes from geometries over finite commutative rings. We only assume the uniform probability distribution over the set of encoding rules in order to be able to compute the probabilities of ...
Jirakitpuwapat Wachirapong +4 more
doaj +1 more source
A Novel Color Image Encryption Scheme Based on Arnold’s Cat Map and 16-Byte S-box [PDF]
, 2021 The presented work sets out to subsidize to the general body of knowledge in the field of cryptography application by evolving color image encryption and decryption scheme based on the amalgamation of pixel shuffling and efficient substitution.
Qureshi, Ayesha +2 more
core +1 more source
Scientometric dimensions of cryptographic research [PDF]
, 2015 Information security has been a crucial issue in modern information management; thus cryptographic techniques have become inevitable to safeguard the digital information assets as well as to defend the invasion of privacy in modern information society ...
Pal, Jiban K.
core +1 more source