仕様書フォーマット
|
|
|
- ゆりな ながだき
- 7 years ago
- Views:
Transcription
1 13 1
2 AVA AVD CC UKV AVA AVD CC UKV CIPHERUNICORN-E FEAL-NX Hierocrypt-L1...3 i
3 MISTY Camellia (1bit) (19bit) (5bit) (1bit) (19bit) (5bit) CIPHERUNICORN-A (1bit) (19bit)..... (5bit) (1bit) (19bit) (5bit)....7 Hierocrypt (1bit) (19bit) (5bit) (1bit) (19bit) (5bit).... MARS (1bit) (19bit) (5bit)...5 ii
4 ..5 (1bit)..... (19bit) (5bit)....9 RC bit bit bit bit bit bit...9. SC (1bit) (19bit) (5bit) (1bit) (19bit) (5bit)...5 iii
5 CIPHERUNICORN-E FEAL-NX Hierocrypt-L1 MISTY1 Camellia CIPHERUNICORN-A Hierocrypt-3 MARS RC SC
6 1.3 : : : : x<<y : x y X[i] : X i #{P} : P Hw(x) : x Pa(x) : x V (m) : a,a1,...,am-1 GF( n ) 1 m GF( m ) 1. big endian Q 1 (quad word) D (double word) W 3 (word) B (byte) E 1 (bit) Q D D1 W W1 W W3 B B1 B B15 E E1 E E17
7 .1 AVA AVD CC UKV (1) AVA(Avalanche) X K f(x, K)=Y m X( X V (m) ) Y = f(x, K) f(x X, K) j AVA[m, X, j] AVA[m, X, j] = #{ Y[j]=1} #{ Y[j]=} m K( K V (m) ) Y = f(x, K) f(x, K K) j AVA[m, K, j] AVA[m, K, j] = #{ Y[j]=1} #{ Y[j]=} X K m=1, () AVD(the average number of diffusion bits) m ( ) N t Y(t) AVD[m] AVD[m] = N Hw( Y(t)) t=1 / N 3
![f(x, K K) j AVA[m, K, j] AVA[m, K, j] = #{ Y[j]=1} #{ Y[j]=} X K m=1, () AVD(the](/docs-images/52/20132237/images/page_7.jpg "average number of diffusion bits) m ( ) N t Y(t) AVD[m] AVD[m] = N Hw( Y(t)) t=1 /")
8 (3) CC(Correlation Coefficient) m X n (A= Y[i], B= Y[j]) CC[m, X, i, j] CC[m, X, i, j] = n #{A B=1} #{A=1} #{B=1} ( n #{A =1} #{A=1} ) ( n #{B =1} #{B=1} ) m K n (A= Y[i], B= Y[j]) CC[m, K, i, j] CC[m, K, i, j] = n #{A B=1} #{A=1} #{B=1} ( n #{A =1} #{A=1} ) ( n #{B =1} #{B=1} ) X K m=1 () UKV(Useful Key Volume) 1 AVA (.5.1() ) a b step1) K j AVA[1, K, j] step) D step3)ukv = a (D / (a b))
![j] CC[m, K, i, j] = n #{A B=1} #{A=1} #{B=1} ( n #{A =1} #{A=1} ) ( n #{B =1} #{B=1} ) X K m=1 ()](/docs-images/52/20132237/images/page_8.jpg "UKV(Useful Key Volume) 1 AVA (.5.")
9 . 3 (prng()) rand() (1) rand() step1) seed = R1 = prng(seed) step) seed = R = prng(seed) step3) R = R1 (R << ) step) return(r) () prng(x) prng(x) = ax mod m a = 7 5 = 17 m = 31 1 = (1) seedk seedd step1) RK 1 step)seedd step3) RD 1 step) f(rd, RK) step5)step3 step step)step1 step5 () seedk seedd step1) RD 1 step)seedk step3) RK 1 step) f(rd, RK) step5)step3 step step)step1 step5. 5
10 AVA (1) (WDR) 1 STmax[AVA] : AVA WDR[AVA] = (STmax[AVA] / ( )) () (RSV) (RSV) ( )N RSV = a / N a ( ) 1 a = 1 ( ) a =.5 1
![(STmax[AVA] / ( )) () (RSV)](/docs-images/52/20132237/images/page_10.jpg "(RSV) ( )N RSV = a / N a ( ) 1")
11 .5. AVD n n/.5.3 CC CC -1 CC 1 CC ( ) n.5 /.5n.5. UKV UKV 7
12 (1) CIPHERUNICORN-E () FEAL-NX 5 (3) Hierocrypt-L1 () MISTY (1) Camellia () CIPHERUNICORN-A 3 (3) Hierocrypt-3 () MARS
13 (5) RC () SC
14 C 3.1 CIPHERUNICORN-E FEAL-NX Hierocrypt-L1 MISTY1 Camellia CIPHERUNICORN-A Hierocrypt-3 MARS RC SC UNIE FEAL HiL1 MIST Came UNIA Hi3 MARS RC SC
15 3.3 AVA 3. Hw ( ) 1 3 ( ) ( ) UNIE FEAL HiL1 MIST Came UNIA Hi3 MARS RC SC (*) (*) (*) -17.7(*) ( 1 ) ( 1 ) (*) (*).(*).... (*3) (*3) = 1 (*1) 3 ( 3 ) ( ) (*) -17.(*) (*) -17.3(*) (*3) (*3) (*1)UNIE, FEAL, MIST,MARS (*) (*3) 11
16 Hw 3.3 ( 1 ) ( ) UNIE FEAL HiL1 MIST Came UNIA Hi3 MARS RC SC 1 ( 1 ) ( 1 ) (*1) R R3 R R5 R R7 ( 1 ) (*1)Rx x R5 R5 1
17 3. ( 19 ) Hw ( ) Came UNIA Hi3 MARS RC SC 1 ( 1 ) ( 1 ) (*1) R R3 R R5 R R7 ( 1 ) (*1)Rx x R5 R5 13
18 3.5 ( 5 ) Hw ( ) Came UNIA Hi3 MARS RC SC 1 ( 1 ) ( 1 ) (*1) R R3 R R5 R R7 ( 1 ) (*1)Rx x R5 R5
19 Hw 3. ( 1 ) ( ) UNIE FEAL HiL1 MIST Came UNIA Hi3 MARS RC SC 1 (*1) W W1 W W (*1)Wx Word#x 3 15
20 3.7 ( 19 ) Hw Came UNIA Hi3 MARS RC SC 1 (*1) W W1 W W3 W W (*1)Wx Word#x 3 1
21 3. ( 5 ) Hw Came UNIA Hi3 MARS RC SC 1 (*1) W W1 W W3 W W5 W W (*1)Wx Word#x 3 17
22 3. AVD 3.9 Hw AVD ( ) UNIE FEAL HiL1 MIST Came UNIA Hi3 MARS RC SC 1 3 ( ) ( ) (*) 3. (*) (*). (*) ( 1 ) ( 1 ) (*) (*) (*) (*3) (*3) = 1 (*1) 3 ( 3 ) ( ) (*) 3. (*) (*) 1.. (*) (*3) (*3) (*1)UNIE, FEAL, MIST, MARS (*) (*3) 1
23 Hw 3. ( 1 ) AVD ( ) UNIE FEAL HiL1 MIST Came UNIA Hi3 MARS RC SC ( 1 ) ( 1 ) (*1) ( 1 ) R R3 R R5 R (*1)Rx x R5 R5 19
24 3.11 ( 19 ) Hw AVD ( ) Came UNIA Hi3 MARS RC SC ( 1 ) ( 1 ) (*1) ( 1 ) R R3 R R5 R (*1)Rx x R5 R5
25 3.1 ( 5 ) Hw AVD ( ) Came UNIA Hi3 MARS RC SC ( 1 ) ( 1 ) (*1) ( 1 ) R R3 R R5 R (*1)Rx x R5 R5 1
26 Hw 3.13 ( 1 ) AVD ( ) UNIE FEAL HiL1 MIST Came UNIA Hi3 MARS RC SC (*1) W W W W (*1)Wx Word#x 3
27 3. ( 19 ) Hw AVD Came UNIA Hi3 MARS RC SC (*1) W W W W W W (*1)Wx Word#x 3 3
28 3.15 ( 5 ) Hw AVD Came UNIA Hi3 MARS RC SC (*1) W W W W W W W W (*1)Wx Word#x 3
29 3.5 CC 3.1 Hw CC ( ) UNIE FEAL HiL1 MIST Came UNIA Hi3 (*) MARS RC SC 1 ( ) = 1 (*1) ( ) (*3) (*1)UNIE, FEAL, MIST, MARS (*)Hi3 (*3) 5
30 Hw 3.17 ( 1 ) CC ( ) UNIE FEAL HiL1 MIST Came UNIA Hi3 MARS RC SC 1 ( 1 ) ( 1 ) (*1) R R3 R R5 R ( 1 ) (*1)Rx x R5 R
31 3.1 ( 19 ) Hw CC ( ) Came UNIA Hi3 MARS RC SC 1 ( 1 ) ( 1 ) ( 1 ) -7.5 R R3 R R5 R (*1)Rx x R5 R
32 3.19 ( 5 ) Hw CC ( ) Came UNIA Hi3 MARS RC SC 1 ( 1 ) ( 1 ) ( 1 ) -7.5 R R3 R R5 R (*1)Rx x R5 R5-7.
33 Hw 3. ( 1 ) CC ( ) UNIE FEAL HiL1 MIST Came UNIA Hi3 MARS RC SC ( 19 ) Hw CC Came UNIA Hi3 MARS RC SC ( 5 ) Hw CC Came UNIA Hi3 MARS RC SC
34 3. UKV 3.3 Hw UKV ( ) UNIE FEAL HiL1 MIST Came UNIA Hi3 MARS RC SC 1 ( 1 ) (*1) (*1) (*1) 3
35 .1 CIPHERUNICORN-E B (1) AVA( 3.) () AVD( 3.9) (3) CC( 3.1) () UKV( 3.3).1. (1) AVA( 3.3) (Hw=1) (Hw=1) (Hw=1) R R3 R () AVD( 3.) (Hw=1) (Hw=1) (Hw=1) R R3 R (3) CC( 3.17) (Hw=1) (Hw=1) (Hw=1) R R3 R.1.3 (1) AVA( 3.) () AVD( 3.13) (3) CC( 3.) 31
36 . FEAL-NX B...1 (1) AVA( 3.) 1 () AVD( 3.9) (Hw=1) (Hw=1) (Hw=1) (Hw=) (Hw=) (Hw=) 3 (3) CC( 3.1) CC=1 # #3 #9 () UKV( 3.3).. (1) AVA( 3.3) (Hw=1) (Hw=1) (Hw=1) R R3 R () AVD( 3.) (3) CC( 3.17) (Hw=1) (Hw=1) (Hw=1) R R3 R R5..3 (1) AVA( 3.) () AVD( 3.13) (Hw=1) 1 (Hw=) 19 3
37 (3) CC( 3.) CC=1 # K1 #7 #13 33
38 .3 Hierocrypt-L1 B (1) AVA( 3.) (Hw=) = (Hw=) (Hw=1,) () AVD( 3.9) (Hw=1) (3) CC( 3.1) () UKV( 3.3).3. (1) AVA( 3.3) () AVD( 3.) (3) CC( 3.17).3.3 (1) AVA( 3.) 1 () AVD( 3.13) (Hw=1) 3 (Hw=) 1 (3) CC( 3.) CC=1 3
39 . MISTY1 B...1 (1) AVA( 3.) 1 () AVD( 3.9) (Hw=1,) (Hw=1,) (Hw=1,) 3 7 (3) CC( 3.1) CC=1 #1 # #9 () UKV( 3.3).. (1) AVA( 3.3) (Hw=1) (Hw=1) (Hw=1) R R3 R () AVD( 3.) (Hw=1) (Hw=1) (Hw=1) R 7 (3) CC( 3.17) (Hw=1) (Hw=1) (Hw=1) R R3 R..3 (1) AVA( 3.) 1 () AVD( 3.13) 35
40 (3) CC( 3.) CC=1 K1 #1 K 1 # #17 3
41 .5 Camellia B (1) AVA( 3.) 1 () AVD( 3.9) (Hw=1) (Hw=1) (Hw=1) (Hw=) (Hw=) (Hw=) 3 (3) CC( 3.1) CC=1 # # # () UKV( 3.3).5. (1bit) (1) AVA( 3.3) (Hw=1) (Hw=1) (Hw=1) R R3 1 R () AVD( 3.) (Hw=1) (Hw=1) (Hw=1) R R3 R (3) CC( 3.17) (Hw=1) (Hw=1) (Hw=1) R R3 CC=1 R R5.5.3 (19bit) (1) AVA( 3.) (Hw=1) (Hw=1) (Hw=1) R R3 1 R 37
42 () AVD( 3.11) (Hw=1) (Hw=1) (Hw=1) R R3 R (3) CC( 3.1) (Hw=1) (Hw=1) (Hw=1) R R3 CC=1 R R5.5. (5bit) (1) AVA( 3.5) (Hw=1) (Hw=1) (Hw=1) R R3 1 R () AVD( 3.1) (Hw=1) (Hw=1) (Hw=1) R R3 R (3) CC( 3.19) (Hw=1) (Hw=1) (Hw=1) R R3 CC=1 R R5.5.5 (1bit) (1) AVA( 3.) 1 () AVD( 3.13) (Hw=1) 1 (Hw=) (3) CC( 3.).5. (19bit) (1) AVA( 3.7) 1 () AVD( 3.) (Hw=1) 1 (Hw=) W W1 W W3 W W5 3
43 (3) CC( 3.1).5.7 (5bit) (1) AVA( 3.) 1 () AVD( 3.15) (Hw=1) 1 (Hw=) (3) CC( 3.) 39
44 . CIPHERUNICORN-A B...1 (1) AVA( 3.) () AVD( 3.9) (3) CC( 3.1) () UKV( 3.3).. (1bit) (1) AVA( 3.3) (Hw=1) (Hw=1) (Hw=1) R R3 () AVD( 3.) (Hw=1) (Hw=1) R R3 (3) CC( 3.17) (Hw=1) (Hw=1) (Hw=1) R R3..3 (19bit) (1) AVA( 3.) (Hw=1) (Hw=1) (Hw=1) R R3 () AVD( 3.11) (Hw=1) (Hw=1) R R3 (3) CC( 3.1)
45 (Hw=1) (Hw=1) (Hw=1) R R3.. (5bit) (1) AVA( 3.5) (Hw=1) (Hw=1) (Hw=1) R R3 () AVD( 3.1) (Hw=1) (Hw=1) R R3 (3) CC( 3.19) (Hw=1) (Hw=1) (Hw=1) R R3..5 (1bit) (1) AVA( 3.) () AVD( 3.13) (3) CC( 3.).. (19bit) (1) AVA( 3.) () AVD( 3.) (3) CC( 3.1) 1
46 ..7 (5bit) (1) AVA( 3.) () AVD( 3.15) (3) CC( 3.)
47 .7 Hierocrypt-3 B (1) AVA( 3.) (Hw=), = (Hw=) (Hw=1,), = (Hw=1) 1 () AVD( 3.9) (Hw=1,) = (Hw=1,) (Hw=1) (Hw=) (3) CC( 3.1) CC=1 () UKV( 3.3).7. (1bit) (1) AVA( 3.3) () AVD( 3.) (3) CC( 3.17).7.3 (19bit) (1) AVA( 3.) () AVD( 3.11) (3) CC( 3.1) 3
48 .7. (5bit) (1) AVA( 3.5) () AVD( 3.1) (3) CC( 3.19).7.5 (1bit) (1) AVA( 3.) 1 () AVD( 3.13) (Hw=1) 115 (Hw=) (3) CC( 3.) CC=1.7. (19bit) (1) AVA( 3.7) 1 () AVD( 3.) (Hw=1) 3 (Hw=) (3) CC( 3.1) CC=1.7.7 (5bit) (1) AVA( 3.) 1 () AVD( 3.15) (Hw=1) 9 (Hw=) (3) CC( 3.) CC=1
49 . MARS B...1 (1) AVA( 3.) 1 () AVD( 3.9) (3) CC( 3.1) () UKV( 3.3).. (1bit) (1) AVA( 3.3) () AVD( 3.) (3) CC( 3.17)..3 (19bit) (1) AVA( 3.) () AVD( 3.11) (3) CC( 3.1).. (5bit) (1) AVA( 3.5) () AVD( 3.1) (3) CC( 3.19) 5
50 ..5 (1bit) (1) AVA( 3.) 1 () AVD( 3.13) 1 (3) CC( 3.).. (19bit) (1) AVA( 3.7) 1 () AVD( 3.) 1 (3) CC( 3.1)..7 (5bit) (1) AVA( 3.) 1 () AVD( 3.15) 1 (3) CC( 3.)
51 .9 RC B (1) AVA( 3.) (Hw=1,) 1 () AVD( 3.9) (3) CC( 3.1) (Hw=1) (Hw=1) CC=1 () UKV( 3.3).9. 1bit 1bit (1) AVA( 3.3) (Hw=1) (Hw=1) (Hw=1) R R3 R R5 R () AVD( 3.) (Hw=1) (Hw=1) (Hw=1) R R3 R R5 (3) CC( 3.17) (Hw=1) (Hw=1) (Hw=1) R R3 R R5 R bit 19bit (1) AVA( 3.) (Hw=1) (Hw=1) (Hw=1) R R3 R R5 R 7
52 () AVD( 3.11) (Hw=1) (Hw=1) (Hw=1) R R3 R R5 (3) CC( 3.1) (Hw=1) (Hw=1) (Hw=1) R R3 R R5 R.9. 5bit 5bit (1) AVA( 3.5) (Hw=1) (Hw=1) (Hw=1) R R3 R R5 R () AVD( 3.1) (Hw=1) (Hw=1) (Hw=1) R R3 R R5 (3) CC( 3.19) (Hw=1) (Hw=1) (Hw=1) R R3 R R5 R.9.5 1bit 1bit (1) AVA( 3.) () AVD( 3.13) (3) CC( 3.).9. 19bit 19bit (1) AVA( 3.7) () AVD( 3.)
53 (3) CC( 3.1).9.7 5bit 5bit (1) AVA( 3.) () AVD( 3.15) (3) CC( 3.) 9
54 . SC B...1 (1) AVA( 3.) 1 () AVD( 3.9) (Hw=1) 7 (Hw=) (3) CC( 3.1) CC=1 # #1 #33 () UKV.. (1bit) (1) AVA( 3.3) (Hw=1) (Hw=1) (Hw=1) R R3 R () AVD( 3.) (Hw=1) (Hw=1) (Hw=1) R R3 R (3) CC( 3.17) (Hw=1) (Hw=1) (Hw=1) R R3 R..3 (19bit) (1) AVA( 3.) (Hw=1) (Hw=1) (Hw=1) R R3 R () AVD( 3.11) (Hw=1) (Hw=1) (Hw=1) R R3 R 5
55 (3) CC( 3.1) (Hw=1) (Hw=1) (Hw=1) R R3 R.. (5bit) (1) AVA( 3.5) (Hw=1) (Hw=1) (Hw=1) R R3 R () AVD( 3.1) (Hw=1) (Hw=1) (Hw=1) R R3 R (3) CC( 3.19) (Hw=1) (Hw=1) (Hw=1) R R3 R..5 (1bit) (1) AVA( 3.) () AVD( 3.13) (3) CC( 3.).. (19bit) (1) AVA( 3.7) () AVD( 3.) (3) CC( 3.1) CC=1 #1 ek[1]#3 ek[3]#31 51
56 ..7 (5bit) (1) AVA( 3.) () AVD( 3.15) (3) CC( 3.) CC=1 # ek[1]#31 ek[3]#3 5
57 A [UNIE] CIPHERUNICORN-E,. [FEAL] FEAL-NX,. [HIL1] :Hierocrypt-L1,. [MIST] MISTY1,. [CAME] 1 Camellia,. [UNIA] CIPHERUNICORN-A,. [HI3] :Hierocrypt-3,. [MARS] MARS(AES ),. [RC] RC,. [SC] SC,. [WT5] A. F. Webster and S.E. Tavares, On the Design of S-boxes, CRYPTO 5, pp.53-53, Springer-Verlag, 195. [F] R. Forre, The Strict Avalanche Criterion: Spectral Properties of Boolean Functions and an Extended Definition, CRYPTO, LNCS3, pp.5-, Springer-Verlag, 199. [KS97] K. Kurosawa and T. Satoh, Design of SAC/PC(l) of Order k Boolean Functions and Three Other Cryptographic Criteria, EUROCRYPT 97, LNCS133, pp.3-9, Springer-Verlag, [TOM] Y. Tsunoo, R. Ohta, H. Miyauchi and K. Nakamura, A Cipher Strength Evaluation System using PC s Power, SCIS-A53, The Symposium on Cryptography and Information Security, The Institute of Electronics, Information and Communication Engineers,. A-1
58 B (1) () (A) AVA Att.bit ( ) Rel.bit (B) AVD Att.bit ( ) Rel.bit (3) B-1
59 () Rel. bit A( ). A(3 ) B-
60 B B.1 CIPHERUNICORN-E Rel. bit B.1.1 UNIE (Hw=1) AVA B.1-1
61 B.1 B.1 B.1 B.1- B.1. UNIE (Hw=1) AVA Rel. bit
62 Rel. bit B.1.3 UNIE (Hw=1) AVD B.1-3
63 B.1 B.1 B.1 B.1- B.1. UNIE (Hw=1) AVD Rel. bit
64 Rel. bit B.1.5 UNIE (Hw=1) R AVA B.1-5
65 Rel. bit B.1. UNIE (Hw=1) R AVD B.1-
66 B.1 B.1 B.1 B.1-7 B.1.7 UNIE (Hw=1) AVA(1/) Rel. bit
67 B.1 B.1 B.1 B.1- B.1. UNIE (Hw=1) AVA(/) Rel. bit bit 5bit
68 B B. FEAL-NX Rel. bit B..1 FEAL (Hw=1) AVA Rel. bit B.. FEAL (Hw=1) AVA B.-1
69 Rel. bit B..3 FEAL (Hw=1) AVD Rel. bit B.. FEAL (Hw=1) AVD B.-
70 Rel. bit B..5 FEAL (Hw=1) R AVA B.-3
71 Rel. bit B.. FEAL (Hw=1) R AVD B.-
72 B. B. B. B.-5 Rel. bit B..7 FEAL (Hw=1) AVA(1/)
73 B. B. B. B.- Rel. bit B.. FEAL (Hw=1) AVA(/) 5bit 5bit
74 B B.3 Hierocrypt-L Rel. bit / B.3.1 HiL1 (Hw=1) AVA B.3-1
75 B.3 B.3 B.3 B.3- Rel. bit B.3. HiL1 (Hw=1) AVA
76 Rel. bit / B.3.3 HiL1 (Hw=1) AVD B.3-3
77 B.3 B.3 B.3 B.3- Rel. bit B.3. HiL1 (Hw=1) AVD
78 Rel. bit B.3.5 HiL1 (Hw=1) R AVA B.3-5
79 Rel. bit B.3. HiL1 (Hw=1) R AVD B.3-
80 B.3 B.3 B.3 B.3-7 Rel. bit B.3.7 HiL1 (Hw=1) AVA(1/)
81 B.3 B.3 B.3 B.3- Rel. bit B.3. HiL1 (Hw=1) AVA(/) 5bit 5bit
82 B B. MISTY1 Rel. bit B..1 MIST (Hw=1) AVA B.-1
83 B. B. B. B.- Rel. bit B.. MIST (Hw=1) AVA
84 Rel. bit B..3 MIST (Hw=1) AVD B.-3
85 B. B. B. B.- Rel. bit B.. MIST (Hw=1) AVD
86 Rel. bit B..5 MIST (Hw=1) R AVA B.-5
87 Rel. bit B.. MIST (Hw=1) R AVD B.-
88 B. B. B. B.-7 Rel. bit B..7 MIST (Hw=1) AVA(1/)
89 B. B. B. B.- Rel. bit B.. MIST (Hw=1) AVA(/) 5bit 5bit
90 B B.5 Camellia Rel. bit B.5.1 Came (Hw=1) AVA B.5-1
91 B.5 B.5 B.5 B.5- Rel. bit B.5. Came (Hw=1) AVA
92 B.5 B.5 B.5 B.5-3 B.5.3 Came (Hw=1) AVD Rel. bit
93 B.5 B.5 B.5 B.5- Rel. bit B.5. Came (Hw=1) AVD
94 B.5 B.5 B.5 B.5-5 B.5.5 Came (1bit) (Hw=1) R AVA Rel. bit
95 B.5 B.5 B.5 B.5- Rel. bit B.5. Came (1bit) (Hw=1) R AVD
96 B.5 B.5 B.5 B.5-7 B.5.7 Came (1bit) (Hw=1) AVA(1/) Rel. bit
97 B.5 B.5 B.5 B.5- Rel. bit B.5. Came (1bit) (Hw=1) AVA(/) 5bit 5bit
98 B B. CIPHERUNICORN-A Rel. bit B..1 UNIA (Hw=1) AVA B.-1
99 B. B. B. B.- Rel. bit B.. UNIA (Hw=1) AVA
100 B. B. B. B.-3 Rel. bit B..3 UNIA (Hw=1) AVD
101 B. B. B. B.- Rel. bit B.. UNIA (Hw=1) AVD
102 B. B. B. B.-5 Rel. bit B..5 UNIA (1bit) (Hw=1) R AVA
103 B. B. B. B.- Rel. bit B.. UNIA (1bit) (Hw=1) R AVD
104 B. B. B. B.-7 Rel. bit B..7 UNIA (1bit) (Hw=1) AVA(1/)
105 B. B. B. B.- Rel. bit B.. UNIA (1bit) (Hw=1) AVA(/) 5bit 5bit
106 B.7 B.7 B.7 B.7-1 B B.7 B.7 B.7 B.7 Hierocrypt Hierocrypt Hierocrypt Hierocrypt-3 B.7.1 Hi3 (Hw=1) AVA Rel. bit /
107 B.7 B.7 B.7 B.7- B.7. Hi3 (Hw=1) AVA(1/) Rel. bit /
108 B.7 B.7 B.7 B.7-3 Rel. bit B.7.3 Hi3 (Hw=1) AVA(/) 1/
109 B.7 B.7 B.7 B.7- Rel. bit B.7. Hi3 (Hw=1) AVD 1/
110 B.7 B.7 B.7 B.7-5 Rel. bit B.7.5 Hi3 (Hw=1) AVD(1/) 1/
111 B.7 B.7 B.7 B.7- Rel. bit B.7. Hi3 (Hw=1) AVD(/) 1/
112 B.7 B.7 B.7 B.7-7 Rel. bit B.7.7 Hi3 (1bit) (Hw=1) R AVA
113 B.7 B.7 B.7 B.7- Rel. bit B.7. Hi3 (1bit) (Hw=1) R AVD
114 B.7 B.7 B.7 B.7-9 Rel. bit B.7.9 Hi3 (1bit) (Hw=1) AVA(1/)
115 B.7 B.7 B.7 B.7- Rel. bit B.7. Hi3 (1bit) (Hw=1) AVA(/) 5bit 5bit
116 B. B. B. B.-1 B B. B. B. B. MARS MARS MARS MARS B..1 MARS (Hw=1) AVA Rel. bit Rel. bit B.. MARS (Hw=1) AVA
117 B. B. B. B.- Rel. bit B..3 MARS (Hw=1) AVD Rel. bit B.. MARS (Hw=1) AVD
118 B. B. B. B.-3 Rel. bit B..5 MARS (1bit) (Hw=1) R AVA
119 B. B. B. B.- Rel. bit B.. MARS (1bit) (Hw=1) R AVD
120 B. B. B. B.-5 Rel. bit B..7 MARS (1bit) (Hw=1) AVA(1/)
121 B. B. B. B.- Rel. bit B.. MARS (1bit) (Hw=1) AVA(/) 5bit 5bit
122 B B.9 RC Rel. bit B.9.1 RC (Hw=1) AVA B.9-1
123 B.9 B.9 B.9 B.9- Rel. bit B.9. RC (Hw=1) AVA
124 B.9 B.9 B.9 B.9-3 Rel. bit B.9.3 RC (Hw=1) AVD
125 B.9 B.9 B.9 B.9- B.9. RC (Hw=1) AVD Rel. bit
126 B.9 B.9 B.9 B.9-5 B.9.5 RC (1bit) (Hw=1) R AVA Rel. bit
127 B.9 B.9 B.9 B.9- Rel. bit B.9. RC (1bit) (Hw=1) R AVD
128 B.9 B.9 B.9 B.9-7 B.9.7 RC (1bit) (Hw=1) AVA(1/) Rel. bit
129 B.9 B.9 B.9 B.9- Rel. bit B.9. RC (1bit) (Hw=1) AVA(/) 5bit 5bit
130 B B. SC Rel. bit B..1 SC (Hw=1) AVA B.-1
131 B. B. B. B.- B.. SC (Hw=1) AVD Rel. bit
132 B. B. B. B.-3 B..3 SC (1bit) (Hw=1) R AVA Rel. bit
133 B. B. B. B.- B.. SC (1bit) (Hw=1) R AVD Rel. bit
134 B. B. B. B.-5 Rel. bit B..5 SC (1bit) (Hw=1) AVA(1/)
135 B. B. B. B.- Rel. bit B.. SC (1bit) (Hw=1) AVA(/) 5bit 5bit
136 C C.1 CIPHERUNICORN-E (1) unsigned int F ( int r, unsigned int x ) r: (=) x: (3bit) EK.fk[r][]:3bit EK.fk[r][1]:3bit EK.sk[r][]:3bit EK.sk[r][1]:3bit (3bit) () void CipherUnicornEncode ( unsigned int *p, unsigned int *c ) p: (3bit ) void CipherUnicornScheduler(unsigned int *k) k: (3bit ) c: (3bit ) (3) void CipherUnicornScheduler ( unsigned int *k ) k: (3bit ) EK: (bit) C-1
137 C. FEAL-NX (1) void FEAL_F ( unsigned char *a, unsigned char *b, unsigned char *e ) b: ( ) e[]: e[1]: a: ( ) () void FEAL_encrypt ( unsigned char *p, unsigned int r, unsigned char *e, unsigned char *c ) p: (bit ) r: (=3) void FEAL_keygen(k, e, r) k: (bit 1) e: (bit ) c: (bit ) (3) void FEAL_keygen ( unsigned char *k, unsigned char *e, unsigned int r ) r: (=3) k: (bit 1) e: (bit ) C-
138 C.3 Hierocrypt-L1 (1) () (3) void hcryptl1_encrypt ( unsigned char *in, unsigned char *out, unsigned char *ks ) hcryptl1_xs() in: (bit ) n=1 ks: (bit 1) ks[][][] out: (bit ) void hcryptl1_encrypt ( unsigned char *in, unsigned char *out, unsigned char *ks ) in: (bit ) void hcryptl1_setkey(key, ks) key: (bit 1) ks: (bit 11) out: (bit ) void hcryptl1_setkey ( unsigned char *key, unsigned char *ks ) key: (bit 1) ks: (bit 11) C-3
139 C. MISTY1 (1) () void FO_txt ( unsigned short a, unsigned short a1, unsigned short a, unsigned short a3, int r ) r: (=) a, a1: ( 1bit) EXTKEY[][](1bit) EXTKEY[][5](9bit) EXTKEY[3][5](7bit) EXTKEY[][] (1bit) EXTKEY[][1] (9bit) EXTKEY[3][1] (7bit) EXTKEY[][7] (1bit) EXTKEY[][3] (9bit) EXTKEY[3][3] (7bit) EXTKEY[][] (1bit) a, a3: ( 1bit) void misty1 ( unsigned char *text, unsigned char *key, int block, int mode ) text: (bit ) block: (1 ) mode: / ( ) FI_key(k) key: (bit 1) text: (bit ) C-
140 (3) FI_key ( int k ) k: (=-7) key: (bit 1) EXTKEY[][],[1][]: (5bit) EXTKEY[][],[3][] EXTKEY[1][] C-5
141 C.5 Camellia (1) void Camellia_Feistel ( const unsigned char *x, const unsigned char *k, unsigned char *y ) x: (bit ) k: bit y: (bit ) () void Camellia_Encrypt ( const int n, const unsigned char *p, const unsigned char *e, unsigned char *c ) n: (1 or 19 or 5) p: (bit 1) void Camellia_Ekeygen(n, k, e ) n: (1 or 19 or 5) k: (bit 1 or or 3) e: (bit 7) c: (bit 1) (3) void Camellia_Ekeygen ( const int n, const unsigned char *k, unsigned char *e ) n: (1 or 19 or 5) k: (bit 1 or or 3) e: (bit 7) C-
142 C. CIPHERUNICORN RN-A (1) void F ( unsigned long ida, unsigned long idb, unsigned long *k, unsigned long *oda, unsigned long *odb ) ida, idb:( 3bit) k:(3bit ) oda, odb:( 3bit) () void Encode ( ulong *p, ulong *c ) p: (3bit ) void Sche(unsigned long *mk) mk: (3bit LINE) LINE= /3 c: (3bit ) (3) void Sche ( unsigned long *mk ) mk: (3bit LINE) LINE= /3 unsigned long IK[] unsigned long EK[1][] C-7
143 C.7 Hierocrypt-3 (1) void hcrypt_encrypt ( unsigned char *in, unsigned char *out, unsigned char *ks, int key_len ) hcrypt_xs() in: (bit 1) key_len: (key_len=-1: n=1 ) ks: (bit 3) ks[][][] out: (bit 1) () void hcrypt_encrypt ( unsigned char *in, unsigned char *out, unsigned char *ks, int key_len ) in: (bit 1) key_len: (1 or 19 or 5) void hcrypt_setkey(key, ks, key_len) key: (bit 1 or or 3) ks: (bit ) key_len: (1 or 19 or 5) out: (bit 1) (3) void hcrypt_setkey ( unsigned char *key, unsigned char *ks, int key_len ) key_len: (1 or 19 or 5) key: (bit 1 or or 3) ks: (bit ) C-
144 C. MARS (1) void E_func ( unsigned long Ida, unsigned long *ex1, unsigned long *ex, unsigned long *ex3, unsigned long *pkey ) Ida: (3bit) pkey: (3bit ) ex1, ex, ex3: (3bit 3) () void Encode ( unsigned long *Idata, unsigned long *Odata, unsigned long *ek ) Idata: (3bit ) void KeySchedule(length,skey,pkey) length: (1 or 19 or 5) skey: (3bit or or ) pkey: (3bit ) Odata: (3bit ) (3) void KeySchedule ( unsigned long length, unsigned long *skey, unsigned long *pkey ) length: (1 or 19 or 5) skey: (3bit or or ) pkey: (3bit ) C-9
145 C.9 RC (1) void RcEncryptBlock ( unsigned long *S, unsigned char *plaintext,, unsigned char *ciphertext ) pre-,post-whitening plaintext: (bit 1) []-[7],[1]-[15] []-[3],[]-[11] ROUNDS:1 define S[]: (3bit ) S[],S[3] ciphertext: (bit 1) []-[7],[1]-[15] () void RcEncryptBlock ( unsigned long *S, unsigned char *plaintext,, unsigned char *ciphertext ) plaintext: (bit 1) void RcComputeKeySchedule(key,KeyLengthInBytes,S) key: (bit 1 or or 3) KeyLengthInBytes: (1 or or 3) S: (3bit ) ciphertext: (bit 1) (3) void RcComputeKeySchedule ( unsigned char *key, int KeyLengthInBytes, unsigned long *S ) KeyLengthInBytes: (1 or or 3) key: (bit 1 or or 3) S: (3bit ) C-
146 C. SC (1) () void F_func ( unsigned long a, unsigned long b, unsigned long mask, unsigned long *c, unsigned long *d ) a,b: (3bit ) mask: (=x ) c,d: (3bit ) void encrypt ( unsigned long *out, unsigned long *in, unsigned long *ek, unsigned long keylength ) in: (3bit ) keylength: (1 or 19 or 5) void make_key(ekey, ukey, keylength) ekey: (ek: (3bit 5 or ) 1bit 5, 19 or 5bit ukey: (3bit or or ) keylength: (1 or 19 or 5) out: (3bit ) C-11
147 (3) void make_key ( unsigned long *ekey, unsigned long *ukey, unsigned long keylength ) keylength: (1 or 19 or 5) ukey: (3bit or or ) ek: (3bit 5 or ) 1bit 5, 19 or 5bit C-1
*.....J.....S.q..2013B_....
1 1 2 2 3 3 4 4 5 6 5 7 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66
卒論 提出用ファイル.doc
11 13 1LT99097W (i) (ii) 0. 0....1 1....3 1.1....3 1.2....4 2....7 2.1....7 2.2....8 2.2.1....8 2.2.2....9 2.2.3.... 10 2.3.... 12 3.... 15 Appendix... 17 1.... 17 2.... 19 3.... 20... 22 (1) a. b. c.
90 120.0 80 70 72.8 75.1 76.7 78.6 80.1 80.1 79.6 78.5 76.8 74.8 72.4 69.5 95.6% 66.4 100.0 60 80.0 50 40 60.0 30 48.3% 38.0% 40.0 20 10 10.4% 20.0 0 S60 H2 H7 H12 H17 H22 H27 H32 H37 H42 H47 H52 H57 0.0
For_Beginners_CAPL.indd
CAPL Vector Japan Co., Ltd. 目次 1 CAPL 03 2 CAPL 03 3 CAPL 03 4 CAPL 04 4.1 CAPL 4.2 CAPL 4.3 07 5 CAPL 08 5.1 CANoe 5.2 CANalyzer 6 CAPL 10 7 CAPL 11 7.1 CAPL 7.2 CAPL 7.3 CAPL 7.4 CAPL 16 7.5 18 8 CAPL
HyRAL®FPGA設計仕様書
HyRAL Encryption FPGA HyRAL FPGA 2009/12/ 13 2 2010/01/11 3. FPGA 3.1. Const1, 2,3 3.3.ciphergen 3.3.6. 3.4. Decrypt 4 3 2010/01/26 1. i 1.... 1 2.... 1 2.1. FPGA... 1 2.2.... 1 2.3.... 1 2.4. IP... 1
/* sansu1.c */ #include <stdio.h> main() { int a, b, c; /* a, b, c */ a = 200; b = 1300; /* a 200 */ /* b 200 */ c = a + b; /* a b c */ }
C 2: A Pedestrian Approach to the C Programming Language 2 2-1 2.1........................... 2-1 2.1.1.............................. 2-1 2.1.2......... 2-4 2.1.3..................................... 2-6
‚æ4›ñ
( ) ( ) ( ) A B C D E F G H I J K L M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m n o p q r s t u v w x y z 0 1 2 3 4 5 6 7 8 9 (OUS) 9 26 1 / 28 ( ) ( ) ( ) A B C D Z a b c d z 0 1 2 9 (OUS) 9
(Version: 2017/4/18) Intel CPU 1 Intel CPU( AMD CPU) 64bit SIMD Inline Assemler Windows Visual C++ Linux gcc 2 FPU SSE2 Intel CPU do
(Version: 2017/4/18) Intel CPU (kashi@waseda.jp) 1 Intel CPU( AMD CPU) 64bit SIMD Inline Assemler Windows Visual C++ Linux gcc 2 FPU SSE2 Intel CPU double 8087 FPU (floating point number processing unit)
Informatics 2010.key
http://math.sci.hiroshima-u.ac.jp/ ~ryo/lectures/informatics2010/ 1 2 C ATM etc. etc. (Personal Computer) 3 4 Input Output Device Central Processing Unit I/O CPU Memory 5 6 (CPU),,... etc. C, Java, Fortran...
64bit SSE2 SSE2 FPU Visual C++ 64bit Inline Assembler 4 FPU SSE2 4.1 FPU Control Word FPU 16bit R R R IC RC(2) PC(2) R R PM UM OM ZM DM IM R: reserved
(Version: 2013/5/16) Intel CPU (kashi@waseda.jp) 1 Intel CPU( AMD CPU) 64bit SIMD Inline Assemler Windows Visual C++ Linux gcc 2 FPU SSE2 Intel CPU double 8087 FPU (floating point number processing unit)
福岡大学人文論叢47-3
679 pp. 1 680 2 681 pp. 3 682 4 683 5 684 pp. 6 685 7 686 8 687 9 688 pp. b 10 689 11 690 12 691 13 692 pp. 14 693 15 694 a b 16 695 a b 17 696 a 18 697 B 19 698 A B B B A B B A A 20 699 pp. 21 700 pp.
Block cipher
18 12 9 1 2 1.1............................... 2 1.2.................. 2 1.3................................. 4 1.4 Block cipher............................. 4 1.5 Stream cipher............................
1 (1) X = AB + AB, Y = C D + C D, Z = AD + AD P A, B, C, D P = (XY + X Y + X Y )(Y Z + Y Z + Y Z )(ZX + Z X + Z X ) (2) Q A, B, C, D Q = AB C D + AB C
平成 28 年度 10 月期入学 / 平成 29 年度 4 月期入学京都大学大学院情報学研究科修士課程システム科学専攻入学者選抜試験問題 専門科目 試験日時 : 平成 28 年 8 月 8 日 ( 月 ) 午後 1 時 00 分より同 4 時 00 分 問題冊子頁数 ( 表紙 中表紙 裏表紙を除いて ): 15 頁 選択科目 : 下記の科目のうち 2 科目を選択し解答すること 注意 : 論理回路 (3)
2011 Future University Hakodate 2011 System Information Science Practice Group Report Project Name Visualization of Code-Breaking RSA Group Name RSA C
2011 Future University Hakodate 2011 System Information Science Practice Group Report Project Name RSA Group Name RSA Code Elliptic Curve Cryptograrhy Group /Project No. 13-B /Project Leader 1009087 Takahiro
- 2 -
- 2 - - 3 - (1) (2) (3) (1) - 4 - ~ - 5 - (2) - 6 - (1) (1) - 7 - - 8 - (i) (ii) (iii) (ii) (iii) (ii) 10 - 9 - (3) - 10 - (3) - 11 - - 12 - (1) - 13 - - 14 - (2) - 15 - - 16 - (3) - 17 - - 18 - (4) -
2 1980 8 4 4 4 4 4 3 4 2 4 4 2 4 6 0 0 6 4 2 4 1 2 2 1 4 4 4 2 3 3 3 4 3 4 4 4 4 2 5 5 2 4 4 4 0 3 3 0 9 10 10 9 1 1
1 1979 6 24 3 4 4 4 4 3 4 4 2 3 4 4 6 0 0 6 2 4 4 4 3 0 0 3 3 3 4 3 2 4 3? 4 3 4 3 4 4 4 4 3 3 4 4 4 4 2 1 1 2 15 4 4 15 0 1 2 1980 8 4 4 4 4 4 3 4 2 4 4 2 4 6 0 0 6 4 2 4 1 2 2 1 4 4 4 2 3 3 3 4 3 4 4
20 15 14.6 15.3 14.9 15.7 16.0 15.7 13.4 14.5 13.7 14.2 10 10 13 16 19 22 1 70,000 60,000 50,000 40,000 30,000 20,000 10,000 0 2,500 59,862 56,384 2,000 42,662 44,211 40,639 37,323 1,500 33,408 34,472
I? 3 1 3 1.1?................................. 3 1.2?............................... 3 1.3!................................... 3 2 4 2.1........................................ 4 2.2.......................................
1 (1) (2)
1 2 (1) (2) (3) 3-78 - 1 (1) (2) - 79 - i) ii) iii) (3) (4) (5) (6) - 80 - (7) (8) (9) (10) 2 (1) (2) (3) (4) i) - 81 - ii) (a) (b) 3 (1) (2) - 82 - - 83 - - 84 - - 85 - - 86 - (1) (2) (3) (4) (5) (6)
http://www.ipa.go.jp/security/ Contents 1. NIST 2010 2. NISC 3. CRYPTREC 2008 10 28 Copyrignt 2008, IPA all right reserved. 2 1977 MAC) PKI PKI PKI: (Public Key Infrastructure) 2008 10 28 Copyrignt 2008,
1. A0 A B A0 A : A1,...,A5 B : B1,...,B
1. A0 A B A0 A : A1,...,A5 B : B1,...,B12 2. 3. 4. 5. A0 A B f : A B 4 (i) f (ii) f (iii) C 2 g, h: C A f g = f h g = h (iv) C 2 g, h: B C g f = h f g = h 4 (1) (i) (iii) (2) (iii) (i) (3) (ii) (iv) (4)
one way two way (talk back) (... ) C.E.Shannon 1948 A Mathematical theory of communication. 1 ( ) 0 ( ) 1
1 1.1 1.2 one way two way (talk back) (... ) 1.3 0 C.E.Shannon 1948 A Mathematical theory of communication. 1 ( ) 0 ( ) 1 ( (coding theory)) 2 2.1 (convolution code) (block code), 3 3.1 Q q Q n Q n 1 Q
BIT -2-
2004.3.31 10 11 12-1- BIT -2- -3-256 258 932 524 585 -4- -5- A B A B AB A B A B C AB A B AB AB AB AB -6- -7- A B -8- -9- -10- mm -11- fax -12- -13- -14- -15- s58.10.1 1255 4.2 30.10-16- -17- -18- -19-6.12.10
64bit SSE2 SSE2 FPU Visual C++ 64bit Inline Assembler 4 FPU SSE2 4.1 FPU Control Word FPU 16bit R R R IC RC(2) PC(2) R R PM UM OM ZM DM IM R: reserved
(Version: 2013/7/10) Intel CPU (kashi@waseda.jp) 1 Intel CPU( AMD CPU) 64bit SIMD Inline Assemler Windows Visual C++ Linux gcc 2 FPU SSE2 Intel CPU double 8087 FPU (floating point number processing unit)
Informatics 2014
C 計算機の歴史 手回し計算機 新旧のソロバン バベッジの階差機関 スパコン ENIAC (1946) パソコン 大型汎用計算機 電卓 現在のコンピュータ Input Output Device Central Processing Unit I/O CPU Memory OS (Operating System) OS Windows 78, Vista, XP Windows Mac OS X
joho07-1.ppt
0xbffffc5c 0xbffffc60 xxxxxxxx xxxxxxxx 00001010 00000000 00000000 00000000 01100011 00000000 00000000 00000000 xxxxxxxx x y 2 func1 func2 double func1(double y) { y = y + 5.0; return y; } double func2(double*
(Requirements in communication) (efficiently) (Information Theory) (certainly) (Coding Theory) (safely) (Cryptography) I 1
(Requirements in communication) (efficiently) (Information Theory) (certainly) (oding Theory) (safely) (ryptography) I 1 (Requirements in communication) (efficiently) (Information Theory) (certainly) (oding
25 II :30 16:00 (1),. Do not open this problem booklet until the start of the examination is announced. (2) 3.. Answer the following 3 proble
25 II 25 2 6 13:30 16:00 (1),. Do not open this problem boolet until the start of the examination is announced. (2) 3.. Answer the following 3 problems. Use the designated answer sheet for each problem.
untitled
API API Part 1 10API 25 10API Part2 Copyright (c) 2004 NPO Page 2 Copyright (C) 2004 NPO JNSA 1 API API Wassenaar API Copyright (c) 2004 NPO Page 4 Copyright (C) 2004 NPO JNSA 2 56 512512 112 IC 1 I II
暗号方式委員会報告（CRYPTRECシンポジウム2012）
暗号方式委員会活動報告 安全性 実装性能評価リスト入りまでの基本的な流れ 事務局選出暗号 公募暗号技術 現リスト掲載暗号 次期リスト 電子政府推奨暗号リスト 推奨候補暗号リスト 運用監視暗号リスト 現リストのカテゴリ 技術分類公開鍵暗号共通鍵暗号その他 署名守秘鍵共有 64ビットブロック暗号 128 ビットブロック暗号 ストリーム暗号 ハッシュ関数 擬似乱数生成系 現リスト : 公開鍵暗号 技術分類
特集_03-07.Q3C
3-7 Error Detection and Authentication in Quantum Key Distribution YAMAMURA Akihiro and ISHIZUKA Hirokazu Detecting errors in a raw key and authenticating a private key are crucial for quantum key distribution
(300, 150) 120 getchar() HgBox(x, y, w, h) (x, y), w, h #include <stdio.h> #include <handy.h> int main(void) { int i; double w, h; } HgO
Handy Graphic for Handy Graphic Version 0.5 2008-06-09 1 Handy Graphic Handy Graphic C Handy Graphic Handy Graphic Mac OS X Handy Graphic HgDisplayer Handy Graphic HgDisplayer 2 Handy Graphic 1 Handy Graphic
Microsoft Word - .....J.^...O.|Word.i10...j.doc
P 1. 2. R H C H, etc. R' n R' R C R'' R R H R R' R C C R R C R' R C R' R C C R 1-1 1-2 3. 1-3 1-4 4. 5. 1-5 5. 1-6 6. 10 1-7 7. 1-8 8. 2-1 2-2 2-3 9. 2-4 2-5 2-6 2-7 10. 2-8 10. 2-9 10. 2-10 10. 11. C
selfimage
Mr,M !!? ??? ? 20 ~! =! ! ??? ? m! ?! ?? ? 1? ? ?!!!! STEP1 STEP1 1 2 3 4 5 6 7 8 8? STEP2? 10 ( 5 12 STEP3?! ( STEP4? STEP1~STEP3 STEP4 STEP5? STEP1? ' 1000??! STEP6 STEP5 100% STEP6 ( 1000 STEP7? STEP6
Microsoft Word - Sample_CQS-Report_English_backslant.doc
***** Corporation ANSI C compiler test system System test report 2005/11/16 Japan Novel Corporation *****V43/NQP-DS-501-1 Contents Contents......2 1. Evaluated compiler......3 1.1. smp-compiler compiler...3
Informatics 2015
C 計算機の歴史 新旧のソロバン バベッジの階差機関 19C前半 手回し計算機 19C後半 20C後半 スパコン 1960年代 ENIAC (1946) 大型汎用計算機 1950年代 1980年代 電卓 1964 パソコン 1970年代 現在のコンピュータ Input Output Device Central Processing Unit I/O CPU Memory OS (Operating
１ 食品安全を主な目的とする取組
--a 2003 7 26 3. 3.1-1- 16 2 27 0227012-2-a 23 7 1 82 2 1 7 9 2 ( ) -2- -2-b 19 3 28 18 14701-2-c ) 15 5 2-3- 26 21 7 2 2 7 2 3 7 2 4 10 83 23 3 1 7 2 5 7 2 5-2-d -4- -5 - -3-a -6- -4-a -7- -4-b -8- -5-a
soturon.dvi
12 Exploration Method of Various Routes with Genetic Algorithm 1010369 2001 2 5 ( Genetic Algorithm: GA ) GA 2 3 Dijkstra Dijkstra i Abstract Exploration Method of Various Routes with Genetic Algorithm
解きながら学ぶJava入門編
44 // class Negative { System.out.print(""); int n = stdin.nextint(); if (n < 0) System.out.println(""); -10 Ÿ 35 Ÿ 0 n if statement if ( ) if i f ( ) if n < 0 < true false true false boolean literalboolean
Java Java Java Java Java 4 p * *** ***** *** * Unix p a,b,c,d 100,200,250,500 a*b = a*b+c = a*b+c*d = (a+b)*(c+d) = 225
Java Java Java Java Java 4 p35 4-2 * *** ***** *** * Unix p36 4-3 a,b,c,d 100,200,250,500 a*b = 20000 a*b+c = 20250 a*b+c*d = 145000 (a+b)*(c+d) = 225000 a+b*c+d = 50600 b/a+d/c = 4 p38 4-4 (1) mul = 1
untitled
1 (1) (2) (3) (4) (1) (2) (3) (1) (2) (3) (1) (2) (3) (4) (5) (1) (2) (3) (1) (2) 10 11 12 2 2520159 3 (1) (2) (3) (4) (5) (6) 103 59529 600 12 42 4 42 68 53 53 C 30 30 5 56 6 (3) (1) 7 () () (()) () ()
,,,,., C Java,,.,,.,., ,,.,, i
24 Development of the programming s learning tool for children be derived from maze 1130353 2013 3 1 ,,,,., C Java,,.,,.,., 1 6 1 2.,,.,, i Abstract Development of the programming s learning tool for children
?
240-8501 79-2 Email: nakamoto@ynu.ac.jp 1 3 1.1...................................... 3 1.2?................................. 6 1.3..................................... 8 1.4.......................................
W810 QX100 QX30 QX10 W810 QX100 QX30 QX10 RX100 RX100 WX500 WX350 RX100 RX100 HX400V HX90V HX60V RX100 RX100 RX100 RX100 HX400V HX90V HX60V WX500 WX350 RX100 RX100 WX500 WX350 RX100 RX100 HX400V HX90V
WAGO Profibus /-833及び三菱MELSEC Q02HCPU/QJ71PB92Dのコンフィグレーション
Version2.0(2009.2.6) Copyright 2008 by WAGO Kontakttechnik GmbH All rights reserved. WAGO Kontakttechnik GmbH Hansastraße 27 D-32423 Minden Phone: +49 (0) 571/8 87 0 Fax: +49 (0) 571/8 87 1 69 E-Mail:
FX ) 2
(FX) 1 1 2009 12 12 13 2009 1 FX ) 2 1 (FX) 2 1 2 1 2 3 2010 8 FX 1998 1 FX FX 4 1 1 (FX) () () 1998 4 1 100 120 1 100 120 120 100 20 FX 100 100 100 1 100 100 100 1 100 1 100 100 1 100 101 101 100 100
( )
( ) Page 2 Page 3 0 = 1 = Page 4 1 0 13 = 8 + 4 + 1 = 2 3 1 + 2 2 1 + 2 1 0 + 2 0 1 = 1101 ( ) b n 1 b n 2 b 0 (b n 1,,b 0 {0,1}) = 2 n 1 b n 1 + 2 n 2 b n 2 + + 2 0 b 0 n n bit( ) Page 5 n n n {}}{{}}{
1 28 6 12 7 1 7.1...................................... 2 7.1.1............................... 2 7.1.2........................... 2 7.2...................................... 3 7.3...................................
(Visual Secret Sharing Scheme) VSSS VSSS 3 i
13 A Visual Secret Sharing Scheme for Continuous Color Images 10066 14 8 (Visual Secret Sharing Scheme) VSSS VSSS 3 i Abstract A Visual Secret Sharing Scheme for Continuous Color Images Tomoe Ogawa The
PC Windows 95, Windows 98, Windows NT, Windows 2000, MS-DOS, UNIX CPU
1. 1.1. 1.2. 1 PC Windows 95, Windows 98, Windows NT, Windows 2000, MS-DOS, UNIX CPU 2. 2.1. 2 1 2 C a b N: PC BC c 3C ac b 3 4 a F7 b Y c 6 5 a ctrl+f5) 4 2.2. main 2.3. main 2.4. 3 4 5 6 7 printf printf
() () () 200,000 160,000 120,000 80,000 40,000 3.3 144,688 43,867 3.1 162,624 52,254 170,934 171,246 172,183 3 2.8 2.6 57,805 61,108 65,035 3.5 3 2.5 2 1.5 1 0.5 0 0 2 7 12 17 22 10.1 12.7 17 22.3 73.4
x h = (b a)/n [x i, x i+1 ] = [a+i h, a+ (i + 1) h] A(x i ) A(x i ) = h 2 {f(x i) + f(x i+1 ) = h {f(a + i h) + f(a + (i + 1) h), (2) 2 a b n A(x i )
![x h = (b a)/n [x i, x i+1 ] = [a+i h, a+ (i + 1) h] A(x i ) A(x i ) = h 2 {f(x i) + f(x i+1 ) = h {f(a + i h) + f(a + (i + 1) h), (2) 2 a b n A(x i )](/thumbs/92/107866678.jpg "x h = (b a)/n [x i, x i+1 ] = [a+i h, a+ (i + 1) h] A(x i ) A(x i ) = h 2 {f(x i) + f(x i+1 ) = h {f(a + i h) + f(a + (i + 1) h), (2) 2 a b n A(x i )")
1 f(x) a b f(x)dx = n A(x i ) (1) ix [a, b] n i A(x i ) x i 1 f(x) [a, b] n h = (b a)/n y h = (b-a)/n y = f (x) h h a a+h a+2h a+(n-1)h b x 1: 1 x h = (b a)/n [x i, x i+1 ] = [a+i h, a+ (i + 1) h] A(x
2007-Kanai-paper.dvi
19 Estimation of Sound Source Zone using The Arrival Time Interval 1080351 2008 3 7 S/N 2 2 2 i Abstract Estimation of Sound Source Zone using The Arrival Time Interval Koichiro Kanai The microphone array
mahoro/2011autumn/crypto/
http://www.ss.u-tokai.ac.jp/ mahoro/2011autumn/crypto/ 1 1 2011.9.29, ( ) http://www.ss.u-tokai.ac.jp/ mahoro/2011autumn/crypto/ 1.1 1.1.1 DES MISTY AES 1.1.2 RSA ElGamal 2 1 1.2 1.2.1 1.2.2 1.3 Mathematica
/ ( ) 1 1.1 323 206 23 ( 23 529 529 323 206 ) 23 1.2 33 1.3 323 61 61 3721 3721 323 168 168 323 23 61 61 23 1403 323 111 111 168 206 323 47 111 323 47 2 23 2 2.1 34 2 2.2 2 a, b N a b N a b (mod N) mod
Java演習(4) -- 変数と型 --
50 20 20 5 (20, 20) O 50 100 150 200 250 300 350 x (reserved 50 100 y 50 20 20 5 (20, 20) (1)(Blocks1.java) import javax.swing.japplet; import java.awt.graphics; (reserved public class Blocks1 extends
K227 Java 2
1 K227 Java 2 3 4 5 6 Java 7 class Sample1 { public static void main (String args[]) { System.out.println( Java! ); } } 8 > javac Sample1.java 9 10 > java Sample1 Java 11 12 13 http://java.sun.com/j2se/1.5.0/ja/download.html
paper.dvi
28 Confined Decoding System for Medical Data Distributed by Secret Sharing Scheme and Its Security Evaluation 1195046 2017 3 6 DMAT i Abstract Confined Decoding System for Medical Data Distributed by Secret
r1.dvi
2006 1 2006.10.6 ( 2 ( ) 1 2 1.5 3 ( ) Ruby Java Java Java ( Web Web http://lecture.ecc.u-tokyo.ac.jp/~kuno/is06/ / ( / @@@ ( 3 ) @@@ : ( ) @@@ (Q&A) ( ) 1 http://www.sodan.ecc.u-tokyo.ac.jp/cgi-bin/qbbs/view.cgi
情報理論 第5回 情報量とエントロピー
5 () ( ) ( ) ( ) p(a) a I(a) p(a) p(a) I(a) p(a) I(a) (2) (self information) p(a) = I(a) = 0 I(a) = 0 I(a) a I(a) = log 2 p(a) = log 2 p(a) bit 2 (log 2 ) (3) I(a) 7 6 5 4 3 2 0 0.5 p(a) p(a) = /2 I(a)
P072-076.indd
3 STEP0 STEP1 STEP2 STEP3 STEP4 072 3STEP4 STEP3 STEP2 STEP1 STEP0 073 3 STEP0 STEP1 STEP2 STEP3 STEP4 074 3STEP4 STEP3 STEP2 STEP1 STEP0 075 3 STEP0 STEP1 STEP2 STEP3 STEP4 076 3STEP4 STEP3 STEP2 STEP1
STEP1 STEP3 STEP2 STEP4 STEP6 STEP5 STEP7 10,000,000 2,060 38 0 0 0 1978 4 1 2015 9 30 15,000,000 2,060 38 0 0 0 197941 2016930 10,000,000 2,060 38 0 0 0 197941 2016930 3 000 000 0 0 0 600 15
1
1 2 3 4 5 6 7 8 9 0 1 2 6 3 1 2 3 4 5 6 7 8 9 0 5 4 STEP 02 STEP 01 STEP 03 STEP 04 1F 1F 2F 2F 2F 1F 1 2 3 4 5 http://smarthouse-center.org/sdk/ http://smarthouse-center.org/inquiries/ http://sh-center.org/
2
2 3 Page 4 5 6 A-1B-1 C0 D0 E0 F0 G0 A0 B0 C1 D1 E1 F1 G1 A1 B1 C2 D2 E2 F2 G2 A2 B2 C3 D3 E3 7 F3 G3 A3 B3 C4 D4 E4 F4 G4 A4 B4 C5 D5 E5 F5 G5 A5 B5 C6 D6 E6 F6 G6 A6 B6 C7 8 Page 9 1 2 3 1 2 10 1 11
untitled
EPX-64S Rev 1.2 1.. 3 1.1.......... 3 1.2....... 3 1.3....... 4 1.4... 4 1.5... 4 2........ 5 2.1.... 5 EPX64S_GetNumberOfDevices........ 5 EPX64S_GetSerialNumber........ 6 EPX64S_Open....... 7 EPX64S_OpenBySerialNumber
5 Armitage x 1,, x n y i = 10x i + 3 y i = log x i {x i } {y i } 1.2 n i i x ij i j y ij, z ij i j 2 1 y = a x + b ( cm) x ij (i j )
5 Armitage. x,, x n y i = 0x i + 3 y i = log x i x i y i.2 n i i x ij i j y ij, z ij i j 2 y = a x + b 2 2. ( cm) x ij (i j ) (i) x, x 2 σ 2 x,, σ 2 x,2 σ x,, σ x,2 t t x * (ii) (i) m y ij = x ij /00 y
橡matufw
3 10 25 3 18 42 1 2 6 2001 8 22 3 03 36 3 4 A 2002 2001 1 1 2014 28 26 5 9 1990 2000 2000 12 2000 12 12 12 1999 88 5 2014 60 57 1996 30 25 205 0 4 120 1,5 A 1995 3 1990 30 6 2000 2004 2000 6 7 2001 5 2002
O
11 2 1 2 1 1 2 1 80 2 160 3 4 17 257 1 2 1 2 3 3 1 2 138 1 1 170 O 3 5 1 5 6 139 1 A 5 2.5 A 1 A 1 1 3 20 5 A 81 87 67 A 140 11 12 2 1 1 1 12 22 1 10 1 13 A 2 3 2 6 1 B 2 B B B 1 2 B 100 B 10 B 3 3 B 1
syuryoku
248 24622 24 P.5 EX P.212 2 P271 5. P.534 P.690 P.690 P.690 P.690 P.691 P.691 P.691 P.702 P.702 P.702 P.702 1S 30% 3 1S 3% 1S 30% 3 1S 3% P.702 P.702 P.702 P.702 45 60 P.702 P.702 P.704 H17.12.22 H22.4.1