Results 11 to 20 of about 172 (89)
Towards a Ring Analogue of the Leftover Hash Lemma
Journal of Mathematical Cryptology, 2020 The leftover hash lemma (LHL) is used in the analysis of various lattice-based cryptosystems, such as the Regev and Dual-Regev encryption schemes as well as their leakage-resilient counterparts. The LHL does not hold in the ring setting, when the ring is
Dachman-Soled Dana +3 more
doaj +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
Another look at normal approximations in cryptanalysis
Journal of Mathematical Cryptology, 2016 Statistical analysis of attacks on symmetric ciphers often requires assuming the normal behaviour of a test statistic. Typically such an assumption is made in an asymptotic sense.
Samajder Subhabrata, Sarkar Palash
doaj +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
(In)Security of Ring-LWE Under Partial Key Exposure
Journal of Mathematical Cryptology, 2020 We initiate the study of partial key exposure in Ring-LWE (RLWE)-based cryptosystems. Specifically, we (1) Introduce the search and decision Leaky R-LWE assumptions (Leaky R-SLWE, Leaky R-DLWE), to formalize the hardness of search/decision RLWE under ...
Dachman-Soled Dana +3 more
doaj +1 more source
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
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
Security analysis of Modified Rivest Scheme
Journal of Mathematical Cryptology, 2014 The Modified Rivest Scheme (MRS) is an additive homomorphic scheme recently used in many applications which demands third party processing of encrypted data. The present study carries out a comprehensive security analysis of MRS.
Haridas Deepthi +2 more
doaj +1 more source