Ant Colony-Inspired Parallel Algorithm to Improve Cryptographic Pseudo Random Number Generators

We present a parallel algorithm to compute promising candidate states for modifying the state space of a pseudo-random number generator in order to increase its cycle length. This is important for generators in low-power devices where increase of state space is not an alternative. The runtime of the...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2017 IEEE Security and Privacy Workshops (SPW) S. 17 - 22
Hauptverfasser: Keller, Jorg, Spenger, Gabriele, Wendzel, Steffen
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.05.2017
Schlagworte:
ant-colony algorithm
Cryptography
Data structures
Generators
Memory management
Parallel algorithms
parallel graph algorithm
Pseudo-random number generator
Runtime
state space analysis
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract We present a parallel algorithm to compute promising candidate states for modifying the state space of a pseudo-random number generator in order to increase its cycle length. This is important for generators in low-power devices where increase of state space is not an alternative. The runtime of the parallel algorithm is improved by an analogy to ant colony behavior: if two paths meet, the resulting path is followed at accelerated speed just as ants tend to reinforce paths that have been used by other ants. We evaluate our algorithm with simulations and demonstrate high parallel efficiency that makes the algorithm well-suited even for massively parallel systems like GPUs. Furthermore, the accelerated path variant of the algorithm achieves a runtime improvement of up to 4% over the straight-forward implementation.
AbstractList We present a parallel algorithm to compute promising candidate states for modifying the state space of a pseudo-random number generator in order to increase its cycle length. This is important for generators in low-power devices where increase of state space is not an alternative. The runtime of the parallel algorithm is improved by an analogy to ant colony behavior: if two paths meet, the resulting path is followed at accelerated speed just as ants tend to reinforce paths that have been used by other ants. We evaluate our algorithm with simulations and demonstrate high parallel efficiency that makes the algorithm well-suited even for massively parallel systems like GPUs. Furthermore, the accelerated path variant of the algorithm achieves a runtime improvement of up to 4% over the straight-forward implementation.
Author Wendzel, Steffen
Keller, Jorg
Spenger, Gabriele
Author_xml – sequence: 1
  givenname: Jorg
  surname: Keller
  fullname: Keller, Jorg
  email: joerg.keller@fernuni-hagen.de
  organization: Fac. of Math. & Comput. Sci., Fern Univ. in Hagen, Hagen, Germany
– sequence: 2
  givenname: Gabriele
  surname: Spenger
  fullname: Spenger, Gabriele
  email: gabriele@spenger.org
  organization: Fac. of Math. & Comput. Sci., Fern Univ. in Hagen, Hagen, Germany
– sequence: 3
  givenname: Steffen
  surname: Wendzel
  fullname: Wendzel, Steffen
  email: wendzel@hs-worms.de
  organization: Fac. of Comput. Sci., Worms Univ. of Appl. Sci., Worms, Germany
BookMark eNotz81KxDAUQOEIunBGVy7d5AU69iZtkyxL0bEwaPEHlyVNb2cCaVLSjtC3V9DV2X1wNuTSB4-E3EG6A0jVw3vztWMpiB2HC7KBnMsCVCHFNWlLv9AquODXpPbzZCP2tNFRO4eOlu4Yol1OI10Crccphm-kVVynJRyjnk7W0GbGcx_om_Z9GOnLeeww0j16jHoJcb4hV4N2M97-d0s-nx4_qufk8Lqvq_KQWBD5koi8wIxr6ExqBCuEMR3IHqRB1g2YZ1oL1ikjUQFKzDKuxKAhZ1z9bmWK8y25_3MtIrZTtKOOaysZE0zm_AfjG1A7
CODEN IEEPAD
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/SPW.2017.31
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Xplore
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 1538619687
9781538619681
EndPage 22
ExternalDocumentID 8227285
Genre orig-research
GroupedDBID 6IE
6IL
CBEJK
RIE
RIL
ID FETCH-LOGICAL-i175t-756e43a1bc0c7267ccb18d18ce2bfe54aa72b9c8e91e8e44397fa152392014933
IEDL.DBID RIE
ISICitedReferencesCount 3
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000852904100003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Thu Jun 29 18:39:15 EDT 2023
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i175t-756e43a1bc0c7267ccb18d18ce2bfe54aa72b9c8e91e8e44397fa152392014933
PageCount 6
ParticipantIDs ieee_primary_8227285
PublicationCentury 2000
PublicationDate 2017-May
PublicationDateYYYYMMDD 2017-05-01
PublicationDate_xml – month: 05
  year: 2017
  text: 2017-May
