发布求助
文献互助 智能选刊 最新文献

RAIRO Theor. Informatics Appl.最新文献

筛选
英文 中文
A tight bound for exhaustive key search attacks against Message Authentication Codes 针对消息身份验证码的穷举键搜索攻击的紧边界
RAIRO Theor. Informatics Appl. Pub Date : 2013-04-01 DOI: 10.1051/ITA/2012025
V. P. D. Sá, D. Boccardo, L. D. C. Carmo, Raphael Machado
{"title":"A tight bound for exhaustive key search attacks against Message Authentication Codes","authors":"V. P. D. Sá, D. Boccardo, L. D. C. Carmo, Raphael Machado","doi":"10.1051/ITA/2012025","DOIUrl":"https://doi.org/10.1051/ITA/2012025","url":null,"abstract":"A Message Authentication Code (MAC) is a function that takes a message and a key as parameters and outputs an authentication of the message. MAC are used to guarantee the legitimacy of messages exchanged through a network, since generating a correct authentication requires the knowledge of the key defined secretly by trusted parties. However, an attacker with access to a sufficiently large number of message/authentication pairs may use a brute force algorithm to infer the secret key: from a set containing initially all possible key candidates, subsequently remove those that yield an incorrect authentication, proceeding this way for each intercepted message/authentication pair until a single key remains. In this paper, we determine an exact formula for the expected number of message/authentication pairs that must be used before such form of attack is successful, along with an asymptotical bound that is both simple and tight. We conclude by illustrating a modern application where this bound comes in handy, namely the estimation of security levels in reflection-based verification of software integrity.","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"143 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114542456","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Cutwidth of iterated caterpillars 迭代毛虫的宽度
RAIRO Theor. Informatics Appl. Pub Date : 2013-04-01 DOI: 10.1051/ita/2012032
Lan Lin, Yixun Lin
{"title":"Cutwidth of iterated caterpillars","authors":"Lan Lin, Yixun Lin","doi":"10.1051/ita/2012032","DOIUrl":"https://doi.org/10.1051/ita/2012032","url":null,"abstract":"The cutwidth is an important graph-invariant in circuit layout designs. The cutwidth of a graph G is the minimum value of the maximum number of overlap edges when G is embedded into a line. A caterpillar is a tree which yields a path when all its leaves are removed. An iterated caterpillar is a tree which yields a caterpillar when all its leaves are removed. In this paper we present an exact formula for the cutwidth of the iterated caterpillars.","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131366220","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Signed Chip Firing Games and symmetric Sandpile Models on the cycles 签名芯片发射游戏和对称沙堆模型上的循环
RAIRO Theor. Informatics Appl. Pub Date : 2013-04-01 DOI: 10.1051/ita/2012023
R. Cori, T. H. Phan, Tran Thi Thu Huong
{"title":"Signed Chip Firing Games and symmetric Sandpile Models on the cycles","authors":"R. Cori, T. H. Phan, Tran Thi Thu Huong","doi":"10.1051/ita/2012023","DOIUrl":"https://doi.org/10.1051/ita/2012023","url":null,"abstract":"We investigate the Sandpile Model and Chip Firing Game and an extension of these models on cycle graphs. The extended model consists of allowing a negative number of chips at each vertex. We give the characterization of reachable configurations and of fixed points of each model. At the end, we give explicit formula for the number of their fixed points.","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122429507","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Integers in number systems with positive and negative quadratic Pisot base 正负二次皮索底数系中的整数
RAIRO Theor. Informatics Appl. Pub Date : 2013-02-19 DOI: 10.1051/ita/2014013
Z. Masáková, T. Vávra
{"title":"Integers in number systems with positive and negative quadratic Pisot base","authors":"Z. Masáková, T. Vávra","doi":"10.1051/ita/2014013","DOIUrl":"https://doi.org/10.1051/ita/2014013","url":null,"abstract":"We consider numeration systems with base $beta$ and $-beta$, for quadratic Pisot numbers $beta$ and focus on comparing the combinatorial structure of the sets $Z_beta$ and $Z_{-beta}$ of numbers with integer expansion in base $beta$, resp. $-beta$. Our main result is the comparison of languages of infinite words $u_beta$ and $u_{-beta}$ coding the ordering of distances between consecutive $beta$- and $(-beta)$-integers. It turns out that for a class of roots $beta$ of $x^2-mx-m$, the languages coincide, while for other quadratic Pisot numbers the language of $u_beta$ can be identified only with the language of a morphic image of $u_{-beta}$. We also study the group structure of $(-beta)$-integers.","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130298744","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Special Issue: Non-Classical Models of Automata and Applications III (NCMA-2011) 特刊:非经典自动机模型及其应用III (NCMA-2011)
RAIRO Theor. Informatics Appl. Pub Date : 2012-10-01 DOI: 10.1051/ita/2012022
R. Freund, M. Holzer, C. Mereghetti, F. Otto, Beatrice Palano
{"title":"Special Issue: Non-Classical Models of Automata and Applications III (NCMA-2011)","authors":"R. Freund, M. Holzer, C. Mereghetti, F. Otto, Beatrice Palano","doi":"10.1051/ita/2012022","DOIUrl":"https://doi.org/10.1051/ita/2012022","url":null,"abstract":"","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"175 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128684925","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Generating Networks of Splicing Processors 生成拼接处理器网络
RAIRO Theor. Informatics Appl. Pub Date : 2012-10-01 DOI: 10.1051/ita/2012016
J. Dassow, F. Manea, B. Truthe
{"title":"Generating Networks of Splicing Processors","authors":"J. Dassow, F. Manea, B. Truthe","doi":"10.1051/ita/2012016","DOIUrl":"https://doi.org/10.1051/ita/2012016","url":null,"abstract":"In this paper, we introduce generating networks of splicing processors (GNSP for short), a formal languages generating model related to networks of evolutionary processors and to accepting networks of splicing processors. We show that all recursively enumerable languages can be generated by GNSPs with only nine processors. We also show, by direct simulation, that two other variants of this computing model, where the communication between processors is conducted in different ways, have the same computational power.","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134253080","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Affine Parikh automata
RAIRO Theor. Informatics Appl. Pub Date : 2012-10-01 DOI: 10.1051/ita/2012013
M. Cadilhac, A. Finkel, P. McKenzie
{"title":"Affine Parikh automata","authors":"M. Cadilhac, A. Finkel, P. McKenzie","doi":"10.1051/ita/2012013","DOIUrl":"https://doi.org/10.1051/ita/2012013","url":null,"abstract":"The Parikh finite word automaton (PA) was introduced and studied in 2003 by Klaedtke and\u0000 Rues. Natural variants of the PA arise from viewing a PA equivalently as an automaton that\u0000 keeps a count of its transitions and semilinearly constrains their numbers. Here we adopt\u0000 this view and define the affine PA , that extends the PA by having each\u0000 transition induce an affine transformation on the PA registers, and the PA on\u0000 letters , that restricts the PA by forcing any two transitions on the same\u0000 letter to affect the registers equally. Then we report on the expressiveness, closure, and\u0000 decidability properties of such PA variants. We note that deterministic PA are strictly\u0000 weaker than deterministic reversal-bounded counter machines.","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"25 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114028366","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 20
Normal forms for unary probabilistic automata 一元概率自动机的标准形式
RAIRO Theor. Informatics Appl. Pub Date : 2012-10-01 DOI: 10.1051/ITA/2012017
M. Bianchi, G. Pighizzini
{"title":"Normal forms for unary probabilistic automata","authors":"M. Bianchi, G. Pighizzini","doi":"10.1051/ITA/2012017","DOIUrl":"https://doi.org/10.1051/ITA/2012017","url":null,"abstract":"We investigate the possibility of extending Chrobak normal form to the probabilistic\u0000 case. While in the nondeterministic case a unary automaton can be simulated by an\u0000 automaton in Chrobak normal form without increasing the number of the states in the\u0000 cycles, we show that in the probabilistic case the simulation is not possible by keeping\u0000 the same number of ergodic states. This negative result is proved by considering the\u0000 natural extension to the probabilistic case of Chrobak normal form, obtained by replacing\u0000 nondeterministic choices with probabilistic choices. We then propose a different kind of\u0000 normal form, namely, cyclic normal form, which does not suffer from the same problem: we\u0000 prove that each unary probabilistic automaton can be simulated by a probabilistic\u0000 automaton in cyclic normal form, with at most the same number of ergodic states. In the\u0000 nondeterministic case there are trivial simulations between Chrobak normal form and cyclic\u0000 normal form, preserving the total number of states in the automata and in their\u0000 cycles.","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125514417","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Fewest repetitions in infinite binary words 在无限二进制单词中重复次数最少
RAIRO Theor. Informatics Appl. Pub Date : 2012-07-24 DOI: 10.1051/ITA/2011109
Golnaz Badkobeh, M. Crochemore
{"title":"Fewest repetitions in infinite binary words","authors":"Golnaz Badkobeh, M. Crochemore","doi":"10.1051/ITA/2011109","DOIUrl":"https://doi.org/10.1051/ITA/2011109","url":null,"abstract":"A square is the concatenation of a nonempty word with itself. A word has period p if its letters at distance p match. The exponent of a nonempty word is the quotient of its length over its smallest period. In this article we give a proof of the fact that there exists an infinite binary word which contains finitely many squares and simultaneously avoids words of exponent larger than 7/3. Our infinite word contains 12 squares, which is the smallest possible number of squares to get the property, and 2 factors of exponent 7/3. These are the only factors of exponent larger than 2. The value 7/3 introduces what we call the finite-repetition threshold of the binary alphabet. We conjecture it is 7/4 for the ternary alphabet, like its repetitive threshold.","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"243 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115699228","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 15
Undecidability of infinite post correspondence problem for instances of size 8 对于大小为8的实例，无限邮政通信问题的不可判定性
RAIRO Theor. Informatics Appl. Pub Date : 2012-07-01 DOI: 10.1051/ita/2012015
Jing Dong, Qinghui Liu
{"title":"Undecidability of infinite post correspondence problem for instances of size 8","authors":"Jing Dong, Qinghui Liu","doi":"10.1051/ita/2012015","DOIUrl":"https://doi.org/10.1051/ita/2012015","url":null,"abstract":"The infinite Post Correspondence Problem ( ω PCP) was shown to be undecidable by Ruohonen (1985) in general. Blondel and Canterini [ Theory Comput. Syst. 36 (2003) 231–245] showed that ω PCP is undecidable for domain alphabets of size 105, Halava and Harju [ RAIRO–Theor. Inf. Appl. 40 (2006) 551–557] showed that ω PCP is undecidable for domain alphabets of size 9. By designing a special coding, we delete a letter from Halava and Harju’s construction. So we prove that ω PCP is undecidable for domain alphabets of size 8.","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114239497","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信