• DocumentCode
    2607195
  • Title

    Mathematical optimization of decrypting algorithm for soft input decryption

  • Author

    Zivic, Natasa ; Kadusic, Esad ; Skrbic, Mirko

  • Author_Institution
    Inst. for Data Commun. Syst., Univ. of Siegen, Siegen, Germany
  • fYear
    2009
  • fDate
    29-31 Oct. 2009
  • Firstpage
    1
  • Lastpage
    4
  • Abstract
    In this work, the strategy for correction of bits using Soft Input Decryption is analyzed. Soft Input Decryption is used for correction of cryptographic check values, which are very fragile when they are transmitted over noisy channels: only one wrong bit at input of the decryptor causes about 50% of errors at output of the decryptor. Soft Input Decryption corrects incorrect bits of cryptographic check values in most of cases using combination of SISO channel decoding and decrypting. Soft Input Decryption is an iterative process and therefore it is needed to minimize duration of iterations. This paper suggests an algorithm for optimization of Soft Input Decryption, which enables restriction of needed computing time of the Soft Input Decryption algorithm. Suggested optimization is performed for ECDSA digital signatures.
  • Keywords
    channel coding; cryptography; decoding; digital signatures; iterative methods; mathematical analysis; minimisation; ECDSA digital signature; cryptographic check value; iterative process; mathematical optimization; noisy channel; soft input decryption; soft input soft output channel decoding; Channel coding; Concatenated codes; Cryptography; Data communication; Digital control; Digital signatures; Error correction; Iterative algorithms; Iterative decoding; Telecommunications; L-values; SID block; Soft Input Decryption; control matrix; digital signatures; optimization; verification;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information, Communication and Automation Technologies, 2009. ICAT 2009. XXII International Symposium on
  • Conference_Location
    Bosnia
  • Print_ISBN
    978-1-4244-4220-1
  • Electronic_ISBN
    978-1-4244-4221-8
  • Type

    conf

  • DOI
    10.1109/ICAT.2009.5348411
  • Filename
    5348411