MUTUAL LEARNING IN TREE PARITY MACHINES USING CUCKOO SEARCH ALGORITHM FOR SECURE PUBLIC KEY EXCHANGE
In Neural Cryptography, Artificial Neural Networks are used for the process of key generation and encryption. Tree Parity Machine (TPM) is a single layer neural network that approaches symmetric key exchange using the process of mutual learning. This method is exploited to design a secure key exchan...
Ausführliche Beschreibung
Autor*in: |
Shikha Gupta [verfasserIn] Nalin Nanda [verfasserIn] Naman Chhikara [verfasserIn] Nishi Gupta [verfasserIn] Satbir Jain [verfasserIn] |
---|
Format: |
E-Artikel |
---|---|
Sprache: |
Englisch |
Erschienen: |
2018 |
---|
Schlagwörter: |
---|
Übergeordnetes Werk: |
In: ICTACT Journal on Soft Computing - ICT Academy of Tamil Nadu, 2014, 8(2018), 3, Seite 1663-1667 |
---|---|
Übergeordnetes Werk: |
volume:8 ; year:2018 ; number:3 ; pages:1663-1667 |
Links: |
Link aufrufen |
---|
DOI / URN: |
10.21917/ijsc.2018.0231 |
---|
Katalog-ID: |
DOAJ006097200 |
---|
LEADER | 01000caa a22002652 4500 | ||
---|---|---|---|
001 | DOAJ006097200 | ||
003 | DE-627 | ||
005 | 20230309195557.0 | ||
007 | cr uuu---uuuuu | ||
008 | 230225s2018 xx |||||o 00| ||eng c | ||
024 | 7 | |a 10.21917/ijsc.2018.0231 |2 doi | |
035 | |a (DE-627)DOAJ006097200 | ||
035 | |a (DE-599)DOAJdeb4da366c044b44a7883e69d5d25c2d | ||
040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
041 | |a eng | ||
050 | 0 | |a TK7885-7895 | |
100 | 0 | |a Shikha Gupta |e verfasserin |4 aut | |
245 | 1 | 0 | |a MUTUAL LEARNING IN TREE PARITY MACHINES USING CUCKOO SEARCH ALGORITHM FOR SECURE PUBLIC KEY EXCHANGE |
264 | 1 | |c 2018 | |
336 | |a Text |b txt |2 rdacontent | ||
337 | |a Computermedien |b c |2 rdamedia | ||
338 | |a Online-Ressource |b cr |2 rdacarrier | ||
520 | |a In Neural Cryptography, Artificial Neural Networks are used for the process of key generation and encryption. Tree Parity Machine (TPM) is a single layer neural network that approaches symmetric key exchange using the process of mutual learning. This method is exploited to design a secure key exchange protocol, where the sender and the receiver TPMs are synchronized to obtain an identically tuned weight vectors in both the networks. The synchronized TPMs are then capable of generating a key stream. The time required for synchronization depends on the initial weight vectors which are randomly initialized. In the proposed method, the process of synchronization is expedited using Cuckoo Search (CS) Algorithm used for the generation of optimal weights. | ||
650 | 4 | |a Neural Synchronisation | |
650 | 4 | |a Tree Parity Machine | |
650 | 4 | |a Cuckoo Search Algorithm | |
650 | 4 | |a Key Exchange | |
650 | 4 | |a Security | |
653 | 0 | |a Computer engineering. Computer hardware | |
700 | 0 | |a Nalin Nanda |e verfasserin |4 aut | |
700 | 0 | |a Naman Chhikara |e verfasserin |4 aut | |
700 | 0 | |a Nishi Gupta |e verfasserin |4 aut | |
700 | 0 | |a Satbir Jain |e verfasserin |4 aut | |
773 | 0 | 8 | |i In |t ICTACT Journal on Soft Computing |d ICT Academy of Tamil Nadu, 2014 |g 8(2018), 3, Seite 1663-1667 |w (DE-627)802535402 |w (DE-600)2798317-1 |x 22296956 |7 nnns |
773 | 1 | 8 | |g volume:8 |g year:2018 |g number:3 |g pages:1663-1667 |
856 | 4 | 0 | |u https://doi.org/10.21917/ijsc.2018.0231 |z kostenfrei |
856 | 4 | 0 | |u https://doaj.org/article/deb4da366c044b44a7883e69d5d25c2d |z kostenfrei |
856 | 4 | 0 | |u http://ictactjournals.in/ArticleDetails.aspx?id=3427 |z kostenfrei |
856 | 4 | 2 | |u https://doaj.org/toc/0976-6561 |y Journal toc |z kostenfrei |
856 | 4 | 2 | |u https://doaj.org/toc/2229-6956 |y Journal toc |z kostenfrei |
912 | |a GBV_USEFLAG_A | ||
912 | |a SYSFLAG_A | ||
912 | |a GBV_DOAJ | ||
912 | |a GBV_ILN_11 | ||
912 | |a GBV_ILN_20 | ||
912 | |a GBV_ILN_22 | ||
912 | |a GBV_ILN_23 | ||
912 | |a GBV_ILN_24 | ||
912 | |a GBV_ILN_39 | ||
912 | |a GBV_ILN_40 | ||
912 | |a GBV_ILN_60 | ||
912 | |a GBV_ILN_62 | ||
912 | |a GBV_ILN_63 | ||
912 | |a GBV_ILN_65 | ||
912 | |a GBV_ILN_69 | ||
912 | |a GBV_ILN_70 | ||
912 | |a GBV_ILN_73 | ||
912 | |a GBV_ILN_95 | ||
912 | |a GBV_ILN_105 | ||
912 | |a GBV_ILN_110 | ||
912 | |a GBV_ILN_151 | ||
912 | |a GBV_ILN_161 | ||
912 | |a GBV_ILN_170 | ||
912 | |a GBV_ILN_213 | ||
912 | |a GBV_ILN_230 | ||
912 | |a GBV_ILN_285 | ||
912 | |a GBV_ILN_293 | ||
912 | |a GBV_ILN_370 | ||
912 | |a GBV_ILN_602 | ||
912 | |a GBV_ILN_2014 | ||
912 | |a GBV_ILN_4012 | ||
912 | |a GBV_ILN_4037 | ||
912 | |a GBV_ILN_4112 | ||
912 | |a GBV_ILN_4125 | ||
912 | |a GBV_ILN_4126 | ||
912 | |a GBV_ILN_4249 | ||
912 | |a GBV_ILN_4305 | ||
912 | |a GBV_ILN_4306 | ||
912 | |a GBV_ILN_4307 | ||
912 | |a GBV_ILN_4313 | ||
912 | |a GBV_ILN_4322 | ||
912 | |a GBV_ILN_4323 | ||
912 | |a GBV_ILN_4324 | ||
912 | |a GBV_ILN_4325 | ||
912 | |a GBV_ILN_4326 | ||
912 | |a GBV_ILN_4335 | ||
912 | |a GBV_ILN_4338 | ||
912 | |a GBV_ILN_4367 | ||
912 | |a GBV_ILN_4700 | ||
951 | |a AR | ||
952 | |d 8 |j 2018 |e 3 |h 1663-1667 |
author_variant |
s g sg n n nn n c nc n g ng s j sj |
---|---|
matchkey_str |
article:22296956:2018----::uulerignreaiyahnssnccosacagrtmo |
hierarchy_sort_str |
2018 |
callnumber-subject-code |
TK |
publishDate |
2018 |
allfields |
10.21917/ijsc.2018.0231 doi (DE-627)DOAJ006097200 (DE-599)DOAJdeb4da366c044b44a7883e69d5d25c2d DE-627 ger DE-627 rakwb eng TK7885-7895 Shikha Gupta verfasserin aut MUTUAL LEARNING IN TREE PARITY MACHINES USING CUCKOO SEARCH ALGORITHM FOR SECURE PUBLIC KEY EXCHANGE 2018 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier In Neural Cryptography, Artificial Neural Networks are used for the process of key generation and encryption. Tree Parity Machine (TPM) is a single layer neural network that approaches symmetric key exchange using the process of mutual learning. This method is exploited to design a secure key exchange protocol, where the sender and the receiver TPMs are synchronized to obtain an identically tuned weight vectors in both the networks. The synchronized TPMs are then capable of generating a key stream. The time required for synchronization depends on the initial weight vectors which are randomly initialized. In the proposed method, the process of synchronization is expedited using Cuckoo Search (CS) Algorithm used for the generation of optimal weights. Neural Synchronisation Tree Parity Machine Cuckoo Search Algorithm Key Exchange Security Computer engineering. Computer hardware Nalin Nanda verfasserin aut Naman Chhikara verfasserin aut Nishi Gupta verfasserin aut Satbir Jain verfasserin aut In ICTACT Journal on Soft Computing ICT Academy of Tamil Nadu, 2014 8(2018), 3, Seite 1663-1667 (DE-627)802535402 (DE-600)2798317-1 22296956 nnns volume:8 year:2018 number:3 pages:1663-1667 https://doi.org/10.21917/ijsc.2018.0231 kostenfrei https://doaj.org/article/deb4da366c044b44a7883e69d5d25c2d kostenfrei http://ictactjournals.in/ArticleDetails.aspx?id=3427 kostenfrei https://doaj.org/toc/0976-6561 Journal toc kostenfrei https://doaj.org/toc/2229-6956 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 8 2018 3 1663-1667 |
spelling |
10.21917/ijsc.2018.0231 doi (DE-627)DOAJ006097200 (DE-599)DOAJdeb4da366c044b44a7883e69d5d25c2d DE-627 ger DE-627 rakwb eng TK7885-7895 Shikha Gupta verfasserin aut MUTUAL LEARNING IN TREE PARITY MACHINES USING CUCKOO SEARCH ALGORITHM FOR SECURE PUBLIC KEY EXCHANGE 2018 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier In Neural Cryptography, Artificial Neural Networks are used for the process of key generation and encryption. Tree Parity Machine (TPM) is a single layer neural network that approaches symmetric key exchange using the process of mutual learning. This method is exploited to design a secure key exchange protocol, where the sender and the receiver TPMs are synchronized to obtain an identically tuned weight vectors in both the networks. The synchronized TPMs are then capable of generating a key stream. The time required for synchronization depends on the initial weight vectors which are randomly initialized. In the proposed method, the process of synchronization is expedited using Cuckoo Search (CS) Algorithm used for the generation of optimal weights. Neural Synchronisation Tree Parity Machine Cuckoo Search Algorithm Key Exchange Security Computer engineering. Computer hardware Nalin Nanda verfasserin aut Naman Chhikara verfasserin aut Nishi Gupta verfasserin aut Satbir Jain verfasserin aut In ICTACT Journal on Soft Computing ICT Academy of Tamil Nadu, 2014 8(2018), 3, Seite 1663-1667 (DE-627)802535402 (DE-600)2798317-1 22296956 nnns volume:8 year:2018 number:3 pages:1663-1667 https://doi.org/10.21917/ijsc.2018.0231 kostenfrei https://doaj.org/article/deb4da366c044b44a7883e69d5d25c2d kostenfrei http://ictactjournals.in/ArticleDetails.aspx?id=3427 kostenfrei https://doaj.org/toc/0976-6561 Journal toc kostenfrei https://doaj.org/toc/2229-6956 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 8 2018 3 1663-1667 |
allfields_unstemmed |
10.21917/ijsc.2018.0231 doi (DE-627)DOAJ006097200 (DE-599)DOAJdeb4da366c044b44a7883e69d5d25c2d DE-627 ger DE-627 rakwb eng TK7885-7895 Shikha Gupta verfasserin aut MUTUAL LEARNING IN TREE PARITY MACHINES USING CUCKOO SEARCH ALGORITHM FOR SECURE PUBLIC KEY EXCHANGE 2018 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier In Neural Cryptography, Artificial Neural Networks are used for the process of key generation and encryption. Tree Parity Machine (TPM) is a single layer neural network that approaches symmetric key exchange using the process of mutual learning. This method is exploited to design a secure key exchange protocol, where the sender and the receiver TPMs are synchronized to obtain an identically tuned weight vectors in both the networks. The synchronized TPMs are then capable of generating a key stream. The time required for synchronization depends on the initial weight vectors which are randomly initialized. In the proposed method, the process of synchronization is expedited using Cuckoo Search (CS) Algorithm used for the generation of optimal weights. Neural Synchronisation Tree Parity Machine Cuckoo Search Algorithm Key Exchange Security Computer engineering. Computer hardware Nalin Nanda verfasserin aut Naman Chhikara verfasserin aut Nishi Gupta verfasserin aut Satbir Jain verfasserin aut In ICTACT Journal on Soft Computing ICT Academy of Tamil Nadu, 2014 8(2018), 3, Seite 1663-1667 (DE-627)802535402 (DE-600)2798317-1 22296956 nnns volume:8 year:2018 number:3 pages:1663-1667 https://doi.org/10.21917/ijsc.2018.0231 kostenfrei https://doaj.org/article/deb4da366c044b44a7883e69d5d25c2d kostenfrei http://ictactjournals.in/ArticleDetails.aspx?id=3427 kostenfrei https://doaj.org/toc/0976-6561 Journal toc kostenfrei https://doaj.org/toc/2229-6956 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 8 2018 3 1663-1667 |
allfieldsGer |
10.21917/ijsc.2018.0231 doi (DE-627)DOAJ006097200 (DE-599)DOAJdeb4da366c044b44a7883e69d5d25c2d DE-627 ger DE-627 rakwb eng TK7885-7895 Shikha Gupta verfasserin aut MUTUAL LEARNING IN TREE PARITY MACHINES USING CUCKOO SEARCH ALGORITHM FOR SECURE PUBLIC KEY EXCHANGE 2018 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier In Neural Cryptography, Artificial Neural Networks are used for the process of key generation and encryption. Tree Parity Machine (TPM) is a single layer neural network that approaches symmetric key exchange using the process of mutual learning. This method is exploited to design a secure key exchange protocol, where the sender and the receiver TPMs are synchronized to obtain an identically tuned weight vectors in both the networks. The synchronized TPMs are then capable of generating a key stream. The time required for synchronization depends on the initial weight vectors which are randomly initialized. In the proposed method, the process of synchronization is expedited using Cuckoo Search (CS) Algorithm used for the generation of optimal weights. Neural Synchronisation Tree Parity Machine Cuckoo Search Algorithm Key Exchange Security Computer engineering. Computer hardware Nalin Nanda verfasserin aut Naman Chhikara verfasserin aut Nishi Gupta verfasserin aut Satbir Jain verfasserin aut In ICTACT Journal on Soft Computing ICT Academy of Tamil Nadu, 2014 8(2018), 3, Seite 1663-1667 (DE-627)802535402 (DE-600)2798317-1 22296956 nnns volume:8 year:2018 number:3 pages:1663-1667 https://doi.org/10.21917/ijsc.2018.0231 kostenfrei https://doaj.org/article/deb4da366c044b44a7883e69d5d25c2d kostenfrei http://ictactjournals.in/ArticleDetails.aspx?id=3427 kostenfrei https://doaj.org/toc/0976-6561 Journal toc kostenfrei https://doaj.org/toc/2229-6956 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 8 2018 3 1663-1667 |
allfieldsSound |
10.21917/ijsc.2018.0231 doi (DE-627)DOAJ006097200 (DE-599)DOAJdeb4da366c044b44a7883e69d5d25c2d DE-627 ger DE-627 rakwb eng TK7885-7895 Shikha Gupta verfasserin aut MUTUAL LEARNING IN TREE PARITY MACHINES USING CUCKOO SEARCH ALGORITHM FOR SECURE PUBLIC KEY EXCHANGE 2018 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier In Neural Cryptography, Artificial Neural Networks are used for the process of key generation and encryption. Tree Parity Machine (TPM) is a single layer neural network that approaches symmetric key exchange using the process of mutual learning. This method is exploited to design a secure key exchange protocol, where the sender and the receiver TPMs are synchronized to obtain an identically tuned weight vectors in both the networks. The synchronized TPMs are then capable of generating a key stream. The time required for synchronization depends on the initial weight vectors which are randomly initialized. In the proposed method, the process of synchronization is expedited using Cuckoo Search (CS) Algorithm used for the generation of optimal weights. Neural Synchronisation Tree Parity Machine Cuckoo Search Algorithm Key Exchange Security Computer engineering. Computer hardware Nalin Nanda verfasserin aut Naman Chhikara verfasserin aut Nishi Gupta verfasserin aut Satbir Jain verfasserin aut In ICTACT Journal on Soft Computing ICT Academy of Tamil Nadu, 2014 8(2018), 3, Seite 1663-1667 (DE-627)802535402 (DE-600)2798317-1 22296956 nnns volume:8 year:2018 number:3 pages:1663-1667 https://doi.org/10.21917/ijsc.2018.0231 kostenfrei https://doaj.org/article/deb4da366c044b44a7883e69d5d25c2d kostenfrei http://ictactjournals.in/ArticleDetails.aspx?id=3427 kostenfrei https://doaj.org/toc/0976-6561 Journal toc kostenfrei https://doaj.org/toc/2229-6956 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 8 2018 3 1663-1667 |
language |
English |
source |
In ICTACT Journal on Soft Computing 8(2018), 3, Seite 1663-1667 volume:8 year:2018 number:3 pages:1663-1667 |
sourceStr |
In ICTACT Journal on Soft Computing 8(2018), 3, Seite 1663-1667 volume:8 year:2018 number:3 pages:1663-1667 |
format_phy_str_mv |
Article |
institution |
findex.gbv.de |
topic_facet |
Neural Synchronisation Tree Parity Machine Cuckoo Search Algorithm Key Exchange Security Computer engineering. Computer hardware |
isfreeaccess_bool |
true |
container_title |
ICTACT Journal on Soft Computing |
authorswithroles_txt_mv |
Shikha Gupta @@aut@@ Nalin Nanda @@aut@@ Naman Chhikara @@aut@@ Nishi Gupta @@aut@@ Satbir Jain @@aut@@ |
publishDateDaySort_date |
2018-01-01T00:00:00Z |
hierarchy_top_id |
802535402 |
id |
DOAJ006097200 |
language_de |
englisch |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">DOAJ006097200</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230309195557.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230225s2018 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.21917/ijsc.2018.0231</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ006097200</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJdeb4da366c044b44a7883e69d5d25c2d</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">TK7885-7895</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Shikha Gupta</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">MUTUAL LEARNING IN TREE PARITY MACHINES USING CUCKOO SEARCH ALGORITHM FOR SECURE PUBLIC KEY EXCHANGE</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2018</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">In Neural Cryptography, Artificial Neural Networks are used for the process of key generation and encryption. Tree Parity Machine (TPM) is a single layer neural network that approaches symmetric key exchange using the process of mutual learning. This method is exploited to design a secure key exchange protocol, where the sender and the receiver TPMs are synchronized to obtain an identically tuned weight vectors in both the networks. The synchronized TPMs are then capable of generating a key stream. The time required for synchronization depends on the initial weight vectors which are randomly initialized. In the proposed method, the process of synchronization is expedited using Cuckoo Search (CS) Algorithm used for the generation of optimal weights.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Neural Synchronisation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Tree Parity Machine</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Cuckoo Search Algorithm</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Key Exchange</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Security</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Computer engineering. Computer hardware</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Nalin Nanda</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Naman Chhikara</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Nishi Gupta</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Satbir Jain</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">ICTACT Journal on Soft Computing</subfield><subfield code="d">ICT Academy of Tamil Nadu, 2014</subfield><subfield code="g">8(2018), 3, Seite 1663-1667</subfield><subfield code="w">(DE-627)802535402</subfield><subfield code="w">(DE-600)2798317-1</subfield><subfield code="x">22296956</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:8</subfield><subfield code="g">year:2018</subfield><subfield code="g">number:3</subfield><subfield code="g">pages:1663-1667</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.21917/ijsc.2018.0231</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/deb4da366c044b44a7883e69d5d25c2d</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://ictactjournals.in/ArticleDetails.aspx?id=3427</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/0976-6561</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/2229-6956</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_DOAJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">8</subfield><subfield code="j">2018</subfield><subfield code="e">3</subfield><subfield code="h">1663-1667</subfield></datafield></record></collection>
|
callnumber-first |
T - Technology |
author |
Shikha Gupta |
spellingShingle |
Shikha Gupta misc TK7885-7895 misc Neural Synchronisation misc Tree Parity Machine misc Cuckoo Search Algorithm misc Key Exchange misc Security misc Computer engineering. Computer hardware MUTUAL LEARNING IN TREE PARITY MACHINES USING CUCKOO SEARCH ALGORITHM FOR SECURE PUBLIC KEY EXCHANGE |
authorStr |
Shikha Gupta |
ppnlink_with_tag_str_mv |
@@773@@(DE-627)802535402 |
format |
electronic Article |
delete_txt_mv |
keep |
author_role |
aut aut aut aut aut |
collection |
DOAJ |
remote_str |
true |
callnumber-label |
TK7885-7895 |
illustrated |
Not Illustrated |
issn |
22296956 |
topic_title |
TK7885-7895 MUTUAL LEARNING IN TREE PARITY MACHINES USING CUCKOO SEARCH ALGORITHM FOR SECURE PUBLIC KEY EXCHANGE Neural Synchronisation Tree Parity Machine Cuckoo Search Algorithm Key Exchange Security |
topic |
misc TK7885-7895 misc Neural Synchronisation misc Tree Parity Machine misc Cuckoo Search Algorithm misc Key Exchange misc Security misc Computer engineering. Computer hardware |
topic_unstemmed |
misc TK7885-7895 misc Neural Synchronisation misc Tree Parity Machine misc Cuckoo Search Algorithm misc Key Exchange misc Security misc Computer engineering. Computer hardware |
topic_browse |
misc TK7885-7895 misc Neural Synchronisation misc Tree Parity Machine misc Cuckoo Search Algorithm misc Key Exchange misc Security misc Computer engineering. Computer hardware |
format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
format_main_str_mv |
Text Zeitschrift/Artikel |
carriertype_str_mv |
cr |
hierarchy_parent_title |
ICTACT Journal on Soft Computing |
hierarchy_parent_id |
802535402 |
hierarchy_top_title |
ICTACT Journal on Soft Computing |
isfreeaccess_txt |
true |
familylinks_str_mv |
(DE-627)802535402 (DE-600)2798317-1 |
title |
MUTUAL LEARNING IN TREE PARITY MACHINES USING CUCKOO SEARCH ALGORITHM FOR SECURE PUBLIC KEY EXCHANGE |
ctrlnum |
(DE-627)DOAJ006097200 (DE-599)DOAJdeb4da366c044b44a7883e69d5d25c2d |
title_full |
MUTUAL LEARNING IN TREE PARITY MACHINES USING CUCKOO SEARCH ALGORITHM FOR SECURE PUBLIC KEY EXCHANGE |
author_sort |
Shikha Gupta |
journal |
ICTACT Journal on Soft Computing |
journalStr |
ICTACT Journal on Soft Computing |
callnumber-first-code |
T |
lang_code |
eng |
isOA_bool |
true |
recordtype |
marc |
publishDateSort |
2018 |
contenttype_str_mv |
txt |
container_start_page |
1663 |
author_browse |
Shikha Gupta Nalin Nanda Naman Chhikara Nishi Gupta Satbir Jain |
container_volume |
8 |
class |
TK7885-7895 |
format_se |
Elektronische Aufsätze |
author-letter |
Shikha Gupta |
doi_str_mv |
10.21917/ijsc.2018.0231 |
author2-role |
verfasserin |
title_sort |
mutual learning in tree parity machines using cuckoo search algorithm for secure public key exchange |
callnumber |
TK7885-7895 |
title_auth |
MUTUAL LEARNING IN TREE PARITY MACHINES USING CUCKOO SEARCH ALGORITHM FOR SECURE PUBLIC KEY EXCHANGE |
abstract |
In Neural Cryptography, Artificial Neural Networks are used for the process of key generation and encryption. Tree Parity Machine (TPM) is a single layer neural network that approaches symmetric key exchange using the process of mutual learning. This method is exploited to design a secure key exchange protocol, where the sender and the receiver TPMs are synchronized to obtain an identically tuned weight vectors in both the networks. The synchronized TPMs are then capable of generating a key stream. The time required for synchronization depends on the initial weight vectors which are randomly initialized. In the proposed method, the process of synchronization is expedited using Cuckoo Search (CS) Algorithm used for the generation of optimal weights. |
abstractGer |
In Neural Cryptography, Artificial Neural Networks are used for the process of key generation and encryption. Tree Parity Machine (TPM) is a single layer neural network that approaches symmetric key exchange using the process of mutual learning. This method is exploited to design a secure key exchange protocol, where the sender and the receiver TPMs are synchronized to obtain an identically tuned weight vectors in both the networks. The synchronized TPMs are then capable of generating a key stream. The time required for synchronization depends on the initial weight vectors which are randomly initialized. In the proposed method, the process of synchronization is expedited using Cuckoo Search (CS) Algorithm used for the generation of optimal weights. |
abstract_unstemmed |
In Neural Cryptography, Artificial Neural Networks are used for the process of key generation and encryption. Tree Parity Machine (TPM) is a single layer neural network that approaches symmetric key exchange using the process of mutual learning. This method is exploited to design a secure key exchange protocol, where the sender and the receiver TPMs are synchronized to obtain an identically tuned weight vectors in both the networks. The synchronized TPMs are then capable of generating a key stream. The time required for synchronization depends on the initial weight vectors which are randomly initialized. In the proposed method, the process of synchronization is expedited using Cuckoo Search (CS) Algorithm used for the generation of optimal weights. |
collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 |
container_issue |
3 |
title_short |
MUTUAL LEARNING IN TREE PARITY MACHINES USING CUCKOO SEARCH ALGORITHM FOR SECURE PUBLIC KEY EXCHANGE |
url |
https://doi.org/10.21917/ijsc.2018.0231 https://doaj.org/article/deb4da366c044b44a7883e69d5d25c2d http://ictactjournals.in/ArticleDetails.aspx?id=3427 https://doaj.org/toc/0976-6561 https://doaj.org/toc/2229-6956 |
remote_bool |
true |
author2 |
Nalin Nanda Naman Chhikara Nishi Gupta Satbir Jain |
author2Str |
Nalin Nanda Naman Chhikara Nishi Gupta Satbir Jain |
ppnlink |
802535402 |
callnumber-subject |
TK - Electrical and Nuclear Engineering |
mediatype_str_mv |
c |
isOA_txt |
true |
hochschulschrift_bool |
false |
doi_str |
10.21917/ijsc.2018.0231 |
callnumber-a |
TK7885-7895 |
up_date |
2024-07-03T18:57:40.675Z |
_version_ |
1803585386633494528 |
fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">DOAJ006097200</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230309195557.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230225s2018 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.21917/ijsc.2018.0231</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ006097200</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJdeb4da366c044b44a7883e69d5d25c2d</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">TK7885-7895</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Shikha Gupta</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">MUTUAL LEARNING IN TREE PARITY MACHINES USING CUCKOO SEARCH ALGORITHM FOR SECURE PUBLIC KEY EXCHANGE</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2018</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">In Neural Cryptography, Artificial Neural Networks are used for the process of key generation and encryption. Tree Parity Machine (TPM) is a single layer neural network that approaches symmetric key exchange using the process of mutual learning. This method is exploited to design a secure key exchange protocol, where the sender and the receiver TPMs are synchronized to obtain an identically tuned weight vectors in both the networks. The synchronized TPMs are then capable of generating a key stream. The time required for synchronization depends on the initial weight vectors which are randomly initialized. In the proposed method, the process of synchronization is expedited using Cuckoo Search (CS) Algorithm used for the generation of optimal weights.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Neural Synchronisation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Tree Parity Machine</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Cuckoo Search Algorithm</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Key Exchange</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Security</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Computer engineering. Computer hardware</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Nalin Nanda</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Naman Chhikara</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Nishi Gupta</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Satbir Jain</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">ICTACT Journal on Soft Computing</subfield><subfield code="d">ICT Academy of Tamil Nadu, 2014</subfield><subfield code="g">8(2018), 3, Seite 1663-1667</subfield><subfield code="w">(DE-627)802535402</subfield><subfield code="w">(DE-600)2798317-1</subfield><subfield code="x">22296956</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:8</subfield><subfield code="g">year:2018</subfield><subfield code="g">number:3</subfield><subfield code="g">pages:1663-1667</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.21917/ijsc.2018.0231</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/deb4da366c044b44a7883e69d5d25c2d</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://ictactjournals.in/ArticleDetails.aspx?id=3427</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/0976-6561</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/2229-6956</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_DOAJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">8</subfield><subfield code="j">2018</subfield><subfield code="e">3</subfield><subfield code="h">1663-1667</subfield></datafield></record></collection>
|
score |
7.3999014 |