A projective general linear group based algorithm for the construction of substitution box for block ciphers
The substitution boxes are used in block ciphers with the purpose to induce confusion in data. The design of a substitution box determines the confusion ability of the cipher; therefore, many different types of boxes have been proposed by various authors in literature. In this paper, we present a no...
        Saved in:
      
    
          | Published in | Neural computing & applications Vol. 22; no. 6; pp. 1085 - 1093 | 
|---|---|
| Main Authors | , , , | 
| Format | Journal Article | 
| Language | English | 
| Published | 
        London
          Springer-Verlag
    
        01.05.2013
     Springer  | 
| Subjects | |
| Online Access | Get full text | 
| ISSN | 0941-0643 1433-3058  | 
| DOI | 10.1007/s00521-012-0870-0 | 
Cover
| Abstract | The substitution boxes are used in block ciphers with the purpose to induce confusion in data. The design of a substitution box determines the confusion ability of the cipher; therefore, many different types of boxes have been proposed by various authors in literature. In this paper, we present a novel method to design a new substitution box and compare its characteristics with some prevailing boxes used in cryptography. The algorithm proposed in this paper apply the action of projective linear group
PGL
(2,
GF
(2
8
)) on Galois field
GF
(2
8
). The new substitution box corresponds to a particular type of linear fractional transformation (35
z
 + 15)/(9
z
 + 5). In order to test the strength of the proposed substitution box, we apply non-linearity test, bit independence criterion, linear approximation probability method, differential approximation probability method, strict avalanche criterion, and majority logic criterion. This new technique to synthesize a substitution box offers a powerful algebraic complexity while keeping the software/hardware complexity within manageable parameters. | 
    
|---|---|
| AbstractList | The substitution boxes are used in block ciphers with the purpose to induce confusion in data. The design of a substitution box determines the confusion ability of the cipher; therefore, many different types of boxes have been proposed by various authors in literature. In this paper, we present a novel method to design a new substitution box and compare its characteristics with some prevailing boxes used in cryptography. The algorithm proposed in this paper apply the action of projective linear group
PGL
(2,
GF
(2
8
)) on Galois field
GF
(2
8
). The new substitution box corresponds to a particular type of linear fractional transformation (35
z
 + 15)/(9
z
 + 5). In order to test the strength of the proposed substitution box, we apply non-linearity test, bit independence criterion, linear approximation probability method, differential approximation probability method, strict avalanche criterion, and majority logic criterion. This new technique to synthesize a substitution box offers a powerful algebraic complexity while keeping the software/hardware complexity within manageable parameters. | 
    
| Author | Hussain, Iqtadar Mahmood, Hasan Shah, Tariq Gondal, Muhammad Asif  | 
    
| Author_xml | – sequence: 1 givenname: Iqtadar surname: Hussain fullname: Hussain, Iqtadar email: iqtadarqau@gmail.com organization: Department of Mathematics, Quaid-i-Azam University – sequence: 2 givenname: Tariq surname: Shah fullname: Shah, Tariq organization: Department of Mathematics, Quaid-i-Azam University – sequence: 3 givenname: Hasan surname: Mahmood fullname: Mahmood, Hasan organization: Department of Electronics, Quaid-i-Azam University – sequence: 4 givenname: Muhammad Asif surname: Gondal fullname: Gondal, Muhammad Asif organization: Department of Sciences and Humanities, National University of Computer and Emerging Sciences  | 
    
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=27623534$$DView record in Pascal Francis | 
    
| BookMark | eNp9kD1PwzAQhi1UJNrCD2Dzwhg4x4mdjFXFl4TEArPlOHbqktqR7SD496QtYmDodDrd-9zpngWaOe80QtcEbgkAv4sAZU4yIHkGFYcMztCcFJRmFMpqhuZQF9OUFfQCLWLcAkDBqnKO-hUegt9qleynxp12Osge99ZpGXAX_DjgRkbdYtl3Pti02WHjA04bjZV3MYVxIr3D3uA4NjHZNB76xn8dgk3v1QdWdtjoEC_RuZF91Fe_dYneH-7f1k_Zy-vj83r1kilKqpRRojS0BS0kMbXioJuW5Iw0Zc15beqmahmDBpTiBgxpWaWZaUtFWw650iWlS3Rz3DvIqGRvgnTKRjEEu5PhW-Sc5bSkxZQjx5wKPsagzV-EgNhrFUetYtIq9loFTAz_xyib5P7nFKTtT5L5kYzTFdfpILZ-DG4ScQL6Aekdj_w | 
    
