See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/279526258

Arithmetic code&cryptography

Technical Report · November 2014

DOI: 10.13140/RG.2.1.3449.9684

CITATIONS READS
0 155

1 author:

Ahmad Khosravani
Isfahan University of Technology
3 PUBLICATIONS   0 CITATIONS   

SEE PROFILE

All content following this page was uploaded by Ahmad Khosravani on 02 July 2015.

The user has requested enhancement of the downloaded file.

 ‫‪Isfahan University of Technology‬‬

‫ﮔﺰﺍﺭﺵ ﮐﺎﺭ ﺩﺭﺱ ﻧﻈﺮﻳﻪ ﺍﻃﻼﻋﺎﺕ ﻭ ﮐﺪﻳﻨﮓ‬

‫‪Arithmetic Code‬‬

‫ﺳﻴﺪ ﺍﺣﻤﺪ ﺧﺴﺮﻭﺍﻧﯽ ﺗﻮﺍﻧﺎ‬

‫‪9204044‬‬

‫ﺩﮐﺘﺮ ﺣﺴﻴﻦ ﺳﻌﻴﺪی‬

‫ﺑﻬﻤﻦ ‪-93‬ﺩﺍﻧﺸﮑﺪﻩ ﺑﺮﻕ ﻭ ﮐﺎﻣﭙﻴﻮﺗﺮ‬

‫‪0‬‬
 ‫ﭼﻜﻴﺪﻩ‬

