Computational complexity and implementation aspects of the incremental hash function
This paper gives the computational complexity and practical implementation aspects of a newly introduced incremental hash function called pair chaining & modular arithmetic combining incremental hash function (PCIHF). The boundary conditions of the parameters involved in the update process of PC...
Saved in:
Published in | IEEE transactions on consumer electronics Vol. 49; no. 4; pp. 1249 - 1255 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
New York
IEEE
01.11.2003
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | This paper gives the computational complexity and practical implementation aspects of a newly introduced incremental hash function called pair chaining & modular arithmetic combining incremental hash function (PCIHF). The boundary conditions of the parameters involved in the update process of PCIHF are examined in depth. It is proved that these basic requirements can be fulfilled easily. It is shown that in applications involving more than one update process if the number of blocks to be replaced is no more than 1/4 of the message blocks needed, the PCIHF is more efficient than standard SHA-1. Finally, it is observed that the computational complexity of combining operation is also important to ensure the practicability of PCIHF. |
---|---|
AbstractList | This paper gives the computational complexity and practical implementation aspects of a newly introduced incremental hash function called pair chaining & modular arithmetic combining incremental hash function (PCIHF). The boundary conditions of the parameters involved in the update process of PCIHF are examined in depth. It is proved that these basic requirements can be fulfilled easily. It is shown that in applications involving more than one update process if the number of blocks to be replaced is no more than 1/4 of the message blocks needed, the PCIHF is more efficient than standard SHA-1. Finally, it is observed that the computational complexity of combining operation is also important to ensure the practicability of PCIHF. |
Author | Hean-Teik Chuah Bok-Min Goi Siddiqi, M.U. |
Author_xml | – sequence: 1 surname: Bok-Min Goi fullname: Bok-Min Goi organization: Fac. of Eng., Multimedia Univ., Malaysia – sequence: 2 givenname: M.U. surname: Siddiqi fullname: Siddiqi, M.U. organization: Fac. of Eng., Multimedia Univ., Malaysia – sequence: 3 surname: Hean-Teik Chuah fullname: Hean-Teik Chuah organization: Fac. of Eng., Multimedia Univ., Malaysia |
BookMark | eNp9kb1rwzAQxUVJoUnavdBFdGgnp3eSrUhjMekHBLqks5AViTj4q5YNzX9fGwcKHTodj_d7x3FvQWZVXTlCbhFWiKCedulmxQD4CplAxsQFmWOSyChGtp6ROYCSEQfBr8gihCMAxgmTc7JL67LpO9PldWUKagdVuO-8O1FT7Wk-qtJVk09NaJztAq097Q6O5pVtJ7egBxMO1PeVHcFrculNEdzNeS7J58tml75F24_X9_R5G1meYBcJD5ChUpBJa9eJsWsPau84Hy7LpNobYz3PBMZeIXInuLeCqViCtA4TzvmSPE57m7b-6l3odJkH64rCVK7ug1aAYh0zLgby4V-SSYYqRhjA-z_gse7b4TVBSxlzFjPBBggmyLZ1CK3zumnz0rQnjaDHNvTQhh7b0Oc2hsjdFMmdc7_42f0BKruHew |
CODEN | ITCEDA |
CitedBy_id | crossref_primary_10_1109_TKDE_2019_2943557 crossref_primary_10_1109_ACCESS_2020_2991328 crossref_primary_10_1016_j_cose_2005_12_006 |
Cites_doi | 10.1145/258533.258638 10.1007/BF01185212 10.1007/3-540-44750-4_2 10.1145/225058.225080 10.1109/SFCS.1997.646132 10.1007/s001459900012 10.1007/3-540-45311-3_5 |
ContentType | Journal Article |
Copyright | Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2003 |
Copyright_xml | – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2003 |
DBID | RIA RIE AAYXX CITATION 7SP 8FD F28 FR3 L7M |
DOI | 10.1109/TCE.2003.1261226 |
DatabaseName | IEEE All-Society Periodicals Package (ASPP) 1998–Present IEL CrossRef Electronics & Communications Abstracts Technology Research Database ANTE: Abstracts in New Technology & Engineering Engineering Research Database Advanced Technologies Database with Aerospace |
DatabaseTitle | CrossRef Engineering Research Database Technology Research Database Advanced Technologies Database with Aerospace ANTE: Abstracts in New Technology & Engineering Electronics & Communications Abstracts |
DatabaseTitleList | Engineering Research Database Engineering Research Database |
Database_xml | – sequence: 1 dbid: RIE name: IEEE/IET Electronic Library url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/ sourceTypes: Publisher |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Engineering |
EISSN | 1558-4127 |
EndPage | 1255 |
ExternalDocumentID | 2429643091 10_1109_TCE_2003_1261226 1261226 |
GroupedDBID | -~X .DC 0R~ 29I 4.4 5GY 5VS 6IK 97E AAJGR AASAJ ABJNI ABQJQ ABVLG ACGFO ACIWK ACKIV ACNCT AENEX AETIX AI. AIBXA AKJIK ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 EBS EJD HZ~ H~9 IBMZZ ICLAB IFIPE IFJZH IPLJI JAVBF LAI MS~ O9- OCL P2P RIA RIE RIG RNS TAE TN5 VH1 XFK AAYXX CITATION 7SP 8FD F28 FR3 L7M |
ID | FETCH-LOGICAL-c351t-6f00b1990b8cc75ac7f09de33528b89daacf3b614f9113e63fc6294808ce15333 |
IEDL.DBID | RIE |
ISSN | 0098-3063 |
IngestDate | Fri Aug 16 21:51:56 EDT 2024 Fri Aug 16 04:31:44 EDT 2024 Thu Oct 10 19:25:50 EDT 2024 Fri Aug 23 02:21:58 EDT 2024 Wed Jun 26 19:28:54 EDT 2024 |
IsPeerReviewed | true |
IsScholarly | true |
Issue | 4 |
Language | English |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-c351t-6f00b1990b8cc75ac7f09de33528b89daacf3b614f9113e63fc6294808ce15333 |
Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
PQID | 884324262 |
PQPubID | 23500 |
PageCount | 7 |
ParticipantIDs | proquest_miscellaneous_28219410 ieee_primary_1261226 proquest_journals_884324262 crossref_primary_10_1109_TCE_2003_1261226 proquest_miscellaneous_901674236 |
PublicationCentury | 2000 |
PublicationDate | 2003-11-01 |
PublicationDateYYYYMMDD | 2003-11-01 |
PublicationDate_xml | – month: 11 year: 2003 text: 2003-11-01 day: 01 |
PublicationDecade | 2000 |
PublicationPlace | New York |
PublicationPlace_xml | – name: New York |
PublicationTitle | IEEE transactions on consumer electronics |
PublicationTitleAbbrev | T-CE |
PublicationYear | 2003 |
Publisher | IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Publisher_xml | – name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
References | ref13 goi (ref10) 2001; 2247 wagner (ref12) 2002; 2442 fischlin (ref7) 1997; 1233 bellare (ref4) 1995; 963 bellare (ref5) 1997; 1233 ref8 menezes (ref1) 1997 ref9 (ref11) 1995 ref3 ref6 bellare (ref2) 1994; 839 |
References_xml | – ident: ref6 doi: 10.1145/258533.258638 – volume: 1233 start-page: 393 year: 1997 ident: ref7 article-title: Incremental cryptography and memory checkers publication-title: Advances in Cryptology EUROCRYPT'97 Proceedings contributor: fullname: fischlin – ident: ref9 doi: 10.1007/BF01185212 – volume: 963 start-page: 15 year: 1995 ident: ref4 article-title: XOR MACs: New methods for message authentication using finite pseudorandom functions publication-title: Advances in Cryptology - CRYPTO'95 doi: 10.1007/3-540-44750-4_2 contributor: fullname: bellare – volume: 2442 start-page: 288 year: 2002 ident: ref12 article-title: A generalized birthday problem publication-title: Advances in Cryptology - CRYPTO'02 contributor: fullname: wagner – year: 1995 ident: ref11 publication-title: NIST FIPS Publication 180-1 Secure Hash Standard – volume: 1233 start-page: 163 year: 1997 ident: ref5 article-title: A new paradigm for collision-free hashing: Incrementality at reduced cost publication-title: Advances in Cryptology EUROCRYPT'97 Proceedings contributor: fullname: bellare – year: 1997 ident: ref1 publication-title: Handbook of Applied Cryptography contributor: fullname: menezes – ident: ref3 doi: 10.1145/225058.225080 – ident: ref8 doi: 10.1109/SFCS.1997.646132 – ident: ref13 doi: 10.1007/s001459900012 – volume: 2247 start-page: 50 year: 2001 ident: ref10 article-title: Incremental hash function based on pair chaining & modular arithmetic combining publication-title: Progress in Cryptology - INDOCRYPT 2001 doi: 10.1007/3-540-45311-3_5 contributor: fullname: goi – volume: 839 start-page: 216 year: 1994 ident: ref2 article-title: Incremetnal cryptography: The case of hashing and signing publication-title: Advances in Cryptology Crypto86 contributor: fullname: bellare |
SSID | ssj0014528 |
Score | 1.7597545 |
Snippet | This paper gives the computational complexity and practical implementation aspects of a newly introduced incremental hash function called pair chaining &... |
SourceID | proquest crossref ieee |
SourceType | Aggregation Database Publisher |
StartPage | 1249 |
SubjectTerms | Arithmetic Boundary conditions Complexity Computation Computational complexity Cryptography Electronic mail Electronics Hash based algorithms Immune system Mathematical analysis Mathematical models Message authentication Messages Power engineering and energy Smart cards Writing |
Title | Computational complexity and implementation aspects of the incremental hash function |
URI | https://ieeexplore.ieee.org/document/1261226 https://www.proquest.com/docview/884324262 https://search.proquest.com/docview/28219410 https://search.proquest.com/docview/901674236 |
Volume | 49 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1JS8QwFH6MnvTgLo7jkoMXwY5pkmaSo4giwngawVtJ0wRF7IgzA-Kv9yVtxx28hSahIdv78pbvARx5XgzooEwTw6VKhBFYyniGJZ5KircyjXnIhjfy6lZc32V3HTiZx8I456LzmeuHYrTll2M7C6qy0zTwXTG5AAuKsjpWa24xEBlTLT8mwmDemiSpPh2dX0Tiz37T_4sIijlVflzEUbpcrsKwHVftVPLYn02Lvn37Rtn434GvwUoDM8lZvS_WoeOqDVj-RD64CaM6oUOjDCTRt9y9IignpirJw1PrWB7qiYkRmRMy9gQRI3mobK1XxI73ZnJPgngMDbfg9vJidH6VNDkWEsuzdJpIT2mRokgqlLWDzNiBp7p0IRJLFUqXxlhcTpThHm9F7iT3VjItFFXWBajIt2GxGlduBwgiRes9vra14oLassi0EEYbz1gZglC6cNxOe_5cU2nk8QlCdY5LFBJi8ryZqS5shln8aNd-7rXrlDdnbZIrFVgFmWRdOJzX4iEJlg9TufFskuO7MtUipV0gf7TQMRyDcbn7-597sFS78QXlyx4sTl9mbh_hyLQ4iPvwHeJf3Hs |
link.rule.ids | 315,786,790,802,27955,27956,55107 |
linkProvider | IEEE |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3Nb9MwFH8a5QA7bEBBKxvUBy5IpHNix7GPU9WqQNtTK_UWOY6tVhMpoq007a_n2UkKjCFxs2Insfz1fn4fvwfwwbEio1kZR5oJGXHNsZSyFEssFhRPZRrykM3mYrLkX1bp6gQ-HWNhrLXB-cwOfDHY8sutOXhV2XXs-a4S8QSeopynWR2tdbQZ8DSRLUMmAmHWGiWpul4MR4H6c9B84Q8hFLKq_HUUB_kyPodZ27PareR2cNgXA3P_gLTxf7v-As4aoElu6pXxEk5s9QpOf6Mf7MKiTunQqANJ8C63dwjLia5KsvnWupb7eqJDTOaObB1BzEg2lak1i_jiWu_WxAtI3_A1LMejxXASNVkWIsPSeB8JR2kRo1AqpDFZqk3mqCqtj8WShVSl1gYnFKW4w3ORWcGcEYnikkpjPVhkb6BTbSt7AQSxonEO79tKMk5NWaSKc620S5LSh6H04GM77Pn3mkwjD5cQqnKcIp8Sk-XNSPWg60fxV7v28WU7T3mz23a5lJ5XMBFJD_rHWtwm3vahK7s97HK8WcaKx7QH5B8tVAjISJh4-_if-_BssphN8-nn-ddLeF479XlVzBV09j8O9h2Ck33xPqzJn6aY388 |
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%3Ajournal&rft.genre=article&rft.atitle=Computational+complexity+and+implementation+aspects+of+the+incremental+hash+function&rft.jtitle=IEEE+transactions+on+consumer+electronics&rft.au=Goi%2C+Bok-Min&rft.au=Siddiqi%2C+M+U&rft.au=Chuah%2C+Hean-Teik&rft.date=2003-11-01&rft.issn=0098-3063&rft.volume=49&rft.issue=4&rft.spage=1249&rft.epage=1255&rft_id=info:doi/10.1109%2FTCE.2003.1261226&rft.externalDBID=NO_FULL_TEXT |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0098-3063&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0098-3063&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0098-3063&client=summon |