Avoiding full extension field arithmetic in pairing computations

The most costly operations encountered in pairing computations are those that take place in the full extension field Fpk . At high levels of security, the complexity of operations in Fpk dominates the complexity of the operations that occur in the lower degree subfields. Consequently, full extension field operations have the greatest effect on the runtime of Miller’s algorithm. Many recent optimizations in the literature have focussed on improving the overall operation count by presenting new explicit formulas that reduce the number of subfield operations encountered throughout an iteration of Miller’s algorithm. Unfortunately, almost all of these improvements tend to suffer for larger embedding degrees where the expensive extension field operations far outweigh the operations in the smaller subfields. In this paper, we propose a new way of carrying out Miller’s algorithm that involves new explicit formulas which reduce the number of full extension field operations that occur in an iteration of the Miller loop, resulting in significant speed ups in most practical situations of between 5 and 30 percent.

Faster pairing computations on curves with high-degree twists

Research on efficient pairing implementation has focussed on reducing the loop length and on using high-degree twists. Existence of twists of degree larger than 2 is a very restrictive criterion but luckily constructions for pairing-friendly elliptic curves with such twists exist. In fact, Freeman, Scott and Teske showed in their overview paper that often the best known methods of constructing pairing-friendly elliptic curves over fields of large prime characteristic produce curves that admit twists of degree 3, 4 or 6. A few papers have presented explicit formulas for the doubling and the addition step in Miller’s algorithm, but the optimizations were all done for the Tate pairing with degree-2 twists, so the main usage of the high- degree twists remained incompatible with more efficient formulas. In this paper we present efficient formulas for curves with twists of degree 2, 3, 4 or 6. These formulas are significantly faster than their predecessors. We show how these faster formulas can be applied to Tate and ate pairing variants, thereby speeding up all practical suggestions for efficient pairing implementations over fields of large characteristic.

Delaying mismatched field multiplications in pairing computations

Miller’s algorithm for computing pairings involves perform- ing multiplications between elements that belong to different finite fields. Namely, elements in the full extension field Fpk are multiplied by elements contained in proper subfields F pk/d , and by elements in the base field Fp . We show that significant speedups in pairing computations can be achieved by delaying these “mismatched” multiplications for an optimal number of iterations. Importantly, we show that our technique can be easily integrated into traditional pairing algorithms; implementers can exploit the computational savings herein by applying only minor changes to existing pairing code.

Fixed argument pairings

A common scenario in many pairing-based cryptographic protocols is that one argument in the pairing is fixed as a long term secret key or a constant parameter in the system. In these situations, the runtime of Miller's algorithm can be significantly reduced by storing precomputed values that depend on the fixed argument, prior to the input or existence of the second argument. In light of recent developments in pairing computation, we show that the computation of the Miller loop can be sped up by up to 37 if precomputation is employed, with our method being up to 19.5 faster than the previous precomputation techniques.

Fast formulas for computing cryptographic pairings

The most powerful known primitive in public-key cryptography is undoubtedly elliptic curve pairings. Upon their introduction just over ten years ago the computation of pairings was far too slow for them to be considered a practical option. This resulted in a vast amount of research from many mathematicians and computer scientists around the globe aiming to improve this computation speed. From the use of modern results in algebraic and arithmetic geometry to the application of foundational number theory that dates back to the days of Gauss and Euler, cryptographic pairings have since experienced a great deal of improvement. As a result, what was an extremely expensive computation that took several minutes is now a high-speed operation that takes less than a millisecond. This thesis presents a range of optimisations to the state-of-the-art in cryptographic pairing computation. Both through extending prior techniques, and introducing several novel ideas of our own, our work has contributed to recordbreaking pairing implementations.

Tips for generating a media release and media coverage : how the media ate up my research on Aussie horror movies