| CitedBy_id | crossref_primary_10_1007_s13319_014_0017_4 crossref_primary_10_1007_s13319_014_0032_5 crossref_primary_10_1155_2018_5823230 crossref_primary_10_1007_s00521_017_3287_y crossref_primary_10_1109_ACCESS_2020_3004526 crossref_primary_10_1109_ACCESS_2023_3337443 crossref_primary_10_1007_s00500_022_07443_8 crossref_primary_10_1088_1402_4896_ac54d2 crossref_primary_10_1109_ACCESS_2019_2956385 crossref_primary_10_3233_JIFS_211176 crossref_primary_10_55525_tjst_1034034 crossref_primary_10_1007_s11071_012_0573_1 crossref_primary_10_1016_j_matcom_2023_01_036 crossref_primary_10_32604_iasc_2023_031855 crossref_primary_10_1007_s11071_022_07956_9 crossref_primary_10_1007_s11071_018_4478_5 crossref_primary_10_1007_s11071_017_3409_1 crossref_primary_10_3934_math_20231104 crossref_primary_10_1109_ACCESS_2023_3346319 crossref_primary_10_32604_cmc_2023_040371 crossref_primary_10_1007_s11071_013_1132_0 crossref_primary_10_1016_j_vlsi_2023_06_004 crossref_primary_10_1109_ACCESS_2020_2973679 crossref_primary_10_1177_1077546314559295 crossref_primary_10_1140_epjp_s13360_020_00666_4 crossref_primary_10_1038_s41598_023_28002_7 crossref_primary_10_1007_s11277_019_06973_z crossref_primary_10_1007_s13319_014_0016_5 crossref_primary_10_1007_s11042_018_6250_8 crossref_primary_10_1007_s11042_018_6022_5 crossref_primary_10_1007_s13319_014_0031_6 crossref_primary_10_3934_math_20241714 crossref_primary_10_1080_09500340_2016_1246680 crossref_primary_10_3923_itj_2014_2482_2488 crossref_primary_10_1007_s00521_023_09082_y crossref_primary_10_1007_s11277_020_07841_x crossref_primary_10_3390_math12040587 crossref_primary_10_1109_ACCESS_2021_3069591 crossref_primary_10_1007_s11042_020_08995_3 crossref_primary_10_1007_s11045_021_00786_9 crossref_primary_10_1155_2020_8883884 crossref_primary_10_1155_2021_3367521 crossref_primary_10_1007_s11042_022_12724_3 crossref_primary_10_1142_S0218127421501467 crossref_primary_10_1007_s11071_024_10003_4 crossref_primary_10_1007_s11071_020_06098_0 crossref_primary_10_1109_ACCESS_2020_3005087 crossref_primary_10_1016_j_heliyon_2023_e23652 crossref_primary_10_1186_s40064_016_3298_7 crossref_primary_10_3934_math_20241681 crossref_primary_10_3390_electronics13163148 crossref_primary_10_7717_peerj_cs_940 crossref_primary_10_1007_s11071_016_3295_y crossref_primary_10_1007_s11042_022_12358_5 crossref_primary_10_1155_2023_5767102 crossref_primary_10_1007_s11235_024_01251_1 crossref_primary_10_1109_ACCESS_2021_3092512 crossref_primary_10_1016_j_physa_2019_124072 crossref_primary_10_1007_s11042_021_10695_5 crossref_primary_10_1016_j_vlsi_2023_102099 crossref_primary_10_1007_s13319_014_0030_7 crossref_primary_10_1371_journal_pone_0241890 crossref_primary_10_1007_s11042_020_10110_5 crossref_primary_10_1016_j_aej_2015_01_003 crossref_primary_10_3390_sym12050826 crossref_primary_10_1007_s13319_017_0125_z crossref_primary_10_1007_s11042_020_09182_0 crossref_primary_10_3233_JIN_180081 crossref_primary_10_1016_j_cjph_2018_04_013 crossref_primary_10_1007_s13319_015_0049_4 crossref_primary_10_1109_ACCESS_2022_3183990 crossref_primary_10_1007_s11760_024_03301_2 crossref_primary_10_1007_s11071_014_1767_5 crossref_primary_10_1109_ACCESS_2021_3110761 crossref_primary_10_1007_s11042_019_08464_6 crossref_primary_10_1007_s11760_013_0577_4 crossref_primary_10_1007_s11071_016_3028_2 crossref_primary_10_1016_j_sigpro_2015_05_013 crossref_primary_10_1016_j_optlaseng_2014_12_025 crossref_primary_10_1109_ACCESS_2020_3010615 crossref_primary_10_1109_ACCESS_2020_3012912 crossref_primary_10_1007_s11071_017_3874_6 crossref_primary_10_1016_j_ins_2021_01_014 crossref_primary_10_1038_s41598_021_93344_z crossref_primary_10_1007_s13369_021_05666_9 crossref_primary_10_1007_s40314_023_02215_y crossref_primary_10_3233_JIFS_233823 crossref_primary_10_1007_s00521_019_04207_8 crossref_primary_10_1063_1_4978264 crossref_primary_10_1109_ACCESS_2019_2936447 crossref_primary_10_3390_math11020446 crossref_primary_10_1016_j_cnsns_2014_02_011 crossref_primary_10_1109_ACCESS_2020_3034832 crossref_primary_10_1142_S1793048024400010 crossref_primary_10_1007_s40314_023_02545_x crossref_primary_10_1007_s11042_019_07957_8 crossref_primary_10_1007_s11042_017_4772_0 crossref_primary_10_1109_ACCESS_2021_3087139 crossref_primary_10_1007_s11071_013_0987_4 crossref_primary_10_1007_s11277_021_08981_4 crossref_primary_10_1007_s13319_014_0025_4 crossref_primary_10_1007_s40998_019_00230_6 crossref_primary_10_1007_s11277_020_07832_y crossref_primary_10_1007_s11042_024_19598_7 crossref_primary_10_1007_s11071_016_3046_0 crossref_primary_10_32604_cmc_2022_027655 crossref_primary_10_1109_ACCESS_2020_3032403 crossref_primary_10_1007_s10773_020_04616_9  | 
    