‫ﻣﻲﺩﻫﺪ‪.‬‬
‫ﻓﺸﺮﺩﻩﺳﺎﺯﻱ ﺍﺳﺖ ﻛﻪ ﺑﻪ ﻫﺮ ﭘﻴﺎﻡ ﻳﻚ ﻋﺪﺩ ﺣﻘﻴﻘﻲ ﺩﺭ ﺑﺎﺯﻩ)‪ [0,1‬ﺭﺍ ﻧﺴﺒﺖ ‌‬
‫‌‬ ‫ﻛﺪﮔﺬﺍﺭﻱ ﺣﺴﺎﺑﻲ ﻳﻚ ﺭﻭﺵ‬
‫ﻛﺪﻫﺎﻱ ﺣﺴﺎﺑﻲ ﻧﻴﺎﺯ ﺑﻪ ﻳﻚ ﺟﺪﻭﻝ ﺍﺣﺘﻤﺎﻻﺕ ﺍﺯ ﻛﺎﺭﺍﻛﺘﺮﻫﺎ ﺩﺍﺭﺩ‪ .‬ﺍﻳﻦ ﺟﺪﻭﻝ ﺍﺣﺘﻤﺎﻻﺕ ﺑﺮ ﺍﺳﺎﺱ ﻓﺮﻛﺎﻧﺲ ﺩﺍﺩﻩ ﻫﺎﻱ‬
‫ﻣﻲﺷﻮﺩ‪ .‬ﺩﺭ ﻛﺪﮔﺬﺍﺭﻱ ﺣﺴﺎﺑﻲ ﺗﻨﻬﺎ ﺑﻪ ﻋﻤﻠﻴﺎﺕ ﺣﺴﺎﺑﻲ ﻣﻌﻤﻮﻟﻲ ﺑﺮﺍﻱ ﻓﺸﺮﺩﻩ ﻛﺮﺩﻥ ﻳﺎ ﺍﺯ ﺣﺎﻟﺖ‬
‫ﻣﻮﺟﻮﺩ ﺩﺭ ﭘﻴﺎﻡ ﺳﺎﺧﺘﻪ ‌‬
‫ﻓﺸﺮﺩﻩ ﺧﺎﺭﺝ ﻛﺮﺩﻥ ﭘﻴﺎﻡ ﻧﻴﺎﺯ ﺍﺳﺖ‪ .‬ﻛﺪﻫﺎﻱ ﺣﺴﺎﺑﻲ ﺍﻳﻦ ﺗﻮﺍﻧﺎﻳﻲ ﺭﺍ ﺩﺍﺭﻧﺪ ﻛﻪ ﭘﻴﺎﻡ ﺭﺍ ﺑﻪ ﻳﻚ ﺩﻧﺒﺎﻟﻪ ﻓﺸﺮﺩﻩ ﺑﺎ ﻃﻮﻝ ﻧﺰﺩﻳﻚ‬
‫ﻭﻫﻤﻴﻦﻃﻮﺭ ﻧﻴﺎﺯ ﺑﻪ‬
‫‌‬ ‫ﺑﻪ ﺁﻧﺘﺮﻭﭘﻲ ﭘﻴﺎﻡ ﺗﺒﺪﻳﻞ ﻛﻨﻨﺪ‪ .‬ﺍﺯ ﻣﻌﺎﻳﺐ ﻛﺪﻫﺎﻱ ﺣﺴﺎﺑﻲ ﻧﻴﺎﺯ ﺑﻪ ﺣﺎﻓﻈﻪ ﺑﺮﺍﻱ ﺫﺧﻴﺮﻩ ﺟﺪﻭﻝ ﺍﺣﺘﻤﺎﻻﺕ‬
‫ﻳﻚ ﻛﺪﮔﺬﺍﺭﻱ ﻭ ﺩﻛﺪﮔﺬﺍﺭﻱ ﺑﺎ ﻣﻘﺎﺩﻳﺮﺩﻗﻴﻖ ﺍﺳﺖ‪ .‬ﺩﺭ ﺍﻳﻦ ﮔﺬﺍﺭﺵ ﺍﺑﺘﺪﺍ ﺑﺎ ﺍﺭﺍﺋﻪ ﭼﻨﺪ ﻣﺜﺎﻝ ﻧﺤﻮﻩ ﻛﺪﮔﺬﺍﺭﻱ ﻭ‬
‫ﻣﻲﺩﻫﻴﻢ ﺳﭙﺲ ﻳﻚ ﺭﻭﺵ)ﺗﺼﺤﻴﺢ ﻛﺪﻫﺎﻱ ﺣﺴﺎﺑﻲ ﺑﺮﺍﻱ ﺳﺮﻭﻳﺲ ‪(SMS‬‬
‫ﺩﻛﺪﮔﺬﺍﺭﻱ ﻛﺪﻫﺎﻱ ﺣﺴﺎﺑﻲ ﺭﺍ ﺗﻮﺿﻴﺢ ‌‬
‫ﻣﻲﺷﻮﺩ ﻭ ﺩﺭ ﻧﻬﺎﻳﺖ ﻳﻚ ﺭﻭﺵ ﺟﺪﻳﺪ ﺩﻳﮕﺮ ﺍﺏﻋﻨﻮﺍﻥ "‬
‫ﺑﺮﺍﻱ ﻓﺸﺮﺩﻩ ﺳﺎﺯﻱ ﺑﻬﺘﺮ ﭘﻴﺎﻡ ﺩﺭ ﺳﺮﻭﻳﺲ ﭘﻴﺎﻡ ﻛﻮﺗﺎﻩ ﺍﺭﺍﺋﻪ ‌‬
‫ﻓﺸﺮﺩﻩﺳﺎﺯﻱ ﻭ‬
‫‌‬ ‫ﻣﻲﺷﻮﺩ ﻛﻪ ﻗﺎﺑﻠﻴﺖ ﻫﻤﺰﻣﺎﻥ‬
‫ﺑﺎﺯﻩﻫﺎﻱ ﺗﻨﻈﻴﻢ ﺷﻮﻧﺪﻩ" ﻣﻌﺮﻓﻲ ‌‬
‫ﻛﺪﮔﺬﺍﺭﻱ ﺻﺤﻴﺢ ﺣﺴﺎﺑﻲ ﺍﻣﻦ ﺑﺎ ﺍﻧﺪﺍﺯﻩ ‌‬
‫ﺭﻣﺰﻧﮕﺎﺭﻱ ﺭﺍ ﺩﺍﺭﺩ‪.‬‬

‫‪1‬‬
 ‫ﻣﺜﺎﻝ)ﻛﺪﮔﺬﺍﺭﻱ(‪:‬‬

‫ﻣﺜﺎﻝ )ﺩﻛﺪﮔﺬﺍﺭﻱ(‪:‬‬

‫‪2‬‬
 ‫ﺗﺼﺤﻴﺢ ﻛﺪﻫﺎﻱ ﺣﺴﺎﺑﻲ ﺑﺮﺍﻱ ﺳﺮﻭﻳﺲ ‪SMS‬‬

‫ﻣﻲﺩﻫﻴﻢ‪ .‬ﺍﮔﺮ ﺍﺯ ﻛﺪﻫﺎﻱ ﺣﺴﺎﺑﻲ‬

‫ﺩﺭ ﺍﻳﻦ ﻣﺒﺤﺚ ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﻛﺪﻫﺎﻱ ﺣﺴﺎﺑﻲ ﺩﺭ ﺳﺮﻭﻳﺲ‪SMS‬ﺭﺍ ﻣﻮﺭﺩ ﺑﺮﺭﺳﻲ ﻗﺮﺍﺭ ‌‬
‫ﺁﻥﮔﺎﻩ ﻃﻮﻝ ﭘﻴﺎﻡ ﻓﺸﺮﺩﻩ ﻣﻤﻜﻦ ﺍﺳﺖ ﻧﺴﺒﺖ ﺑﻪ ﭘﻴﺎﻡ ﺍﺻﻠﻲ‬
‫ﭘﻴﺎﻡﻫﺎﻱ ﺑﺎ ﻃﻮﻝ ﻛﻮﺗﺎﻩ ﺍﺳﺘﻔﺎﺩﻩ ﺷﻮﺩ ‌‬
‫ﺑﺮﺍﻱ ﻓﺸﺮﺩﻩ ﻛﺮﺩﻥ ‌‬
‫ﺳﻤﺒﻞﻫﺎ‪ ،‬ﻓﺸﺮﺩﻩ ﺷﺪﻩ ﻭ ﻫﻤﺮﺍﻩ ﭘﻴﺎﻡ ﻓﺸﺮﺩﻩ‬
‫‌‬ ‫ﺑﺰﺭﮔﺘﺮ ﺷﻮﺩ ﺯﻳﺮﺍ ﻛﻪ ﺩﺭ ﻛﺪﻫﺎﻱ ﺣﺴﺎﺑﻲ ﺑﺎﻳﺪ ﺟﺪﻭﻝ ﺍﺣﺘﻤﺎﻻﺕ ﻣﺮﺑﻮﻁ ﺑﻪ‬
‫ﺷﺪﻩ ﺑﺮﺍﻱ ﮔﻴﺮﻧﺪﻩ ﻓﺮﺳﺘﺎﺩﻩ ﺷﻮﺩ‪ .‬ﺑﻪ ﻃﻮﺭ ﻛﻠﻲ ﻧﻴﺎﺯ ﺑﻪ ﺣﺎﻓﻈﻪ ﺍﺿﺎﻓﻲ ﺑﺮﺍﻱ ﺫﺧﻴﺮﻩ ﺟﺪﻭﻝ ﺍﺣﺘﻤﺎﻻﺕ ﻣﺮﺑﻮﻁ ﺑﻪ ﺳﻤﺒﻞ ﻫﺎ ﻭ‬
‫ﻫﻤﻴﻦﻃﻮﺭ ﻧﻴﺎﺯ ﺑﻪ ﻳﻚ ‪ encoder‬ﻭ ‪ decoder‬ﻗﻮﻱ ﺑﺎ ﻋﻤﻠﻜﺮﺩ ﺧﻮﺏ ﺍﺯ ﻣﻌﺎﻳﺐ ﻛﺪﻫﺎﻱ ﺣﺴﺎﺑﻲ ﻣﻴﺒﺎﺷﺪ‪.‬ﺳﺮﻭﻳﺲ‬
‫‌‬
‫ﭘﻴﺎﻡ ﻛﻮﺗﺎﻩ ﻳﺎ ‪ SMS‬ﻳﻚ ﺳﺮﻭﻳﺲ ﺩﻭ ﻃﺮﻓﻪ ﻣﺨﺎﺑﺮﺍﺗﻲ ﺍﺳﺖ ﻛﻪ ﺑﺮﺍﻱ ﺍﺭﺳﺎﻝ ﻭ ﺩﺭﻳﺎﻓﺖ ﻣﺘﻦ ﺑﺎ ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﺳﻴﺴﺘﻢ‬
‫ﻣﻲﺭﻭﺩ‪ .‬ﻫﺮ ‪ SMS‬ﺍﺯ ﺩﻭ ﻗﺴﻤﺖ ‪ header‬ﻛﻪ ﺷﺎﻣﻞ ﺍﻃﻼﻋﺎﺗﻲ ﺩﺭ ﻣﻮﺭﺩ ﻓﺮﺳﺘﻨﺪﻩ ﭘﻴﺎﻡ ﻭ ﺯﻣﺎﻥ‬
‫‪ wireless‬ﺑﻪ ﻛﺎﺭ ‌‬
‫ﺍﺭﺳﺎﻝ ﭘﻴﺎﻡ ﻭ ‪ body‬ﻛﻪ ﺷﺎﻣﻞ ﻣﺘﻨﻲ ﺍﺳﺖ ﻛﻪ ﻓﺮﺳﺘﻨﺪﻩ ﻗﺼﺪ ﺩﺍﺭﺩ ﺁﻥ ﺭﺍ ﺍﺭﺳﺎﻝ ﻛﻨﺪ‪ .‬ﺑﺎ ﺍﻳﻦ ﺩﻟﻴﻞ ﻛﻪ ‪ header‬ﺩﺭ‬
‫ﺳﺮﻭﻳﺲﻫﺎﻱ ‪ SMS‬ﺍﺯ ﺳﻴﺴﺘﻢ ﻛﺪﮔﺬﺍﺭﻱ‬
‫‌‬ ‫ﺳﺮﻭﻳﺲﻫﺎﻱ ‪ SMS‬ﺑﻪ ﺭﺍﺣﺘﻲ ﻗﺎﺑﻞ ﺑﺎﺯﻳﺎﺑﻲ ﺑﻮﺩﻩ ﻭ ﻫﻤﻴﻨﻄﻮﺭ ﺩﺭ ﺑﻴﺸﺘﺮ‬
‫‌‬
‫ﻣﻲﺷﻮﺩ ﭘﺲ ﺗﻮﺟﻪ ﺍﺻﻠﻲ ﺧﻮﺩ ﺭﺍ ﻣﻌﻄﻮﻑ ﺑﻪ ﺑﺪﻧﻪ ﺍﺻﻠﻲ ‪ SMS‬ﺩﺭ ﺣﺎﻟﺖ‪ GSM7‬ﺑﻴﺘﻲ ﻣﻲ‌ﻛﻨﻴﻢ‪.‬‬
‫‪ GSM7‬ﺑﻴﺘﻲ ﺍﺳﺘﻔﺎﺩﻩ ‌‬

‫ﻣﻲﻛﻨﻴﻢ‪ .‬ﻃﺮﺡ ﭘﻴﺸﻨﻬﺎﺩﻱ‬

‫ﺩﺭ ﺍﻳﻦ ﻗﺴﻤﺖ ﺭﻭﺷﻲ ﺟﺪﻳﺪ ﺑﺮﺍﻱ ﻛﺪﮔﺬﺍﺭﻱ ‪ SMS‬ﺍﺯ ﻃﺮﻳﻖ ﻛﺪﻫﺎﻱ ﺣﺴﺎﺑﻲ ﻣﻌﺮﻓﻲ ‌‬
‫ﻣﻲﺩﻫﻴﻢ‪.‬‬
‫ﺟﺪﻳﺪ ﺭﺍ ‪ Arithmetic Coding Hybrid Ario‬ﻭ ﺑﻪ ﺍﺧﺘﺼﺎﺭ ﺑﺎ ﻧﻤﺎﺩ ‪ ACHA‬ﻧﺸﺎﻥ ‌‬

‫ﻓﺸﺮﺩﻩﺳﺎﺯﻱ ﻧﻴﺎﺯﻱ ﺑﻪ ﺟﺪﻭﻝ ﺗﺒﺪﻳﻠﻲ ﺑﺮﺍﻱ ﻓﺸﺮﺩﻩ ﻛﺮﺩﻥ ﻭ ﺧﺎﺭﺝ ﻛﺮﺩﻥ ﺍﺯ ﺣﺎﻟﺖ ﻓﺸﺮﺩﻩ ﺩﺍﺩﻩ ﻫﺎ ﻧﻴﺎﺯ‬
‫‌‬ ‫ﻫﺮ ﺍﻟﮕﻮﺭﻳﺘﻢ‬
‫ﻣﻲﺷﻮﺩ‪ .‬ﺩﺭ ﺷﻴﻮﻩ ﻛﺪﮔﺬﺍﺭﻱ ﺣﺴﺎﺑﻲ ﺟﺪﻭﻝ ﺗﺒﺪﻳﻞ‬
‫ﺩﺍﺭﺩ ﻛﻪ ﺍﻳﻦ ﺟﺪﻭﻝ ﺗﺒﺪﻳﻞ ﺑﺮﺍﺳﺎﺱ ﺧﺼﻮﺻﻴﺎﺕ ﺩﺍﺩﻩ ﻫﺎ ﺳﺎﺧﺘﻪ ‌‬
‫ﻣﻲﺷﻮﺩ‪ .‬ﺩﺭ ﺷﻴﻮﻩ ﻛﺪﮔﺬﺍﺭﻱ ﺣﺴﺎﺑﻲ ‪ decoder‬ﺑﺮﺍﻱ ﺧﺎﺭﺝ ﻛﺮﺩﻥ‬
‫ﻣﻌﻤﻮﻻ ﺑﺎ ﻋﻨﻮﺍﻥ ﺟﺪﻭﻝ ﺩﺍﻣﻨﻪ ﺍﺣﺘﻤﺎﻻﺕ ﺷﻨﺎﺧﺘﻪ ‌‬
‫ﻣﺘﻦ ﺍﺯ ﺣﺎﻟﺖ ﻓﺸﺮﺩﻩ ﻧﻴﺎﺯ ﺑﻪ ﻫﻤﺎﻥ ﺟﺪﻭﻝ ﺩﺍﻣﻨﻪ ﺍﺣﺘﻤﺎﻻﺗﻲ ﺩﺍﺭﺩ ﻛﻪ ﺩﺭ ‪ encoding‬ﺍﺳﺘﻔﺎﺩﻩ ﺷﺪﻩ ﺍﺳﺖ‪ .‬ﺑﺮﺍﻱ ﺍﻳﻦ ﻛﺎﺭ‬
‫ﺭﺩﻩ)‪ header‬ﭘﻴﺎﻡ ﺍﺻﻠﻲ( ﻭ ﺁﻥ ﺭﺍ ﺑﻪ ﺍﻭﻝ ﭘﻴﺎﻡ ﻓﺸﺮﺩﻩ ﺍﺻﻠﻲ‬
‫ﻣﻌﻤﻮﻻ ‪ encoder‬ﺟﺪﻭﻝ ﺩﺍﻣﻨﻪ ﺍﺣﺘﻤﺎﻻﺕ ﺭﺍ ﻓﺸﺮﺩﻩ ﻙ‬
‫ﻣﻲﻛﻨﺪ‪.‬‬
‫ﻣﻲﭼﺴﺒﺎﻧﺪ ﻭ ﺁﻥ ﺭﺍ ﺍﺭﺳﺎﻝ ‌‬
‫‌‬

‫ﻓﺸﺮﺩﻩﺳﺎﺯﻱ ﺩﺍﺩﻩ ﻫﺎﻱ ﺑﺎ ﻃﻮﻝ ﺑﺰﺭگ ﺑﺎ ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﻛﺪﮔﺬﺍﺭﻱ ﺣﺴﺎﺑﻲ ﻓﺎﺻﻠﻪ ﻗﺎﺑﻞ ﺗﻮﺟﻬﻲ ﺑﻴﻦ ﻃﻮﻝ ﭘﻴﺎﻡ ﻓﺸﺮﺩﻩ‬
‫‌‬ ‫ﺩﺭ‬
‫ﻃﻮﻝﻫﺎﻱ ﻛﻮﭼﻚ ﺍﻳﻦ ﻓﺎﺻﻠﻪ ﻗﺎﺑﻞ ﺗﻮﺟﻪ‬
‫‌‬ ‫ﻣﺘﻦ ﺍﺻﻠﻲ ﻭ ﭘﻴﺎﻡ ﻓﺸﺮﺩﻩ ﺣﺎﺻﻞ ﺍﺯ ﻣﺘﻦ ﺍﺻﻠﻲ ﻭ ‪ header‬ﻧﻴﺴﺖ‪ .‬ﻭﻟﻲ ﺩﺭ‬
‫ﻣﻲﻳﺎﺑﺪ‪.‬‬
‫ﺍﺳﺖ‪ .‬ﺩﺭ ﻭﺍﻗﻪ ﻧﺴﺒﺖ ﻓﺸﺮﺩﻩ ﺳﺎﺯﻱ )‪ (Compression Ratio‬ﺍﻓﺰﺍﻳﺶ ‌‬

‫‪3‬‬
 ‫ﻣﻲﺷﻮﺩ‪:‬‬
‫ﻣﻲﮔﻮﻳﻴﻢ ﻭ ﺑﻪ ﺻﻮﺭﺕ ﺯﻳﺮ ﺗﻌﺮﻳﻒ ‌‬
‫ﻧﺴﺒﺖ ﺑﻴﻦ ﺳﺎﻳﺰ ﺩﺍﺩﻩ ﻓﺸﺮﺩﻩ ﺷﺪﻩ ﻭ ﺩﺍﺩﻩ ﺍﺻﻠﻲ ﺭﺍ ﻧﺴﺒﺖ ﻓﺸﺮﺩﻩ ﺳﺎﺯﻱ ‌‬

‫ﻫﺮ ﻛﺎﺭﺍﻛﺘﺮ ﺩﺭ ﺳﺮﻭﻳﺲ ‪ SMS‬ﺑﺎ ﻳﻚ ﺩﻧﺒﺎﻟﻪ ‪ 7‬ﺑﻴﺘﻲ ﻛﺪ ﻣﻲ ‌ﺷﻮﺩ ﻭ ﻣﺎﻛﺰﻳﻤﻢ ﻇﺮﻓﻴﺖ ﻳﻚ ‪ SMS‬ﺑﺮﺍﺑﺮ ﺑﺎ ‪ 1120‬ﺑﻴﺖ‬
‫ﻣﻲﺷﻮﺩ ﻭ ﻟﺬﺍ ﻣﺸﻜﻞ ﺑﺰﺭگ ﺑﻮﺩﻥ ﻧﺴﺒﺖ ﻓﺸﺮﺩﻩ‬
‫ﻣﻲﺑﺎﺷﺪ‪ .‬ﭘﺲ ﻫﺮ‪ SMS‬ﺑﻪ ﻋﻨﻮﺍﻥ ﻳﻚ ﺩﺍﺩﻩ ﺑﺎ ﻃﻮﻝ ﻛﻮﭼﻚ ﻣﺤﺴﻮﺏ ‌‬
‫‌‬
‫ﺳﺎﺯﻱ ﺭﺍ ﺩﺍﺭﻳﻢ ‪ .‬ﺑﺮﺍﻱ ﺣﻞ ﺍﻳﻦ ﻣﺸﻜﻞ ﻧﻴﺎﺯ ﺑﻪ ﺣﺬﻑ ﻗﺴﻤﺖ ﺣﺎﺻﻞ ﺍﺯ ﻓﺸﺮﺩﻩ ﺳﺎﺯﻱ ‪ header‬ﺩﺍﺭﻳﻢ ﻛﻪ ﺍﻳﻦ ﻛﺎﺭ‬
‫ﻣﻲﻛﻨﻴﻢ‪.‬‬
‫ﻣﻲﺁﻭﺭﺩ ﺑﻨﺎﺑﺮﺍﻳﻦ ﺭﻭﺵ ﭘﻴﺸﻨﻬﺎﺩﻱ ﺟﺪﻳﺪ‪ ACHA‬ﺭﺍ ﺑﻪ ﺻﻮﺭﺕ ﺯﻳﺮ ﺍﺭﺍﺋﻪ ‌‬
‫ﻛﺎﺭﺍﻳﻲ ﻛﺪﻫﺎﻱ ﺣﺴﺎﺑﻲ ﺭﺍ ﭘﺎﻳﻴﻦ ‌‬

‫ﺭﻭﺵ ﭘﻴﺸﻨﻬﺎﺩﻱ ‪: ACHA‬‬

‫ﻣﻲﻛﻨﻴﻢ ﺟﺪﻭﻝ ﺩﺍﻣﻨﻪ ﺍﺣﺘﻤﺎﻻﺕ ﺭﺍ ﺑﻬﻴﻨﻪ ﻛﻨﻴﻢ‪ .‬ﺑﺮﺍﻱ ﺍﻳﻦ ﻛﺎﺭ ﺍﺑﺘﺪﺍ ﺟﺪﻭﻝ ﺩﺍﻣﻨﻪ ﺍﺣﺘﻤﺎﻻﺕ ﻛﻪ‬
‫ﺩﺭ ﺍﻳﻦ ﺭﻭﺵ ﺳﻌﻲ ‌‬
‫ﻣﻲﮔﻴﺮﻳﻢ ﻭ ﺁﻥ ﺭﺍ ﺑﻪ ‪ n‬ﺗﺎ ﺯﻳﺮ ﺟﺪﻭﻝ‬
‫ﺍﺯ ﺭﻭﻱ ﻓﺮﻛﺎﻧﺲ ﻛﺎﺭﺍﻛﺘﺮﻫﺎﻱ ﺍﺳﺘﻔﺎﺩﻩ ﺷﺪﻩ ﺩﺭ ‪ SMS‬ﺍﺳﺘﻔﺎﺩﻩ ﺷﺪﻩ ﺭﺍ ﺩﺭ ﻧﻈﺮ ‌‬
‫ﻣﻲﻛﻨﻴﻢ ﻛﻪ ﺩﺭ ﺁﻥ ﻛﺎﺭﺍﻛﺘﺮﻫﺎﻳﻲ ﻛﻪ ﺩﺍﺭﺍﻱ ﻓﺮﻛﺎﻧﺲ ﻧﺰﺩﻳﻚ ﺑﻪ ﻫﻢ ﻫﺴﺘﻨﺪ ﺩﺭ ﻳﻚ ﺯﻳﺮﺟﺪﻭﻝ ﻗﺮﺍﺭ‬
‫ﺍﺣﺘﻤﺎﻝ ﺗﻘﺴﻴﻢ ‌‬
‫ﻣﺖ ‪ SMS‬ﺍﺳﺖ‪ .‬ﺍﺯ ﻛﻨﺎﺭ ﻫﻢ‬
‫ﻣﻲﻛﻨﻴﻢ ﻛﻪ ﺷﺎﻣﻞ ﻛﺎﺭﺍﻛﺘﺮﻫﺎﻱ ﻣﻮﺟﻮﺩ ﺩﺭ ﻥ‬
‫ﻣﻲﮔﻴﺮﻧﺪ‪ .‬ﺣﺎﻝ ﺯﻳﺮ ﺟﺪﻭﻟﻬﺎﻳﻲ ﺭﺍ ﺍﻧﺘﺨﺎﺏ ‌‬
‫‌‬
‫ﻣﻲﺁﻳﺪ ﻛﻪ ﺑﻪ ﻭﺿﻮﺡ ﺩﺍﺭﺍﻱ ﻛﺎﺭﺍﻛﺘﺮﻫﺎﻱ‬
‫ﺟﺪﻭﻝﻫﺎ ﻳﻚ ﺟﺪﻭﻝ ﺩﺍﻣﻨﻪ ﺍﺻﻠﻲ ﺍﺣﺘﻤﺎﻝ ﺑﻪ ﺩﺳﺖ ‌‬
‫‌‬ ‫ﻗﺮﺍﺭ ﺩﺍﺩﻥ ﺍﻳﻦ ﺯﻳﺮ‬
‫ﻛﻤﺘﺮﻱ ﻧﺴﺒﺖ ﺑﻪ ﺟﺪﻭﻝ ﺩﺍﻣﻨﻪ ﺍﺣﺘﻤﺎﻝ ﻗﺒﻠﻲ ﺍﺳﺖ‪ .‬ﺣﺎﻝ ‪ encoder‬ﺍﺯ ﺭﻭﻱ ﺍﻳﻦ ﺟﺪﻭﻝ ﺍﺻﻠﻲ ﺍﺣﺘﻤﺎﻻﺕ ﻭ ﺑﺎ ﺍﺳﺘﻔﺎﺩﻩ‬
‫ﻣﻲﻛﻨﺪﺳﭙﺲ ﺩﻧﺒﺎﻟﻪ ﭘﻴﻜﺮﺑﻨﺪﻱ)ﺩﻧﺒﺎﻟﻪ ﺑﻴﺘﻲ ﺑﻪ‌ﺩﺳﺖ ﺁﻣﺪﻩ ﺍﺯ ﺟﺪﻭﻝ‬
‫ﺍﺯ ﻛﺪﮔﺬﺍﺭﻱ ﺣﺴﺎﺑﻲ ﻣﺘﻦ ‪ SMS‬ﻣﻮﺭﺩ ﻧﻈﺮ ﺭﺍ ﻓﺸﺮﺩﻩ ‌‬
‫ﻣﻲﻓﺮﺳﺘﺪ‪ .‬ﺍﺯ ﺳﻮﻱ‬
‫ﻣﻲﭼﺴﺒﺎﻧﺪ ﻭ ﺁﻥ ﺭﺍ ﺑﺮﺍﻱ ﮔﻴﺮﻧﺪﻩ ‌‬
‫ﺍﺻﻠﻲ ﺍﺣﺘﻤﺎﻝ ﺩﺭ ﺍﻟﮕﻮﺭﻳﺘﻢ ‪ (ACHA‬ﺭﺍ ﺑﻪ ﺍﻭﻝ ﺩﻧﺒﺎﻟﻪ ﻓﺸﺮﺩﻩ ﺷﺪﻩ ‌‬
‫ﺑﺎﺯﻳﺎﺏ ﺟﺪﻭﻝ ﺍﺻﻠﻲ ﺍﺣﺘﻤﺎﻻﺕ ﻋﻤﻞ‬
‫ﺩﻳﮕﺮ ﺩﺭ ﻣﻘﺼﺪ ﮔﻴﺮﻧﺪﻩ ﺑﻌﺪ ﺍﺯ ﺧﺎﺭﺝ ﻛﺮﺩﻥ ﺩﻧﺒﺎﻟﻪ ﭘﻴﻜﺮﺑﻨﺪﻱ ﺍﺯ ﺣﺎﻟﺖ ﻓﺸﺮﺩﻩ ﻭ ﻱ‬
‫ﻣﻲﺩﻫﺪ‪.‬‬
‫‪ decoding‬ﺑﺎ ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﺷﻴﻮﻩ ﺩﻛﺪﮔﺬﺍﺭﻱ ﺣﺴﺎﺑﻲ ﺭﺍ ﺍﻧﺠﺎﻡ ‌‬

‫ﻣﺜﺎﻝ‪:‬‬

‫ﻣﻲﺧﻮﺍﻫﻴﻢ‬
‫ﻓﺮﺽ ﻛﻨﻴﺪ ﺩﺭ ﻳﻚ ﺯﺑﺎﻥ ﻛﻪ ﺩﺍﺭﺍﻱ ﺣﺮﻭﻑ }‪ {space,a,d,e,fg,h.i.j,m,o,s,yz,1,2‬ﺍﺳﺖ ‌‬
‫ﻋﺒﺎﺭﺕ" ‪ "ayah saya‬ﺭﺍ ﺑﺎ ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﺳﺮﻭﻳﺲ ‪ SMS‬ﺍﺭﺳﺎﻝ ﻛﻨﻴﻢ‪ .‬ﻭ ﻫﻤﻴﻨﻄﻮﺭ ﻓﺮﺽ ﻛﻨﻴﺪ ﻛﻪ ﺟﺪﻭﻝ ﺩﺍﻣﻨﻪ‬

‫‪4‬‬
‫ﺍﺣﺘﻤﺎﻻﺕ )ﻓﺮﻛﺎﻧﺲ ﻛﺎﺭﺍﻛﺘﺮﻫﺎ( ﻧﻤﻮﻧﻪ ﺑﺮﺩﺍﺭﻱ ﺷﺪﻩ ﺑﺮﺍﻱ ‪ 16‬ﻛﺎﺭﺍﻛﺘﺮ ﻓﻮﻕ ﺩﺭ ‪ 10000‬ﻛﺎﺭﺍﻛﺘﺮ ﻛﻪ ﺩﺭ ﺳﺮﻭﻳﺲ‬
‫‪ SMS‬ﺑﻪ ﻛﺎﺭ ﺭﻓﺘﻪ ﺍﺳﺖ ﺑﻪ ﺻﻮﺭﺕ ﺯﻳﺮ ﺍﺳﺖ‪:‬‬

‫ﻣﻲﺷﻮﺩ‪:‬‬
‫ﺑﺎ ﻓﺮﺽ ‪ n=4‬ﺟﺪﻭﻝ ﻓﻮﻕ ﺑﻪ ﭼﻬﺎﺭ ﺯﻳﺮ ﺟﺪﻭﻝ ﺯﻳﺮ ﺗﻘﺴﻴﻢ ‌‬

‫ﺯﻳﺮﺟﺪﻭﻝﻫﺎﻱ ﺳﻤﺖ ﭼﭙﻲ ﺷﺎﻣﻞ ﻛﺎﺭﺍﻛﺘﺮﻫﺎﻱ ﺑﻪ ﻛﺎﺭ ﺭﻓﺘﻪ ﺩﺭ ﻋﺒﺎﺭﺕ ”‪"ayah saya‬‬
‫‌‬ ‫ﻣﻲﺗﻮﺍﻥ ﺩﻳﺪ ﻛﻪ‬
‫ﺑﻪ ﻭﺿﻮﺡ ‌‬
‫ﺍﺳﺖ‪ .‬ﺍﺯ ﮐﻨﺎﺭ ﻫﻢ ﻗﺮﺍﺭ ﺩﺍﺩﻥ ﺍﻳﻦ ﺩﻭ ﺯﻳﺮ ﺟﺪﻭﻝ ﺟﺪﻭﻝ ﺩﺍﻣﻨﻪ ﺍﺻﻠﯽ ﺍﺣﺘﻤﺎﻻﺕ ﺑﻪ ﺻﻮﺭﺕ ﺯﻳﺮ ﺑﻪ ﺩﺳﺖ‬
‫ﻣﯽﺁﻳﺪ‪:‬‬
‫‌‬

‫‪5‬‬
‫ﻣﯽﺷﻮﺩ ﮐﻪ ﭼﻮﻥ ﺍﺯ ﻳﮏ ﺟﺪﻭﻝ ﺍﺣﺘﻤﺎﻻﺕ ﺑﺎ ﺗﻌﺪﺍﺩ ﮐﺎﺭﺍﮐﺘﺮ ﮐﻤﺘﺮی ﺍﺳﺘﻔﺎﺩﻩ ﺷﺪﻩ ﭘﺲ ﻓﺸﺮﺩﻩ ﺳﺎﺯی ﺩﺭ‬‫ﻣﻼﺣﻈﻪ ‌‬
‫ﺍﻳﻦ ﺣﺎﻟﺖ ﻧﺴﺒﺖ ﺑﻪ ﻓﺸﺮﺩﻩ ﺳﺎﺯی ﻣﻌﻤﻮﻟﯽ ﻣﺘﻦ ﻫﻤﺮﺍﻩ ﺑﺎ ‪ header‬ﺩﺍﺭﺍی ﺳﺎﻳﺰ ﮐﻮﭼﮑﺘﺮی ﺍﺳﺖ ﻭ ﺍﺯ ﺍﻳﻦ‬
‫ﻣﯽﺷﻮﺩ ﭘﺲ ﮐﺎﺭﺍﮐﺘﺮﻫﺎی‬ ‫ﻟﺤﺎﻅ ﺩﺍﺭﺍی ﻣﺰﻳﺖ ﺍﺳﺖ ﺍﺯ ﻃﺮﻓﯽ ﺩﻳﮕﺮ ﭼﻮﻥ ﺗﻌﺪﺍﺩ ﮐﺎﺭﺍﮐﺘﺮﻫﺎ ﮐﻤﺘﺮ ‌‬
‫ﻣﻔﺮﻭﺽ)ﺟﺪﻭﻝ ﺩﺍﻣﻨﻪ ﺍﺻﻠﯽ ﺍﺣﺘﻤﺎﻻﺕ( ﺩﺍﺭﺍی ‪ Range‬ﺑﺰﺭﮔﺘﺮی ﻫﺴﺘﻨﺪ ﻭ ﺍﺯ ﻟﺤﺎﻅ ﺗﻌﺪﺍﺩ ﺑﻴﺖ ﺍﻧﺘﺨﺎﺑﯽ‪،‬‬
‫ﺑﺮﺍی ﮐﺪ ﻣﺘﻨﺎﻇﺮ ﺑﺎ ﻭﺭﻭﺩی ﺩﺍﺭﺍی ﮐﺎﺭﺍﻳﯽ ﺑﻬﺘﺮی ﺍﺳﺖ‪.‬‬

‫‪6‬‬
 ‫ﻧﺘﺎﻳﺞ‪:‬‬

‫ﺯﻳﺮﺟﺪﻭﻝﻫﺎ ﺗﻌﺪﺍﺩ ﻓﺮﻛﺎﻧﺲ ﺩﺍﺩﻩ ﻫﺎﻳﻲ ﻛﻪ ﻻﺯﻡ ﻧﻴﺴﺘﻨﺪ ﻛﻤﺘﺮ‬

‫‌‬ ‫ﻣﻲﺷﻮﺩ ﻛﻪ ﺑﺎ ﺍﻓﺰﺍﻳﺶ ﺗﻌﺪﺍﺩ‬
‫ﺩﺭ ﺭﻭﺵ ‪ ACHA‬ﻣﺸﺎﻫﺪﻩ ‌‬
‫ﺯﻳﺮﺟﺪﻭﻝﻫﺎ ﺗﻌﺪﺍﺩ ﻛﺎﺭﺍﻛﺘﺮﻫﺎﻱ‬
‫‌‬ ‫ﻣﻲﺁﻳﺪ‪.‬ﺍﺯ ﻃﺮﻓﻲ ﺩﻳﮕﺮ ﺑﺎ ﺍﻓﺰﺍﻳﺶ ﺗﻌﺪﺍﺩ‬
‫ﻣﻲﺷﻮﺩ ﭘﺲ ﻳﻚ ﻓﺸﺮﺩﻩ ﺳﺎﺯﻱ ﺑﻬﺘﺮﻱ ‌ﺑﻪﺩﺳﺖ ‌‬
‫‌‬

‫‪7‬‬
‫ﺟﺪﻭﻝﻫﺎ ﻛﻪ ﻫﻦﻭﺯ ﻳﻚ ﻣﻮﺿﻮﻉ ﺣﻞ‌ﻧﺸﺪﻩ ﺑﺎﻗﻲ ﻣﺎﻧﺪﻩ ﺍﺳﺖ‬
‫‌‬ ‫ﻣﻲﻳﺎﺑﺪ ﺍﺯ ﺍﻳﻦ ﺭﻭ ﺗﻌﻴﻴﻦ ﺗﻌﺪﺍﺩ ﺯﻳﺮ‬
‫ﭘﻴﻜﺮﺑﻨﺪﻱ ﻧﻴﺰ ﺍﻓﺰﺍﻳﺶ ‌‬
‫ﻳﻚ ﻣﻮﺿﻮﻉ ﺍﺳﺎﺳﻲ ﺍﺳﺖ‪.‬‬

‫ﻛﺎﺭﺍﻳﻲ ﺍﻟﮕﻮﺭﻳﺘﻢ ‪ ACHA‬ﺑﺮ ﺭﻭﻱ ‪ 150‬ﺗﺎ ‪ SMS‬ﺩﺭ ﺯﺑﺎﻥ ﺍﻧﺪﻭﻧﺰﻳﺎﻳﻲ ﺗﺴﺖ ﺷﺪﻩ ﺍﺳﺖ ﻛﻪ ﻧﺴﺒﺖ ﻓﺸﺮﺩﻩ ﺳﺎﺯﻱ‬
‫ﻣﻲﺷﻮﺩ ﺗﻨﻬﺎ ‪ 6%‬ﺑﺎ‬
‫ﻫﻤﺎﻥﻃﻮﺭ ﻛﻪ ﺩﺭ ﺷﻜﻞ ﺯﻳﺮ ﻣﺸﺎﻫﺪﻩ ‌‬
‫‌‬ ‫ﺑﺮﺍﻱ ﺍﻟﮕﻮﺭﻳﺘﻢ ‪ ACHA‬ﺑﻪ ﻃﻮﺭ ﻣﺘﻮﺳﻂ ﺑﺮﺍﺑﺮ ﺑﺎ ‪ 71%‬ﺍﺳﺖ ﻭ‬
‫ﺭﻭﺵ ﻣﻌﻤﻮﻟﻲ ﻓﺸﺮﺩﻩ ﺳﺎﺯﻱ ﺣﺎﺻﻞ ﺍﺯ ﻛﺪﮔﺬﺍﺭﻱ ﺣﺴﺎﺑﻲ)ﺑﺪﻭﻥ ﻓﺸﺮﺩﻩ ﻛﺮﺩﻥ‪ (header‬ﺗﻔﺎﻭﺕ ﺩﺍﺭﺩ‪.‬‬

‫‪8‬‬
 ‫ﺑﺎﺯﻩﻫﺎﻱ ﺗﻨﻈﻴﻢ ﺷﻮﻧﺪﻩ‬
‫ﻛﺪﮔﺬﺍﺭﻱ ﺻﺤﻴﺢ ﺣﺴﺎﺑﻲ ﺍﻣﻦ ﺑﺎ ﺍﻧﺪﺍﺯﻩ ‌‬

‫ﺩﺭ ﺍﻳﻦ ﻗﺴﻤﺖ ﻳﻚ ﺭﻭﺵ ﺟﺪﻳﺪ ﺑﺎ ﻋﻨﻮﺍﻥ ‪Secure Arithmetic Coding With Adjustable‬‬
‫‪ (SIAC) Interval‬ﻣﻌﺮﻓﻲ ﻣﻲ‌ﺷﻮﺩ ﻛﻪ ﻗﺎﺩﺭ ﺑﻪ ﻓﺸﺮﺩﻩ ﺳﺎﺯﻱ ﻭ ﺭﻣﺰﮔﺬﺍﺭﻱ ﻫﻤﺰﻣﺎﻥ ﺍﺳﺖ‪ .‬ﺍﻳﻦ ﺭﻭﺵ ﻣﺘﻔﺎﻭﺕ ﺍﺯ‬
‫ﺑﺎﺯﻩﻫﺎ ﻭ ﻛﺪﮔﺬﺍﺭﻱ ﺍﻣﻦ‬
‫ﺭﻭﺵﻫﺎﻱ ﻣﻮﺟﻮﺩ ﻣﺎﻧﻨﺪ ﻛﺪﮔﺬﺍﺭﻱ ﺗﺼﺎﺩﻓﻲ ﺣﺴﺎﺑﻲ‪،‬ﻛﺪﮔﺬﺍﺭﻱ ﺣﺴﺎﺑﻲ ﺑﺎ ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﺗﺠﺰﻳﻪ ‌‬
‫‌‬
‫ﻣﻲﺷﻮﺩ ﻛﻪ ﻛﺎﺭﺍﻳﻲ ﻓﺸﺮﺩﻩ ﺳﺎﺯﻱ ﺍﻳﻦ‬
‫ﻣﻲﺩﻫﻴﻢ ﻛﻪ ﺭﻭﺵ ‪ SIAC‬ﺩﺍﺭﺍﻱ ﺍﻣﻨﻴﺖ ﺑﺎﻻﺳﺖ ﻭ ﻫﻤﭽﻨﻴﻦ ﻧﺸﺎﻥ ﺩﺍﺩﻩ ‌‬
‫ﺍﺳﺖ‪ .‬ﻧﺸﺎﻥ ‌‬
‫ﻗﺮﻳﺒﺎ ﺑﺮﺍﺑﺮ ﺍﺳﺖ ﺑﺎ ﻛﺎﺭﺍﻳﻲ ﻓﺸﺮﺩﻩ ﺳﺎﺯﻱ)‪ Traditional Integer Arithmetic Code (TIAC‬ﺍﺳﺖ‪.‬‬
‫ﻛﺪ ﺕ‬

‫ﻛﺪﮔﺬﺍﺭﻱ ﺣﺴﺎﺑﻲ ﺻﺤﻴﺢ‪:‬‬

‫ﺩﺍﺩﻩ ﺷﺪﻩ ﺍﺳﺖ‪ .‬ﻛﻪ ﺩﺭ ﺁﻥ ﻫﺮ ﺳﻤﺒﻞ ﺍﺯ ﻣﺠﻤﻮﻋﻪ ﺣﺮﻭﻑ ﺍﻟﻔﺒﺎﻳﻲ ‪ ASKII‬ﺑﺎ‬ ‫ﻓﺮﺽ ﻛﻨﻴﺪ ﻣﻨﺒﻊ‬
‫ﻣﻲﺷﻮﻧﺪ‪.‬‬
‫ﺑﺎ ﻳﻚ ﺍﺣﺘﻤﺎﻝ ﻣﺸﺨﺺ ﺑﻪ ﻃﻮﺭ ﻣﺴﺘﻘﻞ ﺗﻮﻟﻴﺪ ‌‬ ‫ﺳﻤﺒﻞﻫﺎﻱ‬
‫‌‬

‫ﺁﻥﮔﺎﻩ ﺍﻳﻦ ﻛﺪ‬

‫ﭘﻴﺎﺩﻩﺳﺎﺯﻱ ‪ float-point‬ﺍﺯ ﭘﻴﺎﺩﻩ ﺳﺎﺯﻱ ﺻﺤﻴﺢ ﺍﺳﺘﻔﺎﺩﻩ ﺷﻮﺩ ‌‬
‫ﺩﺭ ﻛﺪﮔﺬﺍﺭﻱ ﺣﺴﺎﺑﻲ ﺍﮔﺮ ﺑﻪ ﺟﺎﻱ ‌‬

‫ﺑﻪ ﺻﻮﺭﺕ‬ ‫ﻣﻲﮔﻮﻳﻨﺪ‪ .‬ﺩﺭ ﻛﺪﮔﺬﺍﺭﻱ ﺣﺴﺎﺑﻲ ﺑﺎﺯﻩ ﺍﻭﻟﻴﻪ‬

‫ﺣﺴﺎﺑﻲ ﺭﺍ ﻳﻚ ﻛﺪ ﺣﺴﺎﺑﻲ ﺻﺤﻴﺢ ‌‬

‫ﻫﻤﻴﻦﻃﻮﺭ ﺭﻭﺍﺑﻂ ﺯﻳﺮ ﺑﺮﻗﺮﺍﺭﻧﺪ‪:‬‬

‫‌‬ ‫ﻭ ‪ p‬ﺑﺮﺍﺑﺮ ﺑﺎ ﺍﻧﺪﺍﺯﻩ ﺑﻴﺘﻲ ﺑﺎﺯﻩ ﺍﻭﻟﻴﻪ ﺍﺳﺖ‪.‬‬ ‫ﺍﺳﺖ ﻛﻪ ﺩﺭ ﺁﻥ‬

‫ﻣﺠﻤﻮﻉ ﺍﺣﺘﻤﺎﻻﺕ ﺳﻤﺒﻠﻬﺎﻱ ﻗﺒﻠﻲ ﺍﺳﺖ‪.‬‬ ‫ﻛﻪ ﺩﺭ ﺁﻥ 𝑛𝑛𝑥𝑥‪-n ،‬ﺍﻣﻴﻦ ﺳﻤﺒﻠﻲ ﺍﺳﺖ ﻛﻪ ﻛﺪ ﺷﺪﻩ ﻭ‬

‫ﻣﺜﺎﻝ‪:‬‬

‫‪،‬‬

‫‪P(𝛼𝛼3 )=4�15‬‬

‫ﺑﺮﺍﻱ ﻣﻘﺪﺍﺭ ‪ p=6‬ﺩﺍﺭﻳﻢ‪:‬‬

‫‪9‬‬
 ‫‪.‬‬

‫ﺭﻭﺵ ﭘﻴﺸﻨﻬﺎﺩﻱ‪:‬‬

‫ﺍﻧﺪﺍﺯﻩ ﺑﺎﺯﻩ ﻣﻨﺒﻊ ﺑﻌﺪ ﺍﺯ ﻛﺪﮔﺬﺍﺭﻱ ﺳﻤﺒﻞ ‪ 𝑥𝑥𝑛𝑛−1‬ﺑﺎﺷﺪ‪ .‬ﻃﺒﻖ‬ ‫ﻓﺮﺽ ﻛﻨﻴﺪ‬
‫ﺭﺍﺑﻄﻪ )‪ (1‬ﺍﻧﺪﺍﺯﻩ ﺑﺎﺯﻩ ﻣﺘﻨﺎﻇﺮ ﺑﺎ ﺳﻤﺒﻞ 𝑘𝑘𝛼𝛼 ﺑﺮﺍﺑﺮ ﺍﺳﺖ ﺑﺎ‪:‬‬

‫ﻟﺤﻈﻪﺍﻱ ﻭ ﻫﻤﻴﻨﻄﻮﺭ ﺁﻧﺘﺮﻭﭘﻲ ﻣﻨﺒﻊ ﺑﻪ ﺻﻮﺭﺕ ﺯﻳﺮ ﺍﺳﺖ‪:‬‬

‫‌‬ ‫ﺑﻨﺎﺑﺮﺍﻳﻦ ﺁﻧﺘﺮﻭﭘﻲ‬

‫ﻣﻲﻛﻨﻴﻢ‬
‫ﺭﺍ ﻣﻴﻨﻴﻤﻢ ﻛﻨﻴﻢ ﻛﻪ ﺑﺮﺍﻱ ﺍﻳﻦ ﻛﺎﺭ ﺳﻌﻲ ‌‬ ‫ﻣﻲﻛﻨﻴﻢ‬
‫ﺑﺮﺍﻱ ﻣﻴﻨﻴﻤﻢ ﻛﺮﺩﻥ ﺁﻧﺘﺮﻭﭘﻲ ﻣﻨﺒﻊ ﺳﻌﻲ ‌‬
‫𝑛𝑛‪𝐷𝐷 𝛼𝛼 ،‬‬
‫𝐾𝐾‬
‫ﻧﺰﺩﻳﻚ ﻛﻨﻴﻢ‪.‬‬ ‫ﺭﺍ ﺑﻪ ﻃﻮﺭ ﺗﻘﺮﻳﺒﻲ ﺑﻪ ﻣﻘﺪﺍﺭ‬ ‫ﻣﻘﺪﺍﺭ‬
‫𝑛𝑛 𝜆𝜆‬

‫ﺑﺎﺯﻩﻫﺎ‪:‬‬
‫ﻗﺴﻤﺖﺑﻨﺪﻱ ‌‬
‫‌‬ ‫ﺍﻟﮕﻮﺭﻳﺘﻢ‬

‫ﺑﺮﺍﻱ ‪ -n‬ﺍﻣﻴﻦ ﻛﺪﮔﺬﺍﺭﻱ‪:‬‬

‫ﺍﻟﮕﻮﺭﻳﺘﻢ ﻛﺪﮔﺬﺍﺭﻱ ﻭ ﺩﻛﺪﮔﺬﺍﺭﻱ‪:‬‬

‫ﻛﻪ ﺩﺭ ﺁﻥ 𝑛𝑛𝑘𝑘 ﺯﻳﺮﻛﻠﻴﺪ ﺑﺎ ﻃﻮﻝ‬ ‫ﻓﺮﺽ ﻛﻨﻴﺪ ﻛﻪ ﮔﻴﺮﻧﺪﻩ ﻭ ﻓﺮﺳﺘﻨﺪﻩ ﻛﻠﻴﺪ ﻳﻜﺴﺎﻥ‬
‫ﻫﺴﺘﻨﺪ ﺭﺍ ﺩﺭ ﺍﺧﺘﻴﺎﺭ ﺩﺍﺭﻧﺪ‪ .‬ﺩﺭ ﺍﻳﻦ ﺻﻮﺭﺕ ﺍﻟﮕﻮﺭﻳﺘﻢ ﻛﺪﮔﺬﺍﺭﻱ ﺑﻪ ﺻﻮﺭﺕ ﺯﻳﺮ ﺍﺳﺖ‪:‬‬

‫‪10‬‬
‫ﻭ ﺍﻟﮕﻮﺭﻳﺘﻢ ﺩﻛﺪﮔﺬﺍﺭﻱ ﺩﺭﺳﺖ ﺑﺮﻋﻜﺲ ﺍﻟﮕﻮﺭﻳﺘﻢ ﻛﺪﮔﺬﺍﺭﻱ ﺍﺳﺖ‪.‬‬

‫ﻣﺜﺎﻝ‪:‬‬

‫ﺑﺮﺍﻱ 𝑛𝑛𝐷𝐷𝐷𝐷 ﺑﺎ ﻣﻘﺎﺩﻳﺮ ‪ 0‬ﻭ ‪ 1‬ﺩﺍﺭﻳﻢ‪:‬‬

‫‪11‬‬
 ‫ﺁﻧﺎﻟﻴﺰ ﺭﻣﺰ‪:‬‬

‫ﺣﻤﻠﻪ ﺑﺎ ﻣﺘﻦ ﺳﺎﺩﻩ ﺍﻧﺘﺨﺎﺏ ﺷﺪﻩ‪:‬‬

‫ﻣﻲﺩﻫﺪ‪:‬‬
‫ﺣﻤﻠﻪﻛﻨﻨﺪﻩ ﻫﻔﺖ ﻣﺘﻦ ﺳﺎﺩﻩ ﺯﻳﺮ ﺭﺍ ﺑﺎ ﻋﻨﻮﺍﻥ ﻭﺭﻭﺩﻱ ﺑﻪ ﻣﺎﺷﻴﻦ ﻛﺪﮔﺬﺍﺭ ‌‬
‫‌‬ ‫ﺩﺭ ﺍﻳﻦ ﺣﻤﻠﻪ ﻓﺮﺽ ﻛﻨﻴﺪ ﻛﻪ‬

‫ﻣﻲﺁﻭﺭﺩ‪.‬ﺳﭙﺲ ﺣﻤﻠﻪ ﻛﻨﻨﺪﻩ ﺳﻌﻲ‬

‫ﻣﺘﻨﺎﻇﺮ ﺑﺎ ‪ SIAC,TIAC‬ﺭﺍ ﺑﻪ ﺩﺳﺖ ‌‬ ‫ﻭ ﻣﺘﻦ ﺭﻣﺰﻫﺎﻱ‬
‫ﺑﺎﺯﻩﻫﺎﻱ ﺍﻭﻟﻴﻪ‬
‫ﺑﺎﺯﻩﻫﺎﻱ ﺗﻨﻈﻴﻢ ﺷﻮﻧﺪﻩ ﺑﺎ ‌‬
‫ﻣﻲﻛﻨﺪ ﺑﺎﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﺍﻳﻦ ﻣﺘﻦ ﺭﻣﺰﻫﺎ ﻛﻠﻴﺪ ﺭﺍ ﺑﻪ ﺩﺳﺖ ﺁﻭﺭﺩ ﺍﻣﺎ ﺑﻪ ﺩﻟﻴﻞ ﺍﻳﻨﻜﻪ ‌‬
‫‌‬
‫ﺑﺮﺧﻮﺭﺩ ﺩﺍﺭﻧﺪ‪ ،‬ﭘﻴﺪﺍ ﻛﺮﺩﻥ ﻛﻠﻴﺪ ﻣﺸﻜﻞ ﺍﺳﺖ ﻭ ﺍﺯ ﺍﻳﻦ ﺟﻬﺖ ﺍﻟﮕﻮﺭﻳﺘﻢ ﭘﻴﺸﻨﻬﺎﺩﻱ ﺩﺍﺭﺍﻱ ﺍﻣﻨﻴﺖ ﻗﺎﺑﻞ ﻗﺒﻮﻝ ﺍﺳﺖ‪.‬‬

‫ﻛﺎﺭﺍﻳﻲ ﻓﺸﺮﺩﻩ ﺳﺎﺯﻱ‪:‬‬

‫ﺟﺪﻭﻝ ﺯﻳﺮﺍﻧﺪﺍﺯﻩ ﻓﺎﻳﻞ ﻓﺸﺮﺩﻩ ﺑﺮ ﺣﺴﺐ ﺑﺎﻳﺖ ﺑﺮﺍﻱ ﺳﻪ ﺍﻟﮕﻮﺭﻳﺘﻢ ‪ TIAC,MIAC‬ﻭ ﺍﻟﮕﻮﺭﻳﺘﻢ ﭘﻴﺸﻨﻬﺎﺩﻱ ‪ SIAC‬ﺭﺍ‬
‫ﻓﺸﺮﺩﻩﺳﺎﺯﻱ ﺭﻭﺵ ﭘﻴﺸﻨﻬﺎﺩﻱ ‪ SIAC‬ﺑﺮﺍﺑﺮ ﻳﺎ ﺑﻬﺘﺮ ﺍﺯ ﻛﺎﺭﺍﻳﻲ ﺍﻟﮕﻮﺭﻳﺘﻢ‬
‫‌‬ ‫ﻣﻲﺷﻮﺩ ﻛﻪ ﻛﺎﺭﺍﻳﻲ‬
‫ﻣﻲﺩﻫﺪ‪ .‬ﻣﻼﺣﻈﻪ ‌‬
‫ﻧﺸﺎﻥ ‌‬
‫‪ TIAC‬ﺍﺳﺖ‪.‬‬

‫‪12‬‬
13
 ‫ﻣﺮﺍﺟﻊ‬

[1]Ario Yudo Husodo, Rinaldi Munir, “Arithmetic Coding Modification to Compress SMS
”,2011 International Conference on Electrical Engineering and Informatics
17-19 July 2011, Bandung, Indonesia.

[2]Jyun-Ying Huang and Yin-Chen Liang , “ Secure Integer Arithmetic Coding with Adjustable
Interval Size”, The 19th Asia Pacific Conference on Communications 2013.

[3]Jiangtao Wen, Hyungjin Kim, John Villasenor, “Binary arithmetic coding with key-based
interval splitting”, IEEE Signal Processing Letters, Vol. 13, No. 2, Feb. 2006.

[4]Jiangtao Wen, Hyungjin Kim, John Villasenor, “Secure arithmetic coding using interval
splitting”, Proc. 39th Asilomar Conf. On Signals, Systems and Computers, Asilomar, CA, Nov.
2005.

14

View publication stats