• Title/Summary/Keyword: L.M. Montgomery

Search Result 3, Processing Time 0.018 seconds

Efficient Architectures for Modular Exponentiation Using Montgomery Multiplier (Montgomery 곱셈기를 이용한 효율적인 모듈라 멱승기 구조)

  • 하재철;문상재
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.11 no.5
    • /
    • pp.63-74
    • /
    • 2001
  • Modular exponentiation is an essential operation required for implementations of most public key cryptosystems. This paper presents two architectures for modular exponentiation using the Montgomery modular multiplication algorithm combined with two binary exponentiation methods, L-R(Left to Left) algorithms. The proposed architectures make use of MUXes for efficient pre-computation and post-computation in Montgomery\`s algorithm. For an n-bit modulus, if mulitplication with m carry processing clocks can be done (n+m) clocks, the L-R type design requires (1.5n+5)(n+m) clocks on average for an exponentiation. The R-L type design takes (n+4)(n+m) clocks in the worst case.

The Americanization of a Canadian National Icon Anne of Green Gables (캐나다의 국가적 아이콘 『빨강머리 앤』의 미국화)

  • Kang, Suk Jin
    • Journal of English Language & Literature
    • /
    • v.54 no.4
    • /
    • pp.561-577
    • /
    • 2008
  • L.M. Montgomery's Anne of Green Gables is not only confidently labelled a Canadian classic but also placed as a national icon along with the moose, the beaver, and the Habs in Canada. Anne's 'Canadianness' is partly due to its location in the rural world of Prince Edward Island. The fictional Avonlea is described as the ideal space where Canadian spirit can interact with the personified surrounding landscapes through Celtic imagination. Additionally, the communal bond of Avonlea fully demonstrates Scottish Canadian identities. The Scottish national character of Avonlea is responsible for clannishness of the Cuthberts and the Lyndes. The disrespect to the French is also due to Scottish heritage in Avonlea. As an outsider Anne wants to be integrated into the community of Avonlea, and successfully adapts herself to the regional shared values. Meanwhile she partly challenges the strictness and rigidness of the born Canadian Avonlea residents. Despite its Canadian origin, Anne of Green Gables is accepted as part of the American canon of children's literature in the Unite States. The configuration of Anne as an American heroine is noticeable among American scholars: by relocating it to the US the female Bildungsroman in the nineteenth century America, a group of literary critics adapt Anne as an American girl for American readers. The heroine of Anne of Green Gables is linked to American novels such as Louisa May Alcott's Little Women, Kate Douglas Wiggin's Rebecca of Sunnybrook Farm and Gene Stratten Porter's A Girl of the Limberlost. Anne is even classified as another Caddie by American literary critics: Anne is placed at the center of Caddie Woodlawn Syndrome as another Wisconsin pioneer child. Canadian identity of Anne is intentionally excluded and Anne was reborn as an American girl in the U.S. In this context, Anne functions as a sign of nation and a site for cross-national identity formation.

Scalable RSA public-key cryptography processor based on CIOS Montgomery modular multiplication Algorithm (CIOS 몽고메리 모듈러 곱셈 알고리즘 기반 Scalable RSA 공개키 암호 프로세서)

  • Cho, Wook-Lae;Shin, Kyung-Wook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.22 no.1
    • /
    • pp.100-108
    • /
    • 2018
  • This paper describes a design of scalable RSA public-key cryptography processor supporting four key lengths of 512/1,024/2,048/3,072 bits. The modular multiplier that is a core arithmetic block for RSA crypto-system was designed with 32-bit datapath, which is based on the CIOS (Coarsely Integrated Operand Scanning) Montgomery modular multiplication algorithm. The modular exponentiation was implemented by using L-R binary exponentiation algorithm. The scalable RSA crypto-processor was verified by FPGA implementation using Virtex-5 device, and it takes 456,051/3,496347/26,011,947/88,112,770 clock cycles for RSA computation for the key lengths of 512/1,024/2,048/3,072 bits. The RSA crypto-processor synthesized with a $0.18{\mu}m$ CMOS cell library occupies 10,672 gate equivalent (GE) and a memory bank of $6{\times}3,072$ bits. The estimated maximum clock frequency is 147 MHz, and the RSA decryption takes 3.1/23.8/177/599.4 msec for key lengths of 512/1,024/2,048/3,072 bits.