Weak Property of Malleability in NTRUSign

Min, SungJun; Yamamoto, Go; Kim, Kwangjo

doi:10.1007/978-3-540-27800-9_33

Cited by 7 publications

(2 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To prevent this attack, Hoffstein et al proposed NTRUSign as a new candidate [Hoffstein et al 2003]. Unfortunately, researchers have discovered the weaknesses of NTRUSign, including vulnerabilities to key recovery attacks [Nguyen and Regev 2009] and malleability property [Min et al 2004]. As a result, the security of NTRUSign is still questionable.…”

Section: Comparisons With Other Public-key Cryptosystemsmentioning

confidence: 99%

Practical RSA signature scheme based on periodical rekeying for wireless sensor networks

Chang

Lin

Sun

et al. 2012

ACM Trans. Sen. Netw.

View full text Add to dashboard Cite

Broadcast is an efficient communication channel on wireless sensor networks. Through authentic broadcast, deployed sensors can perform legitimate actions issued by a base station. According to previous literature, a complete solution for authentic broadcast is digital signature based on asymmetric cryptography. However, asymmetric cryptography utilizes expensive operations, which result in computational bottlenecks. Among these cryptosystems, Elliptic Curve Cryptography (ECC) seems to be the most efficient and the most popular choice. Unfortunately, signature verification in ECC is not efficient enough. In this article, we propose an authentic broadcast scheme based on RSA. Unlike conventional approaches, the proposed scheme adopts short moduli to enhance performance. Meanwhile, the weakness of short moduli can be fixed with rekeying strategies. To minimize the rekeying overhead, a Multi-Modulus RSA generation algorithm, which can reduce communication overhead by 50%, is proposed. We implemented the proposed scheme on MICAz. On 512-bit moduli, each verification spends at most 0.077 seconds, which is highly competitive with other public-key cryptosystems. -E. 2012. Practical RSA signature scheme based on periodical rekeying for wireless sensor networks.

show abstract

Section: Comparisons With Other Public-key Cryptosystemsmentioning

confidence: 99%

Practical RSA signature scheme based on periodical rekeying for wireless sensor networks

Chang

Lin

Sun

et al. 2012

ACM Trans. Sen. Netw.

View full text Add to dashboard Cite

show abstract

“…The hard problems underlying the NTRU cryptosystem can also be used to design a digital signature scheme. There is a long 'design-break-repair' history behind this scheme, now known as NTRUSign (see, e.g., [26,29,35,74,53,54] and the survey [31]). Recent notable developments in this area include a variant of NTRUSign with a security proof based on worst-case hardness of lattice problems [72], and an alternative particulary efficient class of signature schemes [44,45,21], the most recent of which [21] is also based on NTRU-like hardness assumptions, that can be considered a lattice analogue of Schnorr's discrete-log based signature scheme [69].…”

Section: Introductionmentioning

confidence: 99%

NTRU cryptosystem: Recent developments and emerging mathematical problems in finite polynomial rings

Steinfeld¹

2014

Algebraic Curves and Finite Fields

View full text Add to dashboard Cite

The NTRU public-key cryptosystem, proposed in 1996 by Hoffstein, Pipher and Silverman, is a fast and practical alternative to classical schemes based on factorization or discrete logarithms. In contrast to the latter schemes, it offers quasi-optimal asymptotic efficiency and conjectured security against quantum computing attacks. The scheme is defined over finite polynomial rings, and its security analysis involves the study of natural statistical and computational problems defined over these rings. We survey several recent developments in both the security analysis and in the applications of NTRU and its variants, within the broader field of lattice-based cryptography. These developments include a provable relation between the security of NTRU and the computational hardness of worst-case instances of certain lattice problems, and the construction of fully homomorphic and multilinear cryptographic algorithms. In the process, we identify the underlying statistical and computational problems in finite rings.

show abstract

Theoretical and Empirical Analysis of FALCON and SOLMAE Using Their Python Implementation

Kim

2024

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Weak Property of Malleability in NTRUSign

Cited by 7 publications

References 10 publications

Practical RSA signature scheme based on periodical rekeying for wireless sensor networks

Practical RSA signature scheme based on periodical rekeying for wireless sensor networks

NTRU cryptosystem: Recent developments and emerging mathematical problems in finite polynomial rings

Theoretical and Empirical Analysis of FALCON and SOLMAE Using Their Python Implementation

Contact Info

Product

Resources

About