Sealing the leak on classical NTRU signatures

Initial attempts to obtain lattice based signatures were closely related to reducing a vector modulo the fundamental parallelepiped of a secret basis (like GGH [9], or NTRUSign [12]). This approach leaked some information on the secret, namely the shape of the parallelepiped, which has been exploited on practical attacks [24]. NTRUSign was an extremely efficient scheme, and thus there has been a noticeable interest on developing countermeasures to the attacks, but with little success [6]. In [8] Gentry, Peikert and Vaikuntanathan proposed a randomized version of Babai’s nearest plane algorithm such that the distribution of a reduced vector modulo a secret parallelepiped only depended on the size of the base used. Using this algorithm and generating large, close to uniform, public keys they managed to get provably secure GGH-like lattice-based signatures. Recently, Stehlé and Steinfeld obtained a provably secure scheme very close to NTRUSign [26] (from a theoretical point of view). In this paper we present an alternative approach to seal the leak of NTRUSign. Instead of modifying the lattices and algorithms used, we do a classic leaky NTRUSign signature and hide it with gaussian noise using techniques present in Lyubashevky’s signatures. Our main contributions are thus a set of strong NTRUSign parameters, obtained by taking into account latest known attacks against the scheme, a statistical way to hide the leaky NTRU signature so that this particular instantiation of CVP-based signature scheme becomes zero-knowledge and secure against forgeries, based on the worst-case hardness of the O~(N1.5)-Shortest Independent Vector Problem over NTRU lattices. Finally, we give a set of concrete parameters to gauge the efficiency of the obtained signature scheme.

Analytical study of implementation issues of NTRU

Nth-Dimensional Truncated Polynomial Ring (NTRU) is a lattice-based public-key cryptosystem that offers encryption and digital signature solutions. It was designed by Silverman, Hoffstein and Pipher. The NTRU cryptosystem was patented by NTRU Cryptosystems Inc. (which was later acquired by Security Innovations) and available as IEEE 1363.1 and X9.98 standards. NTRU is resistant to attacks based on Quantum computing, to which the standard RSA and ECC public-key cryptosystems are vulnerable to. In addition, NTRU has higher performance advantages over these cryptosystems. Considering this importance of NTRU, it is highly recommended to adopt NTRU as part of a cipher suite along with widely used cryptosystems for internet security protocols and applications. In this paper, we present our analytical study on the implementation of NTRU encryption scheme which serves as a guideline for security practitioners who are novice to lattice-based cryptography or even cryptography. In particular, we show some non-trivial issues that should be considered towards a secure and efficient NTRU implementation.

Un sistema crittografico: NTRU

La tesi, divisa in tre parti presenta nella prima parte il sistema crittografico NTRU e il suo funzionamento, nella seconda introduce i reticoli e l'algoritmo di riduzione reticolare LLL, nella terza alcuni possibili attacchi a NTRU.

Challenging the assumptions of positivism : an analysis of the concept of society in Sampi on behalf of the Bardi and Jawi people v Western Australia [2010] and Bodney v Bennell [2008]

The requirement to prove a society united by a body of law and customs to establish native title rights has been identified as a major hurdle to achieving native title recognition. The recent appeal decision of the Federal Court in Sampi on behalf of the Bardi and Jawi People v Western Australia [2010] opens the potential for a new judicial interpretation of society based on the internal view of native title claimants. The decision draws on defining features of legal positivism to inform the court’s findings as to the existence of a single Bardi Jawi society of ‘one people’ living under ‘one law’. The case of Bodney v Bennell [2008] is analysed through comparitive study of how the application of the received positivist framework may limit native title recognition. This paper argues that the framing of Indigenous law by reference to Western legal norms is problematic due to the assumptions of legal positivism and that an internal view based on Indigenous worldviews, which see law as intrinsically linked to the spiritual and ancestral connection to country, is more appropriate to determine proof in native title claims.

‘We don’t leave our identities at the city limits’ : Aboriginal and Torres Strait Islander people living in urban localities

Aboriginal and Torres Strait Islander people who live in cities and towns are often thought of as ‘less Indigenous’ than those who live ‘in the bush’, as though they were ‘fake’ Aboriginal people — while ‘real’ Aboriginal people live ‘on communities’ and ‘real’ Torres Strait Islander people live ‘on islands’. Yet more than 70 percent of Australia’s Indigenous peoples live in urban locations (ABS 2007), and urban living is just as much part of a reality for Aboriginal and Torres Strait Islander people as living in remote discrete communities. This paper examines the contradictions and struggles that Aboriginal and Torres Strait Islander people experience when living in urban environments. It looks at the symbols of place and space on display in the Australian cities of Melbourne and Brisbane to demonstrate how prevailing social, political and economic values are displayed. Symbols of place and space are never neutral, and this paper argues that they can either marginalise and oppress urban Aboriginal and Torres Strait Islander people, or demonstrate that they are included and engaged.

NTRUCCA : how to strengthen NTRUEncrypt to chosen-ciphertext security in the standard model

NTRUEncrypt is a fast and practical lattice-based public-key encryption scheme, which has been standardized by IEEE, but until recently, its security analysis relied only on heuristic arguments. Recently, Stehlé and Steinfeld showed that a slight variant (that we call pNE) could be proven to be secure under chosen-plaintext attack (IND-CPA), assuming the hardness of worst-case problems in ideal lattices. We present a variant of pNE called NTRUCCA, that is IND-CCA2 secure in the standard model assuming the hardness of worst-case problems in ideal lattices, and only incurs a constant factor overhead in ciphertext and key length over the pNE scheme. To our knowledge, our result gives the first IND-CCA2 secure variant of NTRUEncrypt in the standard model, based on standard cryptographic assumptions. As an intermediate step, we present a construction for an All-But-One (ABO) lossy trapdoor function from pNE, which may be of independent interest. Our scheme uses the lossy trapdoor function framework of Peikert and Waters, which we generalize to the case of (k − 1)-of-k-correlated input distributions.

Algebraic Cryptanalysis of CTRU Cryptosystem

CTRU, a public key cryptosystem was proposed by Gaborit, Ohler and Sole. It is analogue of NTRU, the ring of integers replaced by the ring of polynomials $\mathbb{F}_2[T]$ . It attracted attention as the attacks based on either LLL algorithm or the Chinese Remainder Theorem are avoided on it, which is most common on NTRU. In this paper we presents a polynomial-time algorithm that breaks CTRU for all recommended parameter choices that were derived to make CTRU secure against popov normal form attack. The paper shows if we ascertain the constraints for perfect decryption then either plaintext or private key can be achieved by polynomial time linear algebra attack.

Um estudo sobre criptografia

Pós-graduação em Matemática Universitária - IGCE

Crittografia e reticoli geometrici

Introduzione alla crittografia e presentazione delle primitive matematiche attualmente utilizzate. Presentazione dei reticoli geometrici, riduzione reticolare e algoritmo LLL. Descrizione dei critto-sistemi Ajtai-Dwork e NTRU. In appendice introduzione a complessità computazionale, problemi P e NP.