Results 31 to 40 of about 172 (89)
Journal of Mathematical Cryptology, 2018 Composite order pairing setting has been used to achieve cryptographic functionalities beyond what is attainable in prime order groups. However, such pairings are known to be significantly slower than their prime order counterparts.
Chatterjee Sanjit +2 more
doaj +1 more source
A secure anonymous proxy signcryption scheme
Journal of Mathematical Cryptology, 2017 We introduce a new cryptographic primitive identity-based anonymous proxy signcryption which provides anonymity to the proxy sender while also providing a mechanism to the original sender to expose the identity of the proxy sender in case of misuse.
Saraswat Vishal +2 more
doaj +1 more source
Counting faces of randomly-projected polytopes when the projection radically lowers dimension [PDF]
, 2006 This paper develops asymptotic methods to count faces of random high-dimensional polytopes. Beyond its intrinsic interest, our conclusions have surprising implications - in statistics, probability, information theory, and signal processing - with ...
Donoho, David L., Tanner, Jared
core
Image Encryption using Gingerbreadman Map And RC4A Stream Cipher [PDF]
, 2020 Day to day increasing flow of sensitive or confidential information, such as images, audio, video, etc., over unsecured medium (like Internet) has motivated more concentration for concrete crypto algorithms.
Gaffar, Abdul +2 more
core +1 more source
Rigorous upper bounds on data complexities of block cipher cryptanalysis
Journal of Mathematical Cryptology, 2017 Statistical analysis of symmetric key attacks aims to obtain an expression for the data complexity which is the number of plaintext-ciphertext pairs needed to achieve the parameters of the attack. Existing statistical analyses invariably use some kind of
Samajder Subhabrata, Sarkar Palash
doaj +1 more source
Optimizations in the computation of pairings and cryptographic applications [PDF]
, 2013 En la criptografía de clave pública actual el uso de curvas elípticas es cada vez más habitual debido a que ofrecen una seguridad similar a los ya utilizados cuerpos finitos, pero con unas claves más cortas.
Sánchez Charles, David
core +1 more source
Spectral analysis of the Lorenz attractor [PDF]
For a long time, chaos was considered uncontrollable and unusable. However, over the past thirty years, researchers have formulated equations for certain chaotic phenomena, revealing a deterministic aspect to what initially seems random. The evolution of
Aggoune, W. +4 more
core +2 more sources
On integer sequences in cryptography
Journal of Mathematical CryptologyInteger sequences play a pivotal role in cryptography, acting as foundational elements for numerous cryptographic algorithms. This comprehensive investigation examines integer sequences that have significantly impacted the sector in domains such as key ...
Raso Mario, Venturi Daniele
doaj +1 more source
Remarks to short RSA public exponents [PDF]
, 1998 In this paper we discuss pertinent questions closely related to well known RSA cryptosystem [5]. From practical point of view it is reasonable to use as a public exponent an integer s = 2k+1, i.e., so called short exponent, with the lowest possible ...
Grošek, Otokar +2 more
core +1 more source
Multilayer Security of RGB Image in Discrete Hartley Domain [PDF]
, 2020 In this article, we present RGB image encryption and decryption using random matrix affine cipher (RMAC) associated with discrete Hartley transform (DHT) and random matrix shift cipher (RMSC).
Lone, Parveiz N. +3 more
core +1 more source