<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns="http://purl.org/rss/1.0/" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel rdf:about="http://theses.ncl.ac.uk/jspui/handle/10443/87">
    <title>DSpace Collection:</title>
    <link>http://theses.ncl.ac.uk/jspui/handle/10443/87</link>
    <description />
    <items>
      <rdf:Seq>
        <rdf:li rdf:resource="http://theses.ncl.ac.uk/jspui/handle/10443/6023" />
        <rdf:li rdf:resource="http://theses.ncl.ac.uk/jspui/handle/10443/3606" />
        <rdf:li rdf:resource="http://theses.ncl.ac.uk/jspui/handle/10443/3587" />
        <rdf:li rdf:resource="http://theses.ncl.ac.uk/jspui/handle/10443/3487" />
      </rdf:Seq>
    </items>
    <dc:date>2026-02-04T10:50:55Z</dc:date>
  </channel>
  <item rdf:about="http://theses.ncl.ac.uk/jspui/handle/10443/6023">
    <title>Post quantum cryptography :  alternative solutions to hard problems for security</title>
    <link>http://theses.ncl.ac.uk/jspui/handle/10443/6023</link>
    <description>Title: Post quantum cryptography :  alternative solutions to hard problems for security
Authors: Emerole, Kelechi Chukwunonyerem
Abstract: Post Quantum cryptography are defined as public key crypto algorithms whose pub lic keys are generated from hard computational problems that are complex to solve&#xD;
in polynomial time by a quantum computer given worst case instances. The hard&#xD;
problems which have been proven to be quantum resistant include the shortest vec tor problem of lattices, the syndrome decoding problem of certain error correcting&#xD;
codes and the isomorphism of polynomial problem of multivariate quadratic poly nomials. Solutions to these problems have been proposed which in turn have impact&#xD;
on the security and storage cost of such algorithms to protect information systems&#xD;
in the future. In this thesis, alternative solutions are proposed which are based on&#xD;
robust and complex vector space mappings. Firstly, Dimensionality mapping is pro posed to reduce the basis into its linear independent vectors at low dimensionality&#xD;
by constructing a collapse function as an optimization problem. This optimization&#xD;
problem can be solved on the condition that a projection of the basis vectors from the&#xD;
High dimensional space to low dimensional manifold would have nearly orthogonal&#xD;
constitution. These eliminates the need for pre-processing using Gram-Schmidt Or thogonalization process. Implementing this approach on a channel basis, showed an&#xD;
improved BER performance over the Lenstra-Lenstra-Lovatsz algorithm for about&#xD;
1db and 4db in the 4 × 4 and 6 × 6 uncoded system using 4QAM constellation.&#xD;
Secondly, the solution of the syndrome decoding problem is generalized to codes&#xD;
associated with the totally non-negative Grassmannian. The solution was reduced&#xD;
to an instance of finding a subset of the Pl¨ucker coordinates with the minimum&#xD;
Grassmann distance from the subspace containing the encrypted message symbols.&#xD;
Furthermore, bounds where derived which showed that the complexity scales up on&#xD;
the size of the Pl¨ucker coordinates. In addition, experimental results on decoding&#xD;
failure probability and complexity based on row operations where presented and&#xD;
compared to Low Density parity check codes in the Hamming metric. Finally, the&#xD;
kernel function of the New Mersenne number transform was applied to hide the&#xD;
4&#xD;
structure of the core map(central polynomial) of a multivariate polynomial based&#xD;
cryptosystem. This is in order to mitigate the interpolation of the rank of the&#xD;
quadratic form by an adversary. The implementation of this new isomorphism from&#xD;
the New Mersenne Number Transform showed an average of 69% reduction in secret&#xD;
key size. Further implementation of the isomorphism against key recovery attacks&#xD;
from the MinRank instance where carried out and it was shown that for lower field&#xD;
sizes the new isomorphism had an average success time of 13.8%.
Description: PhD Thesis</description>
    <dc:date>2023-01-01T00:00:00Z</dc:date>
  </item>
  <item rdf:about="http://theses.ncl.ac.uk/jspui/handle/10443/3606">
    <title>Integration of Biometrics and PIN Pad on Smart Card</title>
    <link>http://theses.ncl.ac.uk/jspui/handle/10443/3606</link>
    <description>Title: Integration of Biometrics and PIN Pad on Smart Card
Authors: Yang, Chunlei
Abstract: Secure payment is the basis of electronic commerce (e-commerce). A large&#xD;
amount of electronic payments are made via POS (point of sale) terminals using smart&#xD;
cards and legitimate users are usually authenticated by PIN. The security design of&#xD;
POS terminals and authentication methods are increasingly becoming concerns of ebusiness.&#xD;
The major aims and objectives of this industrially oriented research are to&#xD;
investigate a new solution at system level to improve the security of current POS payment systems. The contributions of this thesis include several aspects: 1) An indepth&#xD;
literature survey has been undertaken. The security threats of current POS&#xD;
terminals and available countermeasures have been systematically investigated. The&#xD;
main existing problems have been identified. 2) An innovative scheme, the so-called&#xD;
Supercard, which integrates PIN pad, biometrics and the smartcard, has been proposed.&#xD;
Approaches based on this scheme can meet security challenges posed by attacks such&#xD;
as visual and channel PIN attacks, display attacks, and fake-machine attacks. The&#xD;
scheme also has advantages to prevent the cryptographic key being disclosed by&#xD;
channel or side channel attacks. 3) The Supercard scheme has been examined&#xD;
specifically to improve fingerprint biometrics security. The Capture &amp; Match on Card&#xD;
scheme and corresponding authentication protocol has been designed with the&#xD;
advantage of preventing biometric channel attacks. Biohash is adopted to protect the&#xD;
biometric template. 4) Keystroke dynamics, as a behaviour biometric to strengthen&#xD;
PIN authentication, has been investigated under the specific conditions of a highly&#xD;
limited number of keystrokes. 5) The multimodal signals of PIN, fingerprint and&#xD;
keystroke dynamics have been studied through fuzzy-logic-based information fusion.
Description: PhD Thesis</description>
    <dc:date>2011-01-01T00:00:00Z</dc:date>
  </item>
  <item rdf:about="http://theses.ncl.ac.uk/jspui/handle/10443/3587">
    <title>Assessment of single phase SRM converters for low power applications</title>
    <link>http://theses.ncl.ac.uk/jspui/handle/10443/3587</link>
    <description>Title: Assessment of single phase SRM converters for low power applications