The focus of this paper is preparing research for dissemination by mainstream print, broadcast, and online media. While the rise of the blogosphere and social media is proving an effective way of reaching niche audiences, my own research reached such an audience through traditional media. The first major study of Australian horror cinema, my PhD thesis A Dark New World: Anatomy of Australian Horror Films, generated strong interest from horror movie fans, film scholars, and filmmakers. I worked closely with the Queensland University of Technology’s (QUT) public relations unit to write two separate media releases circulated on October 13, 2008 and October 14, 2009. This chapter reflects upon the process of working with the media and provides tips for reaching audiences, particularly in terms of strategically planning outcomes. It delves into the background of my study which would later influence my approach to the media, the process of drafting media releases, and key outcomes and benefits from popularising research. A key lesson from this experience is that redeveloping research for the media requires a sharp writing style, letting go of academic justification, catchy quotes, and an ability to distil complex details into easy-to-understand concepts. Although my study received strong media coverage, and I have since become a media commentator, my experiences also revealed a number of pitfalls that are likely to arise for other researchers keen on targeting media coverage.

Attractive subfamilies of BLS curves for implementing high-security pairings

Barreto-Lynn-Scott (BLS) curves are a stand-out candidate for implementing high-security pairings. This paper shows that particular choices of the pairing-friendly search parameter give rise to four subfami- lies of BLS curves, all of which offer highly efficient and implementation- friendly pairing instantiations. Curves from these particular subfamilies are defined over prime fields that support very efficient towering options for the full extension field. The coefficients for a specific curve and its correct twist are automat-ically determined without any computational effort. The choice of an extremely sparse search parameter is immediately reflected by a highly efficient optimal ate Miller loop and final exponentiation. As a resource for implementors, we give a list with examples of implementation-friendly BLS curves through several high-security levels.

Subcarrier pairing and relay assignment with improved user fairness in a multi-user cooperative OFDM system

We consider a joint relay selection and subcarrier allocation problem that minimizes the total system power for a multi-user, multi-relay and single source cooperative OFDM based two hop system. The system is constrained to all users having a specific subcarrier requirement (user fairness). However no specific fairness constraints for relays are considered. To ensure the optimum power allocation, the subcarriers in two hops are paired with each other. We obtain an optimal subcarrier allocation for the single user case using a similar method to what is described in [1] and modify the algorithm for multiuser scenario. Although the optimality is not achieved in multiuser case the probability of all users being served fairly is improved significantly with a relatively low cost trade off.

Philanthropy and sociology : a logical pairing

In philanthropic studies we hear about a growing academic discipline of ‘philanthropic psychology’ but arguably there is an equal role for ‘philanthropic sociology’, both from a research and a teaching perspective. This commentary begins by noting the early links between philanthropy and sociology. It then introduces a few Australian studies that show how sociology is enriching an understanding of philanthropy, its institutions and its place in society.

Analysis of bilinear pairing-based accumulator for identity escrowing

An accumulator based on bilinear pairings was proposed at CT-RSA'05. Here, it is first demonstrated that the security model proposed by Lan Nguyen does lead to a cryptographic accumulator that is not collision resistant. Secondly, it is shown that collision-resistance can be provided by updating the adversary model appropriately. Finally, an improvement on Nguyen's identity escrow scheme, with membership revocation based on the accumulator, by removing the trusted third party is proposed.

Pairing technology and meals: A contextual enquiry in the family household

Recent research about technology during mealtime has been mostly concerned with developing technology rather than creating a deeper understanding of the context of family mealtimes and associated practices. In this paper, we present a two-phase study discussing how the temporal, social, and food related features are intertwined with technology use during mealtimes. Our findings show how people differentiate technology usage during weekday meals, weekend meals, and among different meals of the day. We identify and analyse prototypical situations ranging from the use of arbitrary technologies while eating solitary, to idiosyncratic family norms and practices associated with shared technologies. We discuss the use of mealtime technology to create appropriate ambience for meals with guests and demonstrate how technology can be used to complement food in everyday meals and special occasions. Our findings make recommendation about the need for HCI research to recognize the contextual nature of technology usage during family mealtimes and to adopt appropriate design strategies.

