Implementation and analysis of the generalised new Mersenne number transforms for encryption

Encryption is very much a vast subject covering myriad techniques to conceal and safeguard data and communications. Of the techniques that are available, methodologies that incorporate the number theoretic transforms (NTTs) have gained recognition, specifically the new Mersenne number transform (NMN...

Full description

Bibliographic Details
Main Author: Rutter, Nick
Published: University of Newcastle upon Tyne 2015
Subjects:
Online Access:http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.697850
id ndltd-bl.uk-oai-ethos.bl.uk-697850
record_format oai_dc
spelling ndltd-bl.uk-oai-ethos.bl.uk-6978502018-08-21T03:25:09ZImplementation and analysis of the generalised new Mersenne number transforms for encryptionRutter, Nick2015Encryption is very much a vast subject covering myriad techniques to conceal and safeguard data and communications. Of the techniques that are available, methodologies that incorporate the number theoretic transforms (NTTs) have gained recognition, specifically the new Mersenne number transform (NMNT). Recently, two new transforms have been introduced that extend the NMNT to a new generalised suite of transforms referred to as the generalised NMNT (GNMNT). These two new transforms are termed the odd NMNT (ONMNT) and the odd-squared NMNT (O2NMNT). Being based on the Mersenne numbers, the GNMNTs are extremely versatile with respect to vector lengths. The GNMNTs are also capable of being implemented using fast algorithms, employing multiple and combinational radices over one or more dimensions. Algorithms for both the decimation-in-time (DIT) and -frequency (DIF) methodologies using radix-2, radix-4 and split-radix are presented, including their respective complexity and performance analyses. Whilst the original NMNT has seen a significant amount of research applied to it with respect to encryption, the ONMNT and O2NMNT can utilise similar techniques that are proven to show stronger characteristics when measured using established methodologies defining diffusion. Analyses in diffusion using a small but reasonably sized vector-space with the GNMNTs will be exhaustively assessed and a comparison with the Rijndael cipher, the current advanced encryption standard (AES) algorithm, will be presented that will confirm strong diffusion characteristics. Implementation techniques using general-purpose computing on graphics processing units (GPGPU) have been applied, which are further assessed and discussed. Focus is drawn upon the future of cryptography and in particular cryptology, as a consequence of the emergence and rapid progress of GPGPU and consumer based parallel processing.005.8University of Newcastle upon Tynehttp://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.697850http://hdl.handle.net/10443/3236Electronic Thesis or Dissertation
collection NDLTD
sources NDLTD
topic 005.8
spellingShingle 005.8
Rutter, Nick
Implementation and analysis of the generalised new Mersenne number transforms for encryption
description Encryption is very much a vast subject covering myriad techniques to conceal and safeguard data and communications. Of the techniques that are available, methodologies that incorporate the number theoretic transforms (NTTs) have gained recognition, specifically the new Mersenne number transform (NMNT). Recently, two new transforms have been introduced that extend the NMNT to a new generalised suite of transforms referred to as the generalised NMNT (GNMNT). These two new transforms are termed the odd NMNT (ONMNT) and the odd-squared NMNT (O2NMNT). Being based on the Mersenne numbers, the GNMNTs are extremely versatile with respect to vector lengths. The GNMNTs are also capable of being implemented using fast algorithms, employing multiple and combinational radices over one or more dimensions. Algorithms for both the decimation-in-time (DIT) and -frequency (DIF) methodologies using radix-2, radix-4 and split-radix are presented, including their respective complexity and performance analyses. Whilst the original NMNT has seen a significant amount of research applied to it with respect to encryption, the ONMNT and O2NMNT can utilise similar techniques that are proven to show stronger characteristics when measured using established methodologies defining diffusion. Analyses in diffusion using a small but reasonably sized vector-space with the GNMNTs will be exhaustively assessed and a comparison with the Rijndael cipher, the current advanced encryption standard (AES) algorithm, will be presented that will confirm strong diffusion characteristics. Implementation techniques using general-purpose computing on graphics processing units (GPGPU) have been applied, which are further assessed and discussed. Focus is drawn upon the future of cryptography and in particular cryptology, as a consequence of the emergence and rapid progress of GPGPU and consumer based parallel processing.
author Rutter, Nick
author_facet Rutter, Nick
author_sort Rutter, Nick
title Implementation and analysis of the generalised new Mersenne number transforms for encryption
title_short Implementation and analysis of the generalised new Mersenne number transforms for encryption
title_full Implementation and analysis of the generalised new Mersenne number transforms for encryption
title_fullStr Implementation and analysis of the generalised new Mersenne number transforms for encryption
title_full_unstemmed Implementation and analysis of the generalised new Mersenne number transforms for encryption
title_sort implementation and analysis of the generalised new mersenne number transforms for encryption
publisher University of Newcastle upon Tyne
publishDate 2015
url http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.697850
work_keys_str_mv AT rutternick implementationandanalysisofthegeneralisednewmersennenumbertransformsforencryption
_version_ 1718725775677456384