| Cites_doi | 10.1080/01611190802653228 10.1007/3-540-48285-7_33 10.1007/978-3-662-04722-4 10.1007/BF00630563 10.1109/CIS.2008.205  | 
    
| ContentType | Journal Article | 
    
| Copyright | Springer-Verlag London Limited 2012 2014 INIST-CNRS  | 
    
| Copyright_xml | – notice: Springer-Verlag London Limited 2012 – notice: 2014 INIST-CNRS  | 
    
| DBID | AAYXX CITATION IQODW  | 
    
| DOI | 10.1007/s00521-012-0870-0 | 
    
| DatabaseName | CrossRef Pascal-Francis  | 
    
| DatabaseTitle | CrossRef | 
    
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc | 
    
| Discipline | Computer Science Mathematics Applied Sciences Statistics  | 
    
| EISSN | 1433-3058 | 
    
| EndPage | 1093 | 
    
| ExternalDocumentID | 27623534 10_1007_s00521_012_0870_0  | 
    
| GroupedDBID | -4Z -59 -5G -BR -EM -Y2 -~C .4S .86 .DC .VR 06D 0R~ 0VY 123 1N0 1SB 2.D 203 28- 29N 2J2 2JN 2JY 2KG 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 53G 5QI 5VS 67Z 6NX 8FE 8FG 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAOBN AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDBF ABDZT ABECU ABFTD ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABLJU ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACSNA ACUHS ACZOJ ADHHG ADHIR ADIMF ADINQ ADKNI ADKPE ADMLS ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFKRA AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARAPS ARCSS ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN B-. B0M BA0 BBWZM BDATZ BENPR BGLVJ BGNMA BSONS CAG CCPQU COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 EAD EAP EBLON EBS ECS EDO EIOEI EJD EMI EMK EPL ESBYG EST ESX F5P FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GQ8 GXS H13 HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I-F I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ KDC KOV KOW LAS LLZTM M4Y MA- N2Q N9A NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM P19 P2P P62 P9O PF0 PT4 PT5 QOK QOS R4E R89 R9I RHV RIG RNI RNS ROL RPX RSV RZK S16 S1Z S26 S27 S28 S3B SAP SCJ SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TSG TSK TSV TUC TUS U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 Z5O Z7R Z7S Z7V Z7W Z7X Z7Y Z7Z Z81 Z83 Z86 Z88 Z8M Z8N Z8P Z8Q Z8R Z8S Z8T Z8U Z8W Z92 ZMTXR ~8M ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG ADKFA AEZWR AFDZB AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION PHGZM PHGZT PQGLB PUEGO IQODW  | 
    