Authors: Ayob, Afida
Abstract: The switched reluctance machine (SRM) is the least expensive machine to produce yet is very reliable. The drive system for an SRM has to be designed so that there is integration between the machine and the converter-controller configuration. This thesis represents a study relating to power electronic converters for single-phase switched reluctance machine drives with emphasis on the cost of implication of the converters.  The study of the converters results in the proposal of a new converter concept based on minimising the cost contribution of the dc link capacitor.  By reducing the size of the capacitor, smaller and lighter SP-SRM drive is achieved.  A detailed analysis and simulation of the proposed converter has been conducted and enabled a design guideline for the proposed converter to be laid out.  A model of the SRM with hysteresis controller is developed.  Consequently, components have to be chosen carefully to minimise voltage dip, component stress, and energy loss from the freewheeling resistor.  To verify the operation of the new converter, tests were conducted on an experimental rig.  The proposed converter has the ability to supply double the peak supply of voltage to the machine winding.  In addition, the arrangement of the capacitors and diodes in the voltage multiplier means that positive and negative voltage rails can be supplied to the machine, which is very useful in an SP-SRM drive.  The high voltage allows the fast magnetisation of the windings and enables the machine to achieve potentially high speed.  Through the arrangements of the capacitors and diodes, the converter is able to handle recovered energy form the windings.
Description: PhD Thesis</description>
    <dc:date>2011-01-01T00:00:00Z</dc:date>
  </item>
  <item rdf:about="http://theses.ncl.ac.uk/jspui/handle/10443/3487">
    <title>Biometric iris image segmentation and feature extraction for iris recognition</title>
    <link>http://theses.ncl.ac.uk/jspui/handle/10443/3487</link>
    <description>Title: Biometric iris image segmentation and feature extraction for iris recognition
Authors: Ukpai, Charles Onyebuchi
Abstract: The continued threat to security in our interconnected world today begs for urgent&#xD;
solution. Iris biometric like many other biometric systems provides an alternative solution&#xD;
to this lingering problem. Although, iris recognition have been extensively studied, it is&#xD;
nevertheless, not a fully solved problem which is the factor inhibiting its implementation&#xD;
in real world situations today. There exists three main problems facing the existing iris&#xD;
recognition systems: 1) lack of robustness of the algorithm to handle non-ideal iris&#xD;
images, 2) slow speed of the algorithm and 3) the applicability to the existing systems in&#xD;
real world situation. In this thesis, six novel approaches were derived and implemented&#xD;
to address these current limitation of existing iris recognition systems.&#xD;
A novel fast and accurate segmentation approach based on the combination of graph-cut&#xD;
optimization and active contour model is proposed to define the irregular boundaries of&#xD;
the iris in a hierarchical 2-level approach. In the first hierarchy, the approximate boundary&#xD;
of the pupil/iris is estimated using a method based on Hough’s transform for the pupil and&#xD;
adapted starburst algorithm for the iris. Subsequently, in the second hierarchy, the final&#xD;
irregular boundary of the pupil/iris is refined and segmented using graph-cut based active&#xD;
contour (GCBAC) model proposed in this work. The segmentation is performed in two&#xD;
levels, whereby the pupil is segmented first before the iris. In order to detect and eliminate&#xD;
noise and reflection artefacts which might introduce errors to the algorithm, a preprocessing&#xD;
technique based on adaptive weighted edge detection and high-pass filtering&#xD;
is used to detect reflections on the high intensity areas of the image while exemplar based&#xD;
image inpainting is used to eliminate the reflections. After the segmentation of the iris&#xD;
boundaries, a post-processing operation based on combination of block classification&#xD;
method and statistical prediction approach is used to detect any super-imposed occluding&#xD;
eyelashes/eyeshadows. The normalization of the iris image is achieved though the rubber&#xD;
sheet model.&#xD;
In the second stage, an approach based on construction of complex wavelet filters and&#xD;
rotation of the filters to the direction of the principal texture direction is used for the&#xD;
extraction of important iris information while a modified particle swam optimization&#xD;
(PSO) is used to select the most prominent iris features for iris encoding. Classification&#xD;
of the iriscode is performed using adaptive support vector machines (ASVM).&#xD;
Experimental results demonstrate that the proposed approach achieves accuracy of&#xD;
98.99% and is computationally about 2 times faster than the best existing approach.
Description: PhD Thesis</description>
    <dc:date>2016-01-01T00:00:00Z</dc:date>
  </item>
</rdf:RDF>