Uncertainty avoidance: public sector clients and procurement selection

Purpose: Choosing the appropriate procurement system for construction projects is a complex and challenging task for clients particularly when professional advice has not been sought. To assist with the decision making process, a range of procurement selection tools and techniques have been developed by both academic and industry bodies. Public sector clients in Western Australia (WA) remain uncertain about the pairing of procurement method to bespoke construction project and how this decision will ultimately impact upon project success. This paper examines ‘how and why’ a public sector agency selected particular procurement methods. · Methodology/Approach: An analysis of two focus group workshops (with 18 senior project and policy managers involved with procurement selection) is reported upon · Findings: The traditional lump sum (TLS) method is still the preferred procurement path even though alternative forms such as design and construct, public-private-partnerships could optimize the project outcome. Paradoxically, workshop participants agreed that alternative procurement forms should be considered, but an embedded culture of uncertainty avoidance invariably meant that TLS methods were selected. Senior managers felt that only a limited number of contractors have the resources and experience to deliver projects using the nontraditional methods considered. · Research limitations/implications: The research identifies a need to develop a framework that public sector clients can use to select an appropriate procurement method. A procurement framework should be able to guide the decision-maker rather than provide a prescriptive solution. Learning from previous experiences with regard to procurement selection will further provide public sector clients with knowledge about how to best deliver their projects.

Faster pairings on special Weierstrass curves

This paper presents efficient formulas for computing cryptographic pairings on the curve y 2 = c x 3 + 1 over fields of large characteristic. We provide examples of pairing-friendly elliptic curves of this form which are of interest for efficient pairing implementations.

Queering cyberspace : fan fiction communities as spaces for expressing and exploring sexuality

The social construction of sexuality over the past one hundred and fifty years has created a dichotomy between heterosexual and non-heterosexual identities that essentially positions the former as “normal” and the latter as deviant. Even Kinsey’s and others’ work on the continuum of sexualities did little to alter the predominantly heterosexist perception of the non-heterosexual as “other” (Kinsey, Pomeroy and Martin 2007; Esterberg 2006; Franceour and Noonan 2007). Some political action and academic work is beginning to challenge such perceptions. Even some avenues of social interaction, such as the recent proliferation of online communities, may also challenge such views, or at least contribute to their being rethought in some ways. This chapter explores a specific kind of online community devoted to fan fiction, specifically homoerotic – or what is known colloquially as “slash” – fan fiction. Fan fiction is fiction, published on the internet, and written by fans of well-known books and television shows, using the characters to create new and varied plots. “Slash” refers to the pairing of two of the male characters in a romantic relationship, and the term comes from the punctuation mark dividing the named pair as, for example, Spock/Kirk from the Star Trek television series. Although there are some slash fan-fiction stories devoted to female-female relationships – called “femmeslash” – the term “slash” generally refers to male-male relationships, and will be utilized throughout this chapter, given that the research discussed focuses on communities centered around one such male pairing.

A gendered educational agenda : what's wrong with 10 Things I Hate About You?

Both William Shakespeare's play The Taming of the Shrew (1593) and the film 10 thing I hate About You (Gil Junger, 1999) contain tropes of gender and education and gendered education, and both represent and perform 'education'. That is, they depict characters undergoing a range of educational experiences and in turn educate their audience about what it means to be educated appropriately. It seems fitting then that these pairng of texts has been popular with high school teachers who, more often than not, use them as ways into teaching Shakespeare to contemporary adolescents. I suggest that the play-film pairing can be more productively introduced into the classroom as texts that offer critical readers the opportunity to contest the values of education and gender contatined within them, rather than as tools to reintroduce outdated notions of gendered agency and cultural authority. Indeed it is precisely because 10 Things is unequivocally a romantic comedy that aims to work within the audience's comfort zone that we must seriously interrogate the cultural politics of gender and education it promotes.