| ID | FETCH-LOGICAL-c318t-31ce0d434a1f9c70ebd1261b59779f9b8d660b0cc7f0f1d68e6fd5c3d702ce533 | 
    
| IEDL.DBID | U2A | 
    
| ISSN | 0941-0643 | 
    
| IngestDate | Mon Jul 21 09:16:27 EDT 2025 Thu Apr 24 23:04:19 EDT 2025 Wed Oct 01 02:25:36 EDT 2025 Fri Feb 21 02:34:27 EST 2025  | 
    
| IsPeerReviewed | true | 
    
| IsScholarly | true | 
    
| Issue | 6 | 
    
| Keywords | Substitution box (S-box) Differential approximation probability (DP) Bit independence criterion (BIC) Linear approximation probability (LP) Majority logic criterion (MLC) Non-linearity test Strict avalanche criterion (SAC) Action Neural computation Majority logic Probability distribution Neural network Algorithm Linear test Complexity Experimental design Linear approximation Linearity Linear transformation Independence test Software Cryptography  | 
    
| Language | English | 
    
| License | http://www.springer.com/tdm CC BY 4.0  | 
    
| LinkModel | DirectLink | 
    
| MergedId | FETCHMERGED-LOGICAL-c318t-31ce0d434a1f9c70ebd1261b59779f9b8d660b0cc7f0f1d68e6fd5c3d702ce533 | 
    
| PageCount | 9 | 
    
| ParticipantIDs | pascalfrancis_primary_27623534 crossref_primary_10_1007_s00521_012_0870_0 crossref_citationtrail_10_1007_s00521_012_0870_0 springer_journals_10_1007_s00521_012_0870_0  | 
    
| ProviderPackageCode | CITATION AAYXX  | 
    
| PublicationCentury | 2000 | 
    
| PublicationDate | 2013-05-01 | 
    
| PublicationDateYYYYMMDD | 2013-05-01 | 
    
| PublicationDate_xml | – month: 05 year: 2013 text: 2013-05-01 day: 01  | 
    
| PublicationDecade | 2010 | 
    
| PublicationPlace | London | 
    
| PublicationPlace_xml | – name: London | 
    
| PublicationTitle | Neural computing & applications | 
    
| PublicationTitleAbbrev | Neural Comput & Applic | 
    
| PublicationYear | 2013 | 
    
| Publisher | Springer-Verlag Springer  | 
    
| Publisher_xml | – name: Springer-Verlag – name: Springer  | 
    
| References | CuiLCaoYA new S-box structure named Affine- Power-AffineInt J Innov Comput I2007334553 MatsuiMLinear cryptanalysis method of DES cipher. Advances in cryptology, proceeding of the Eurocrypt’93Lect Notes Comput Sci199476538639710.1007/3-540-48285-7_33 DaemenJRijmenVThe design of Rijndael-AES: the advanced encryption standard2002BerlinSpringer1065.9400510.1007/978-3-662-04722-4 BihamEShamirADifferential cryptanalysis of DES-like cryptosystemsJ Cryptol19914137212027860729.6801710.1007/BF00630563 Tran MT, Bui DK, Doung AD (2008) Gray S-box for advanced encryption standard. Int Conf Comp Intel Secur 253–256 HussainIShahTMahmoodHGondalMABhattiUYSome analysis of S-box based on residue of prime numberProc Pak Acad Sci20114821111152865143 HussainIShahTMahmoodHAfzalMComparative analysis of S-boxes based on graphical SACInt J Comput Appl20102558 KimJPhanRC-WAdvanced differential-style cryptanalysis of the NSA’s skipjack block cipherCryptologia20093332462701216.9404710.1080/01611190802653228 HussainIShahTAslamSKGraphical SAC analysis of S8 APA S-boxAdv Algebra2010325762 Feng D, Wu W (2000) Design and analysis of block ciphers. Tsinghua University Press Shi XY, Xiao Hu You XC, Lam KY (2002) A method for obtaining cryptographically strong 8 × 8 S-boxes. Int Conf Infor Network Appl 2(3):14–20 HussainIMahmoodZGraphical strict avalanche criterion for Kasumi S-boxCan J Comput Math Nat Sci Eng Med201015132136 ShahTHussainIGondalMAMahmoodHStatistical analysis of S-box in image encryption applications based on majority logic criterionInt J Phys Sci201161641104127 HussainIShahTMahmoodHA new algorithm to construct secure keys for AESInt J Cont Math Sci20105261263127027336171205.94085 J Daemen (870_CR1) 2002 I Hussain (870_CR3) 2010; 1 870_CR12 L Cui (870_CR8) 2007; 3 870_CR11 I Hussain (870_CR9) 2010; 5 M Matsui (870_CR13) 1994; 765 I Hussain (870_CR2) 2010; 2 870_CR7 T Shah (870_CR5) 2011; 6 J Kim (870_CR10) 2009; 33 I Hussain (870_CR6) 2011; 48 E Biham (870_CR14) 1991; 4 I Hussain (870_CR4) 2010; 3  | 
    
