Welcome to our site! EDAboard.com is an international Electronics Discussion Forum focused on EDA software, circuits, schematics, books, theory, papers, asic, pld, 8051, DSP, Network, RF, Analog Design, PCB, Service Manuals... and a whole lot more! To participate you need to register. Registration is free. Click here to register now.
Hi all,
I have acheived a frequency of 50 MHz after place and route.
But still i am getting setup and hold time violation when i am running the timing simulation for 50 MHz.
Anyone has idea why its failing for the frequency that it has acheived after place and route?
Thanks & Regards,
Srilekha
HI friends,
Is there anything specific regarding the size of plain text which is to be encrypted.in few examples i saw the plain text size to be encrypted is of same size of the keys e and n. is there any reason for that.can anyone help me to find it out
also if anyone has got idea of...
i need to generate a random number of 1024 bits width .is anyone having an idea of random number generation using ANSI X 9.31
Thanks and Regards,
Srilekha
HI friends,
i am looking into LFSR technique .my requirement is i need to generate a random number of width 2048 bits.
The crc will be max of 32 bits right.so i am confused .
Thanks and Regards,
Srilekha
HI
u have missed to declare the data type of dc so its taking dc as single bit and assigning the lsb value 1 of (101) and creating a clk of duty cycle 2 ns.
i have declared dc as integer and this code will generate a clk of duty cycle 5 ns and a total clock cycle of 10ns. as u expect
module...
Re: need help for doing modular exponentiation in RSA algori
Hi aslija,
I was checking both R_L and L_R with a sample value
2^10 mod 13 .i have done some mistakes in calculation and was thinking i dint get the exact value of 2^10 mod 13 while using R_L method.but i have found the mistake...
Re: need help for doing modular exponentiation in RSA algori
hi friends,
u have really helped me a lot in understading the modulus inverse.special thanks to Aona.
right now i am using L-R algorithm for RSA which consumes ((n + (no of bits set in exponent e) * n )clks.msb bit of the exponent...
HI Aono how 2^-4 mod 13 is 9 pls give me clarifications
i am just amazing how it works pleas give some brief explanation regarding this.
i am just keep on looking into it for a quiet long time.
Re: need help for doing modular exponentiation in RSA algori
hi ,
Thanks a lot for giving me idea regarding this.right now i am proceeding with radix 2.
i am not able to do understand other radix especially the booth algorithm.
can u give me some details regarding that,
function ModExp(M...
HI everybody,
I need some help regarding Implementing modular exponentiatin in hardware (FPGA). I am making use of Montgomery multiplication to achieve modular exponentiation by repeated squaring and multiplication.
it involves for loop whose iteration is of no of bits of the key...
This site uses cookies to help personalise content, tailor your experience and to keep you logged in if you register.
By continuing to use this site, you are consenting to our use of cookies.
