Search results

Jump to: navigation, search
  • (A or B) and (C or D or E) and (F or G) A and C and F
    23 KB (3,500 words) - 10:13, 1 January 2021
  • * Let ''k<sub>0</sub>'' be the 64-bit integer obtained by interpreting the first 8 by * Let ''k<sub>1</sub>'' be the 64-bit integer obtained by interpreting the second 8 b
    21 KB (3,293 words) - 14:06, 28 October 2022
  • ...due]) if they exist, which can be checked by squaring and comparing with ''c''.</ref> and ''has_even_y(P)'', or fails if ''x'' is greater than ''p-1'' o *** Let ''c = x<sup>3</sup> + 7 mod p''.
    39 KB (6,306 words) - 09:34, 29 May 2023
  • ** The last stack element is called the control block ''c'', and must have length ''33 + 32m'', for a value of ''m'' that is an integ ** Let ''p = c[1:33]'' and let ''P = lift_x(int(p))'' where ''lift_x'' and ''[:]'' are def
    43 KB (6,814 words) - 18:04, 29 June 2023
  • ...h generate the byte array identical to the evaluation of '\x01\x02' in the C programming language). There is no leading '0x' or '0X' in the output. # Generate a cryptographically secure random nonce ''k'' between ''1'' and ''n-1''. This can be implemented by generating four 64-
    18 KB (2,932 words) - 06:14, 6 August 2022
  • c = [] c.append(m)
    38 KB (5,537 words) - 05:05, 30 March 2023
  • In contrast to BIP340 signing, the values ''k<sub>1</sub>'' and ''k<sub>2</sub>'' '''must not be derived deterministically''' from the session ...due]) if they exist, which can be checked by squaring and comparing with ''c''.</ref> and ''has_even_y(P)'', or fails if ''x'' is greater than ''p-1'' o
    68 KB (10,851 words) - 09:46, 29 March 2023

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)