| References_xml | – reference: KimJPhanRC-WAdvanced differential-style cryptanalysis of the NSA’s skipjack block cipherCryptologia20093332462701216.9404710.1080/01611190802653228 – reference: HussainIShahTAslamSKGraphical SAC analysis of S8 APA S-boxAdv Algebra2010325762 – reference: ShahTHussainIGondalMAMahmoodHStatistical analysis of S-box in image encryption applications based on majority logic criterionInt J Phys Sci201161641104127 – reference: MatsuiMLinear cryptanalysis method of DES cipher. Advances in cryptology, proceeding of the Eurocrypt’93Lect Notes Comput Sci199476538639710.1007/3-540-48285-7_33 – reference: Tran MT, Bui DK, Doung AD (2008) Gray S-box for advanced encryption standard. Int Conf Comp Intel Secur 253–256 – reference: Shi XY, Xiao Hu You XC, Lam KY (2002) A method for obtaining cryptographically strong 8 × 8 S-boxes. Int Conf Infor Network Appl 2(3):14–20 – reference: DaemenJRijmenVThe design of Rijndael-AES: the advanced encryption standard2002BerlinSpringer1065.9400510.1007/978-3-662-04722-4 – reference: CuiLCaoYA new S-box structure named Affine- Power-AffineInt J Innov Comput I2007334553 – reference: HussainIShahTMahmoodHA new algorithm to construct secure keys for AESInt J Cont Math Sci20105261263127027336171205.94085 – reference: Feng D, Wu W (2000) Design and analysis of block ciphers. Tsinghua University Press – reference: HussainIShahTMahmoodHGondalMABhattiUYSome analysis of S-box based on residue of prime numberProc Pak Acad Sci20114821111152865143 – reference: BihamEShamirADifferential cryptanalysis of DES-like cryptosystemsJ Cryptol19914137212027860729.6801710.1007/BF00630563 – reference: HussainIShahTMahmoodHAfzalMComparative analysis of S-boxes based on graphical SACInt J Comput Appl20102558 – reference: HussainIMahmoodZGraphical strict avalanche criterion for Kasumi S-boxCan J Comput Math Nat Sci Eng Med201015132136 – volume: 33 start-page: 246 issue: 3 year: 2009 ident: 870_CR10 publication-title: Cryptologia doi: 10.1080/01611190802653228 – volume: 5 start-page: 1263 issue: 26 year: 2010 ident: 870_CR9 publication-title: Int J Cont Math Sci – ident: 870_CR11 – volume: 2 start-page: 5 issue: 5 year: 2010 ident: 870_CR2 publication-title: Int J Comput Appl – volume: 48 start-page: 111 issue: 2 year: 2011 ident: 870_CR6 publication-title: Proc Pak Acad Sci – volume: 765 start-page: 386 year: 1994 ident: 870_CR13 publication-title: Lect Notes Comput Sci doi: 10.1007/3-540-48285-7_33 – volume: 6 start-page: 4110 issue: 16 year: 2011 ident: 870_CR5 publication-title: Int J Phys Sci – volume-title: The design of Rijndael-AES: the advanced encryption standard year: 2002 ident: 870_CR1 doi: 10.1007/978-3-662-04722-4 – volume: 3 start-page: 57 issue: 2 year: 2010 ident: 870_CR4 publication-title: Adv Algebra – volume: 4 start-page: 3 issue: 1 year: 1991 ident: 870_CR14 publication-title: J Cryptol doi: 10.1007/BF00630563 – volume: 3 start-page: 45 issue: 3 year: 2007 ident: 870_CR8 publication-title: Int J Innov Comput I – ident: 870_CR12 – volume: 1 start-page: 132 issue: 5 year: 2010 ident: 870_CR3 publication-title: Can J Comput Math Nat Sci Eng Med – ident: 870_CR7 doi: 10.1109/CIS.2008.205  | 
    
