University of Waterloo

Displaying 161-168 of 168 results

  • White Papers // Jun 2009

    Going Mini: Extreme Lightweight Spam Filters

    In this paper, the authors set out to determine if effective mini-filters could be trained for email spam filtering, using a drastically reduced feature set. The experimental results presented suggest that several methods, including boosting with early stopping, greedy decision lists, and TWFS methods all give effective, low-cost solutions to...

    Provided By University of Waterloo

  • White Papers // Jun 2009

    Detecting Patterns in Finite Regular and Context-Free Languages

    The computational complexity of pattern matching has received much attention in the literature. Although determining whether a given word appears inside another can be done in linear time, other pattern-matching problems appear to be computationally intractable. In a classic paper, Angluin showed the problem of determining if an arbitrary pattern...

    Provided By University of Waterloo

  • White Papers // Jun 2009

    A Survey of Incentive Mechanisms in Peer-to-Peer Systems

    The fundamental assumption that Peer-To-Peer (P2P) networks can thrive on voluntary contribution of altruistic peers can no longer be supported without considering the impact of rational behavior on such decentralized systems. This paper attempts to shed light on the impact of rational free-riding behavior of participating peers on the stability...

    Provided By University of Waterloo

  • White Papers // Jun 2009

    DFMAC: DTN-Friendly Medium Access Control for Wireless Local Area Networks

    In this paper, the authors consider a wireless communication network for both low-speed mobile nodes in densely populated hotspots and high-speed mobile nodes roaming in a large area. Wireless Local Area Networks (WLANs) are deployed in the hotspots, while a delay/Disruption Tolerant Network (DTN) provides services to roaming nodes in...

    Provided By University of Waterloo

  • White Papers // Jun 2009

    SAT-Based Analysis of Feature Models Is Easy

    Feature models are a popular variability modeling notation used in product line engineering. Automated analyzes of feature models, such as consistency checking and interactive or offline product selection, often rely on translating models to propositional logic and using SATisfiability (SAT) solvers. Efficiency of individual satisfiability-based analyzes has been reported previously....

    Provided By University of Waterloo

  • White Papers // Jun 2009

    Network Virtualization: State of the Art and Research Challenges

    Recently network virtualization has been pushed forward by its proponents as a long term solution to the gradual ossification problem faced by the existing Internet and proposed to be an integral part of the next-generation networking paradigm. By allowing multiple heterogeneous network architectures to cohabit on a shared physical substrate,...

    Provided By University of Waterloo

  • White Papers // Mar 2009

    Hardware Implementations of Multi-output Welch-Gong Ciphers

    The WG family of ciphers provides keystreams with mathematically proven randomness properties such as ideal two-level autocorrelation, balance, long period, ideal tuple distribution, and high and exact linear complexity. In this paper, the authors extend the mathematical analysis of WG family of ciphers to Multi-Output WG (MOWG) ciphers and demonstrate...

    Provided By University of Waterloo

  • White Papers // Feb 2009

    Improving Tor using a TCP-over-DTLS Tunnel

    The Tor network gives anonymity to Internet users by relaying their traffic through the world over a variety of routers. All traffic between any pair of routers, even if they represent circuits for different clients, is multiplexed over a single TCP connection. This results in interference across circuits during congestion...

    Provided By University of Waterloo

  • White Papers // Oct 2010

    Squaring in Cyclotomic Subgroups

    In this paper, the authors propose new squaring formulae for cyclotomic subgroups of certain finite fields. Their formulae use a compressed representation of elements having the property that decompression can be performed at a very low cost. The squaring formulae lead to new exponentiation algorithms in cyclotomic subgroups which outperform...

    Provided By University of Waterloo

  • White Papers // May 2011

    Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves

    In this paper, the authors presents a novel optimal pairing over supersingular genus-2 binary hyperelliptic curves. Starting from Vercauteren's work on optimal pairings, they describe how to exploit the action of the 23m-th power Verschiebung in order to further reduce the loop length of Miller's algorithm compared to the genus-2...

    Provided By University of Waterloo

  • White Papers // Mar 2011

    Provable Possession and Replication of Data over Cloud Servers

    Cloud Computing (CC) is an emerging computing paradigm that can potentially offer a number of important advantages. One of the fundamental advantages of CC is pay-as-you-go pricing model, where customers pay only according to their usage of the services. Currently, data generation is outpacing users' storage availability, thus there is...

    Provided By University of Waterloo

  • White Papers // Jul 2011

    Preserving Access Privacy Over Large Databases

    Electronic Product Code (EPC) Radio Frequency IDentification (RFID) tags support a cost effective anti-counterfeiting mechanism through the tag-specific and globally unique Transponder ID (TID). However, with the existence of customizable tags, this countermeasure could easily be bypassed as long as the TID codes are leaked through either physically opening genuine...

    Provided By University of Waterloo

  • White Papers // Jun 2010

    On Implementation of Quadratic and Sub-Quadratic Complexity Multipliers using Type II Optimal Normal Bases

    Finite field arithmetic has received a considerable attention in the current cryptographic applications. Many researchers have focused on finite field multiplication due to its importance in various cryptographic operations. Moreover, finite field multiplication can be considered as a cornerstone for elliptic curve cryptosystems. Fan and Hasan introduced a new sub-quadratic...

    Provided By University of Waterloo

  • White Papers // Mar 2012

    Probabilistic Generation of Good Span n Sequences from Nonlinear Feedback Shift Registers

    A binary span n sequence generated by an n-stage NonLinear Feedback Shift Register (NLFSR) is a sequence with the randomness properties: period 2n-1, balanced and ideal n-tuple distribution. It is possible that it also has high linear span. For providing security in constrained environments such as RFID tags and sensor...

    Provided By University of Waterloo

  • White Papers // Jun 2012

    Sequential Multiplier with Sub-linear Gate Complexity

    Multiplication over finite fields is used in both symmetric and asymmetric key cryptosystems and has been a subject of study, especially for its improved implementation, among many researchers as evidenced in their publications. In this paper, the authors present a new sequential multiplier for extended binary finite fields. Like its...

    Provided By University of Waterloo

  • White Papers // Nov 2012

    A New Double Point Multiplication Method and its Implementation on Binary Elliptic Curves with Endomorphisms

    Efficient and high-performance implementation of point multiplication is crucial for elliptic curve cryptosystems. In this paper, the authors present a new double point multiplication algorithm based on differential addition chains. They use their scheme to implement single point multiplication on binary elliptic curves with efficiently computable endomorphisms. Their proposed scheme...

    Provided By University of Waterloo