Correlation attacks on clock-controlled shift registers in keystream generators
A concept of constrained many-to-one string edit distances, with or without memory, based on edit operations of deletion and substitution is introduced, and the recursive algorithms for their efficient computation are derived. Their use for correlation attacks on clock-controlled shift register base...
Gespeichert in:
Veröffentlicht in: | IEEE transactions on computers 1996-04, Vol.45 (4), p.482-486 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 486 |
---|---|
container_issue | 4 |
container_start_page | 482 |
container_title | IEEE transactions on computers |
container_volume | 45 |
creator | Golic, J.D. Petrovic, S.V. |
description | A concept of constrained many-to-one string edit distances, with or without memory, based on edit operations of deletion and substitution is introduced, and the recursive algorithms for their efficient computation are derived. Their use for correlation attacks on clock-controlled shift register based keystream generators is proposed, the divide and conquer effect is examined, and the generalized reducibility property of functions with memory is pointed out as a design criterion. |
doi_str_mv | 10.1109/12.494106 |
format | Article |
fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_miscellaneous_28242225</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>494106</ieee_id><sourcerecordid>28242225</sourcerecordid><originalsourceid>FETCH-LOGICAL-c308t-add20fc3eae5a458ea1f158ad2d776f85e8f9ffce112bfae29f8acf597e155b33</originalsourceid><addsrcrecordid>eNo9kD1PwzAQhi0EEqUwsDJlQEgMKbYTJ_aIKr6kSl1gjq7OuYS6cfG5Q_89Qak63Un3vI90L2O3gs-E4OZJyFlpSsGrMzYRStW5Mao6ZxPOhc5NUfJLdkX0wzmvJDcTtpyHGNFD6kKfQUpgN5QNq_XBbnIb-hSD99hm9N25lEVcd5QwUtb12QYPlCLCNltjjxFSiHTNLhx4wpvjnLKv15fP-Xu-WL59zJ8XuS24Tjm0reTOFgiooFQaQTihNLSyrevKaYXaGecsCiFXDlAap8E6ZWocvloVxZQ9jN5dDL97pNRsO7LoPfQY9tRILUsppRrAxxG0MRBFdM0udluIh0bw5r-yRshmrGxg749SIAveRehtR6dAwY0uTD1gdyPWIeLpenT8AbwtdXA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>28242225</pqid></control><display><type>article</type><title>Correlation attacks on clock-controlled shift registers in keystream generators</title><source>IEEE Electronic Library (IEL)</source><creator>Golic, J.D. ; Petrovic, S.V.</creator><creatorcontrib>Golic, J.D. ; Petrovic, S.V.</creatorcontrib><description>A concept of constrained many-to-one string edit distances, with or without memory, based on edit operations of deletion and substitution is introduced, and the recursive algorithms for their efficient computation are derived. Their use for correlation attacks on clock-controlled shift register based keystream generators is proposed, the divide and conquer effect is examined, and the generalized reducibility property of functions with memory is pointed out as a design criterion.</description><identifier>ISSN: 0018-9340</identifier><identifier>EISSN: 1557-9956</identifier><identifier>DOI: 10.1109/12.494106</identifier><identifier>CODEN: ITCOB4</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Algorithmics. Computability. Computer arithmetics ; Applied sciences ; Boolean functions ; Clocks ; Computer science; control theory; systems ; Computer systems performance. Reliability ; Computers, microcomputers ; Cryptography ; Electronics ; Exact sciences and technology ; Feedback ; Hamming distance ; Hardware ; Information analysis ; Information security ; Information, signal and communications theory ; Mathematics ; Random sequences ; Shift registers ; Signal and communications theory ; Software ; Telecommunications and information theory ; Theoretical computing ; Vectors</subject><ispartof>IEEE transactions on computers, 1996-04, Vol.45 (4), p.482-486</ispartof><rights>1996 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c308t-add20fc3eae5a458ea1f158ad2d776f85e8f9ffce112bfae29f8acf597e155b33</citedby><cites>FETCH-LOGICAL-c308t-add20fc3eae5a458ea1f158ad2d776f85e8f9ffce112bfae29f8acf597e155b33</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/494106$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/494106$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=3098397$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Golic, J.D.</creatorcontrib><creatorcontrib>Petrovic, S.V.</creatorcontrib><title>Correlation attacks on clock-controlled shift registers in keystream generators</title><title>IEEE transactions on computers</title><addtitle>TC</addtitle><description>A concept of constrained many-to-one string edit distances, with or without memory, based on edit operations of deletion and substitution is introduced, and the recursive algorithms for their efficient computation are derived. Their use for correlation attacks on clock-controlled shift register based keystream generators is proposed, the divide and conquer effect is examined, and the generalized reducibility property of functions with memory is pointed out as a design criterion.</description><subject>Algorithmics. Computability. Computer arithmetics</subject><subject>Applied sciences</subject><subject>Boolean functions</subject><subject>Clocks</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems performance. Reliability</subject><subject>Computers, microcomputers</subject><subject>Cryptography</subject><subject>Electronics</subject><subject>Exact sciences and technology</subject><subject>Feedback</subject><subject>Hamming distance</subject><subject>Hardware</subject><subject>Information analysis</subject><subject>Information security</subject><subject>Information, signal and communications theory</subject><subject>Mathematics</subject><subject>Random sequences</subject><subject>Shift registers</subject><subject>Signal and communications theory</subject><subject>Software</subject><subject>Telecommunications and information theory</subject><subject>Theoretical computing</subject><subject>Vectors</subject><issn>0018-9340</issn><issn>1557-9956</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1996</creationdate><recordtype>article</recordtype><recordid>eNo9kD1PwzAQhi0EEqUwsDJlQEgMKbYTJ_aIKr6kSl1gjq7OuYS6cfG5Q_89Qak63Un3vI90L2O3gs-E4OZJyFlpSsGrMzYRStW5Mao6ZxPOhc5NUfJLdkX0wzmvJDcTtpyHGNFD6kKfQUpgN5QNq_XBbnIb-hSD99hm9N25lEVcd5QwUtb12QYPlCLCNltjjxFSiHTNLhx4wpvjnLKv15fP-Xu-WL59zJ8XuS24Tjm0reTOFgiooFQaQTihNLSyrevKaYXaGecsCiFXDlAap8E6ZWocvloVxZQ9jN5dDL97pNRsO7LoPfQY9tRILUsppRrAxxG0MRBFdM0udluIh0bw5r-yRshmrGxg749SIAveRehtR6dAwY0uTD1gdyPWIeLpenT8AbwtdXA</recordid><startdate>19960401</startdate><enddate>19960401</enddate><creator>Golic, J.D.</creator><creator>Petrovic, S.V.</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19960401</creationdate><title>Correlation attacks on clock-controlled shift registers in keystream generators</title><author>Golic, J.D. ; Petrovic, S.V.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c308t-add20fc3eae5a458ea1f158ad2d776f85e8f9ffce112bfae29f8acf597e155b33</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1996</creationdate><topic>Algorithmics. Computability. Computer arithmetics</topic><topic>Applied sciences</topic><topic>Boolean functions</topic><topic>Clocks</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems performance. Reliability</topic><topic>Computers, microcomputers</topic><topic>Cryptography</topic><topic>Electronics</topic><topic>Exact sciences and technology</topic><topic>Feedback</topic><topic>Hamming distance</topic><topic>Hardware</topic><topic>Information analysis</topic><topic>Information security</topic><topic>Information, signal and communications theory</topic><topic>Mathematics</topic><topic>Random sequences</topic><topic>Shift registers</topic><topic>Signal and communications theory</topic><topic>Software</topic><topic>Telecommunications and information theory</topic><topic>Theoretical computing</topic><topic>Vectors</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Golic, J.D.</creatorcontrib><creatorcontrib>Petrovic, S.V.</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on computers</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Golic, J.D.</au><au>Petrovic, S.V.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Correlation attacks on clock-controlled shift registers in keystream generators</atitle><jtitle>IEEE transactions on computers</jtitle><stitle>TC</stitle><date>1996-04-01</date><risdate>1996</risdate><volume>45</volume><issue>4</issue><spage>482</spage><epage>486</epage><pages>482-486</pages><issn>0018-9340</issn><eissn>1557-9956</eissn><coden>ITCOB4</coden><abstract>A concept of constrained many-to-one string edit distances, with or without memory, based on edit operations of deletion and substitution is introduced, and the recursive algorithms for their efficient computation are derived. Their use for correlation attacks on clock-controlled shift register based keystream generators is proposed, the divide and conquer effect is examined, and the generalized reducibility property of functions with memory is pointed out as a design criterion.</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/12.494106</doi><tpages>5</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 0018-9340 |
ispartof | IEEE transactions on computers, 1996-04, Vol.45 (4), p.482-486 |
issn | 0018-9340 1557-9956 |
language | eng |
recordid | cdi_proquest_miscellaneous_28242225 |
source | IEEE Electronic Library (IEL) |
subjects | Algorithmics. Computability. Computer arithmetics Applied sciences Boolean functions Clocks Computer science control theory systems Computer systems performance. Reliability Computers, microcomputers Cryptography Electronics Exact sciences and technology Feedback Hamming distance Hardware Information analysis Information security Information, signal and communications theory Mathematics Random sequences Shift registers Signal and communications theory Software Telecommunications and information theory Theoretical computing Vectors |
title | Correlation attacks on clock-controlled shift registers in keystream generators |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-02T20%3A33%3A25IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Correlation%20attacks%20on%20clock-controlled%20shift%20registers%20in%20keystream%20generators&rft.jtitle=IEEE%20transactions%20on%20computers&rft.au=Golic,%20J.D.&rft.date=1996-04-01&rft.volume=45&rft.issue=4&rft.spage=482&rft.epage=486&rft.pages=482-486&rft.issn=0018-9340&rft.eissn=1557-9956&rft.coden=ITCOB4&rft_id=info:doi/10.1109/12.494106&rft_dat=%3Cproquest_RIE%3E28242225%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=28242225&rft_id=info:pmid/&rft_ieee_id=494106&rfr_iscdi=true |