| SSID | ssj0004685 | 
    
| Score | 2.350413 | 
    
| Snippet | The substitution boxes are used in block ciphers with the purpose to induce confusion in data. The design of a substitution box determines the confusion... | 
    
| SourceID | pascalfrancis crossref springer  | 
    
| SourceType | Index Database Enrichment Source Publisher  | 
    
| StartPage | 1085 | 
    
| SubjectTerms | Applied sciences Artificial Intelligence Combinatorics Combinatorics. Ordered structures Computational Biology/Bioinformatics Computational Science and Engineering Computer Science Computer science; control theory; systems Data Mining and Knowledge Discovery Designs and configurations Exact sciences and technology Experimental design Group theory Group theory and generalizations Image Processing and Computer Vision Learning and adaptive systems Mathematics Original Article Probability and statistics Probability and Statistics in Computer Science Sciences and techniques of general use Statistics  | 
    
| Title | A projective general linear group based algorithm for the construction of substitution box for block ciphers | 
    
| URI | https://link.springer.com/article/10.1007/s00521-012-0870-0 | 
    
| Volume | 22 | 
    
| hasFullText | 1 | 
    
| inHoldings | 1 | 
    
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVEBS databaseName: EBSCOhost Academic Search Ultimate customDbUrl: https://search.ebscohost.com/login.aspx?authtype=ip,shib&custid=s3936755&profile=ehost&defaultdb=asn eissn: 1433-3058 dateEnd: 20241102 omitProxy: true ssIdentifier: ssj0004685 issn: 0941-0643 databaseCode: ABDBF dateStart: 19990101 isFulltext: true titleUrlDefault: https://search.ebscohost.com/direct.asp?db=asn providerName: EBSCOhost – providerCode: PRVEBS databaseName: Inspec with Full Text customDbUrl: eissn: 1433-3058 dateEnd: 20241102 omitProxy: false ssIdentifier: ssj0004685 issn: 0941-0643 databaseCode: ADMLS dateStart: 19930301 isFulltext: true titleUrlDefault: https://www.ebsco.com/products/research-databases/inspec-full-text providerName: EBSCOhost – providerCode: PRVLSH databaseName: SpringerLink Journals customDbUrl: mediaType: online eissn: 1433-3058 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0004685 issn: 0941-0643 databaseCode: AFBBN dateStart: 19970301 isFulltext: true providerName: Library Specific Holdings – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: http://www.proquest.com/pqcentral?accountid=15518 eissn: 1433-3058 dateEnd: 20241102 omitProxy: true ssIdentifier: ssj0004685 issn: 0941-0643 databaseCode: BENPR dateStart: 20120101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVAVX databaseName: SpringerLINK - Czech Republic Consortium customDbUrl: eissn: 1433-3058 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0004685 issn: 0941-0643 databaseCode: AGYKE dateStart: 19970101 isFulltext: true titleUrlDefault: http://link.springer.com providerName: Springer Nature – providerCode: PRVAVX databaseName: SpringerLink Journals (ICM) customDbUrl: eissn: 1433-3058 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0004685 issn: 0941-0643 databaseCode: U2A dateStart: 19970101 isFulltext: true titleUrlDefault: http://www.springerlink.com/journals/ providerName: Springer Nature  | 
    
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1JS8NAFB60vQjiLtalzMGTEpgmk2RyjNJaFIuIhXoKma0Wa1OaHvz5vpksWlzAS0JgZg7vzVsm8973IXTuRzxiXsCckGvmUAUPzsHcI8YlDZQUrq12vx8E_SG9Hfmjso87r6rdqytJ66nrZjfzB9McfV2HMMOWso6avkHzgk08dOMvzZCWhxOOLaakh3rVVeZPS6wEo815moNcdEFo8e1m1Aac3g7aKjNFHBeq3UVraraHtisWBlwa5T6axrj8nQKOC48LGGlsssd0gW3TBjahSuJ0Os4Wk-XLG4ZEFUPih0X2iR-LM41z8CK2dMB88-zdDuQQ7l6xmBj8gfwADXvdp-u-U3IoOAKsdQkuVigiqUfTjo5ESBSXHTg0cQM7F-mIMxkEhBMhQk10RwZMBVr6wpMhcYWCXPAQNWbZTB0hLGQoiS-Y9CCkSaU5S2nANUkFYRGluoVIJcxElADjhudimtTQyFb-Ccg_MfJPSAtd1FPmBbrGX4PbKxqqZ7jg0D3foy10WaksKS0x_32543-NPkEbriXCMKWOp6gBylFnkI4seRs145vnuy68r7qDh8e23Y4fkrXbiw | 
    
