Results 121 to 130 of about 59,589 (271)
A method for obtaining digital signatures and public-key cryptosystems [PDF]
, 1978 Ronald L. Rivest +2 more
openalex +1 more source
A Novel Audio Cryptosystem Using Chaotic Maps and DNA Encoding
J. Comput. Networks Commun., 2017 Chaotic maps have good potential in security applications due to their inherent characteristics relevant to cryptography. This paper introduces a new audio cryptosystem based on chaotic maps, hybrid chaotic shift transform (HCST), and deoxyribonucleic ...
S. Sheela, K. Suresh, D. Tandur
semanticscholar +1 more source
Advances in Homomorphic Cryptosystems
, 2009 JUCS - Journal of Universal Computer Science Volume Nr.
openaire +2 more sources
A method for obtaining digital signatures and public-key cryptosystems [PDF]
, 1983 Ronald L. Rivest +2 more
openalex +1 more source
Cryptanalysis of Liaw's broadcasting Cryptosystem
Computers & Mathematics with Applications, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yuh-Min Tseng, Jinn-Ke Jan
openaire +3 more sources
Modified Montgomery For Rsa Cryptosystem
, 2013 {"references": ["R. Rivest et al., \"A method for obtaining digital signatures and public key cryptosystems,\" Commun. ACM, vol 21, issue 2, Feb 1978, pp. 120-126.", "P.L. Montgomery, \"Modular multiplication without trial division,\" Math Comput, vol 44, Apr. 1985, pp. 519-521.", "C.D. Walter, \"Systolic modular multiplication,\" IEEE Trans.
Rupali Verma, Maitreyee Dutta, Renu Vig
openaire +4 more sources
Considerations for rank-based cryptosystems
2016 IEEE International Symposium on Information Theory (ISIT), 2016 Cryptosystems based on rank metric codes have been considered as an alternative to McEliece cryptosystems due to the relative difficulty of solving the rank syndrome decoding problem. Generic attacks have recently seen several improvements, notably in the work of Gaborit et al., who give an improved algorithm using linearized polynomials which yields a
Horlemann-Trautmann Anna-Lena +2 more
openaire +4 more sources
, 2004 The remarkably long-standing problem of cryptography is to generate completely secure key. It is widely believed that the task cannot be achieved within classical cryptography. However, there is no proof in support of this belief. We present an incredibly simple classical cryptosystem which can generate completely secure key.
openaire +2 more sources
A privacy-preserving cryptosystem for IoT E-healthcare
Information Sciences, 2020 Rafik Hamza +4 more
semanticscholar +1 more source
Cryptanalysis of the Ajtai-Dwork cryptosystem [PDF]
, 1998 P.H. Nguyen, Jacques Stern
openalex +1 more source