PublicationDecade 2010
PublicationTitle 2017 IEEE Security and Privacy Workshops (SPW)
PublicationTitleAbbrev SPW
PublicationYear 2017
Publisher IEEE
Publisher_xml – name: IEEE
Score 1.667195
Snippet We present a parallel algorithm to compute promising candidate states for modifying the state space of a pseudo-random number generator in order to increase...
SourceID ieee
SourceType Publisher
StartPage 17
SubjectTerms ant-colony algorithm
Cryptography
Data structures
Generators
Memory management
Parallel algorithms
parallel graph algorithm
Pseudo-random number generator
Runtime
state space analysis
Title Ant Colony-Inspired Parallel Algorithm to Improve Cryptographic Pseudo Random Number Generators
URI https://ieeexplore.ieee.org/document/8227285
WOSCitedRecordID wos000852904100003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NSwMxEA1t8eBJpRW_ycGjaTe76SY5lmLRS1n8wN5KPqZaaHfLdlfw35tsSvXgxVvIJTADeXmZefMQuk1VwsCCoyVCK-LwlhIlDSNMu-vSWiskC2YTfDoVs5nMWuhur4UBgKb5DPp-2dTybWFq_1U2cGDGYzFsozbnadBq7SR3NJKD5-zNt2rxvjeM-2WV0iDF5Oh_Zxyj3o_kDmd7MDlBLci7aD7KK-yovWPo5DH3NXGwOFOl9z9Z4dHqvXDU_mONqwKHzwHA4_JrU4Ux1EuDsy3UtsBPKrfFGk8b9w8cJk17l50eep3cv4wfyM4RgSwdzFeED1NgiaLaRIbHKTdGU2GpMBDrBQyZUjzW0giQFAQw_9hYKIfQ7hHkqVCSnKJOXuRwhnCUJHFkDJOWcaYZVWYBXjpoqEufoOocdX1w5psw9GK-i8vF39uX6NCHPnQCXqFOVdZwjQ7MZ7XcljdNpr4BnD2Ymw
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8IwFH5BNNGTGjD-tgePDuhWaHckRCIRl0Uxclu69qEksJExTPzvbbcFPXjx1vTSpC_p1--9970P4LYnPYYaDS0RsXQM3lJH-oo5LDbPpdZa-Kw0m-BBIKZTP6zB3VYLg4hF8xm27LKo5etUbWyqrG3AjLuiuwO71jmrUmtVojva8dsv4Ztt1uItaxn3yyylwIrh4f9OOYLmj-iOhFs4OYYaJg2I-klODLk3HN0ZJbYqjpqEMrMOKAvSX7ynhtx_LEmekjI9gGSQfa3ychD1XJFwjRudkmeZ6HRJgsL_g5Szpq3PThNeh_eTwYNTeSI4cwP0ucO7PWSepLHqKO72uFIxFZoKhW48wy6TkruxrwT6FAUy-92YSYPR5htkyZDnnUA9SRM8BdLxPLejFPM14yxmVKoZWvGgoiaAgsozaNjLiVbl2Iuoupfzv7dvYP9h8jSOxqPg8QIObBjKvsBLqOfZBq9gT33m83V2XUTtG7xEm-Q
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2017+IEEE+Security+and+Privacy+Workshops+%28SPW%29&rft.atitle=Ant+Colony-Inspired+Parallel+Algorithm+to+Improve+Cryptographic+Pseudo+Random+Number+Generators&rft.au=Keller%2C+Jorg&rft.au=Spenger%2C+Gabriele&rft.au=Wendzel%2C+Steffen&rft.date=2017-05-01&rft.pub=IEEE&rft.spage=17&rft.epage=22&rft_id=info:doi/10.1109%2FSPW.2017.31&rft.externalDocID=8227285