| linkProvider | Springer Nature | 
    
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8QwEB50PSiI6xPXZw6elEq2Tdv0uIi6Pk8r6Kk0LxXXrWxXEH-9k7Rd34KXQiEJ7Uwyj8zMNwA7YSISHkTci4XhHtP4EAKPe8KFYpFW0nfZ7heXUfeKnV6H11Udd1Fnu9chSSepx8Vu9gbTur6-R7ntljIJUwz9E78BU53jm7PDD-WQrhMnOi42qYcFdTDzp0U-qaPZp6xAypiypcW32KhTOUdN6NUfW2aaPOw_j8S-fP2C4_jPv5mHucoEJZ1yzyzAhB4sQrNu70Cq074E_Q6p7mlQIpLbEp-aWLM0GxJXDUKsDlQk69_mw_vR3SNBC5igRUlk_g5MS3JDChRPLifBvov8xQ0UqEcfiLy3wAbFMlwdHfYOul7VnMGTKAZGKLulpooFLGubRMZUC9VGb0xYPLvEJIKrKKKCShkbatoq4joyKpSBiqkvNRqZK9AY5AO9CkSqWNFQchWgrlTaCJ6xSBiaScoTxkwLaM2jVFbI5baBRj8dYy47aqZIzdRSM6Ut2B1PeSphO_4avPWJ8eMZPmqKIAxYC_ZqJqbVES9-X27tX6O3YbrbuzhPz08uz9ZhxnfdNmw-5QY0kFF6E22ekdiq9vgb0M_3-g | 
    
| linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1bS8MwFA46QQTxLs7LzINPSjFr0zZ9HOqYt-GDg72V5jaHsx1rH_z5nqTtdHgBXwqFJA_n5FySnPN9CJ35EY-YFzAn5Jo5VMGHczD3iHFJAyWFa6vdH_tBb0Dvhv6w4jnN62r3-kmy7GkwKE1pcTmV-nLe-GZuM80x2HUIM8wpy2iFGpwE2NADt_OlMdJycsIRxpT3UK9-1vxpiYXAtD5NcpCRLsktvr2S2uDT3UIbVdaIO6Wat9GSSnfQZs3IgCsD3UWTDq6uVsCJ4VEJKY1NJpnMsG3gwCZsSZxMRtlsXLy8YUhaMSSBWGSfWLI40zgHj2LLCMw_z97tQA6h7xWLscEiyPfQoHvzfNVzKj4FR4DlFuBuhSKSejRp60iERHHZhgMUNxB0kY44k0FAOBEi1ES3ZcBUoKUvPBkSVyjIC_dRI81SdYCwkKEkvmDSg_AmleYsoQHXJBGERZTqJiK1MGNRgY0bzotJPIdJtvKPQf6xkX9Mmuh8PmVaIm38Nbi1oKH5DBecu-d7tIkuapXFlVXmvy93-K_Rp2j16bobP9z274_Qmmv5MUwF5DFqgJ7UCWQpBW_ZnfgB6RffhQ | 
    
| 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=A+projective+general+linear+group+based+algorithm+for+the+construction+of+substitution+box+for+block+ciphers&rft.jtitle=Neural+computing+%26+applications&rft.au=Hussain%2C+Iqtadar&rft.au=Shah%2C+Tariq&rft.au=Mahmood%2C+Hasan&rft.au=Gondal%2C+Muhammad+Asif&rft.date=2013-05-01&rft.issn=0941-0643&rft.eissn=1433-3058&rft.volume=22&rft.issue=6&rft.spage=1085&rft.epage=1093&rft_id=info:doi/10.1007%2Fs00521-012-0870-0&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s00521_012_0870_0 | 
    
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0941-0643&client=summon | 
    
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0941-0643&client=summon | 
    
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0941-0643&client=summon |