Results 41 to 50 of about 105 (87)

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, Venkataraman Sarma, Varadan Geeta   +2 more
doaj   +1 more source

Delegating a Product of Group Exponentiations with Application to Signature Schemes (Submission to Special NutMiC 2019 Issue of JMC)

Journal of Mathematical Cryptology, 2020
Many public-key cryptosystems and, more generally, cryptographic protocols, use group exponentiations as important primitive operations. To expand the applicability of these solutions to computationally weaker devices, it has been advocated that a ...
Crescenzo Giovanni Di, Khodjaeva Matluba, Kahrobaei Delaram, Shpilrain Vladimir   +3 more
doaj   +1 more source

Some Lattice Attacks on DSA and ECDSA

, 2010
In this paper, using the LLL reduction method and computing the integral points of two classes of conics, we develop attacks on DSA and ECDSA in case where the secret and the ephemeral key and their modular inverse are quite small or quite large.
Dimitrios Poulakis
core  

Group structure of elliptic curves over ℤ/Nℤ

Journal of Mathematical Cryptology
We characterize the possible groups E(Z∕NZ)E\left({\mathbb{Z}}/N{\mathbb{Z}}) arising from elliptic curves over Z∕NZ{\mathbb{Z}}/N{\mathbb{Z}} in terms of the groups E(Fp)E\left({{\mathbb{F}}}_{p}), with pp varying among the prime divisors of NN.
Sala Massimiliano, Taufer Daniele
doaj   +1 more source

Distribution of powers modulo p and security of RSA

Journal of Mathematical Cryptology
Let p be a prime and a be any fixed positive integer such that gcd(a, φ(p)) = 1. For 0 < x 
Meng Xianmeng, Dang Yongjie
doaj   +1 more source

New number-theoretic cryptographic primitives

Journal of Mathematical Cryptology, 2020
This paper introduces new prq-based one-way functions and companion signature schemes. The new signature schemes are interesting because they do not belong to the two common design blueprints, which are the inversion of a trapdoor permutation and the ...
Brier Éric, Ferradi Houda, Joye Marc, Naccache David   +3 more
doaj   +1 more source

Security analysis of ZKPoK based on MQ problem in the multi-instance setting

Journal of Mathematical Cryptology
Bidoux and Gaborit introduced a new general technique to improve zero-knowledge (ZK) proof-of-knowledge (PoK) schemes for a large set of well-known post-quantum hard computational problems such as the syndrome decoding, the permuted kernel, the rank ...
Kahrobaei Delaram, Perret Ludovic, Vigorito Martina   +2 more
doaj   +1 more source

New quantum codes from homothetic-BCH codes

We introduce homothetic-BCH codes. These are a family of q2-ary classical codes C of length λn1, where λ and n1 are suitable positive integers such that the punctured code B of C in the last λn1 − n1 coordinates is a narrow-sense BCH code of length n1 ...
Martín Cruz, Elena, Galindo , Carlos, Hernando, Fernando   +2 more
core   +1 more source

Computing Discrete Logarithms in Real Quadratic Congruence Function Fields of Large Genus

, 1997
The discrete logarithm problem in various finite abelian groups is the basis for some well known public key cryptosystems. Recently, real quadratic congruence function fields were used to construct a public key distribution system.
Fachbereich Informatik, Andreas Stein, Christoph Thiel, Volker Müller, Technische Hochschule Darmstadt   +4 more
core  

Detecting Encrypted and Unencrypted Network Data Using Entropy Analysis and Confidence Intervals. [PDF]

Entropy (Basel), 2023
Ticleanu OA, Popa T, Hunyadi DI, Constantinescu N.   +3 more
europepmc   +1 more source